An improved algorithm to construct spanning paths with low crossing numbers
Csikos MonikaBBC+G Seminar
on 3/31/23
Let be a natural number. We determine the minimum possible size of the difference set in terms of for any sufficiently large finite subset of that is not contained in a translate of a hyperplane. By a construction of Stanchescu, this is best possible and thus resolves an old question first raised by Uhrin. If time permits, we will also discuss some recent related results. Joint work with Jeck Lim.