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.
- Formal statements
- Not classified
- Erdős Problems says
- open
- Decision here
- No current contribution
- Checks
- 0 checks · 0 formal
Current Result
Current Result
No result has been accepted here yet.
- Type
- —
- Evidence
- 0 artifacts
- Decision
- None
- Reviewed
- No date retained