Erdős problem 662
Among sufficiently large one-separated planar point sets, does the triangular lattice maximize the number of distances below each threshold? Explicit rational oblique lattices beat the triangular lattice under several closed- and strict-shell readings.
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
No source in this release retained material for this Problem beyond its catalogue entry.
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
Typos identified
construction
- Machine
- Reported outcome