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.
Result history
No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.
Correction history
No correction history
Technical details
Exact provenance
- Problem row
- sha256:866a3fb1a040f89fac216106a0c62e733373851b676b717e3b221b8e3bf00e6e
- Metadata
- sha256:37803084c54692027e9bce1fab5962e463333c7e1a7777a2414c3cff4c629e03
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:4462906b275c20f552fece68c57f4d681b689fd2722c35f7a65ed5e4c2e27c56
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207