Erdős Problem #662
Prior state unknown→disproved
natural readings of the ambiguous historical statement are disproved
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
geometry-topology / Discrete Geometry
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.
10Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
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.
natural readings of the ambiguous historical statement are disproved
Recorded attempts
Evidence graph
Connected research record
No public relationships recorded yet.