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.
Nothing has been recorded here yet.
How far the record reaches2 of 6 stages
- Sourceerdos-problems
- StatementRetained
- FormalNone associated
- ResolutionNone filed
- WorkNone recorded
- DecisionNone here
- The questionNot reached
What this record is missingFormal declaration
No formal declaration is associated with this question.
A formal statement is the first thing a check can run against.
Where the source files it110 share a topic
Erdős problem 94acceptedCarrying a Standing. Browse the topic.