← All problems

The asymptotic two-smallest-distances conjecture for planar point sets

Let SS be a set of nn points in the plane. Let m1(S)m_1(S) and m2(S)m_2(S) be the numbers of occurrences of the smallest and second smallest distances in SS, respectively, and let f(n)f(n) be the maximum of m1(S)+m2(S)m_1(S)+m_2(S) over all such sets. For the triangular lattice, let e(n)e(n) denote the maximum number of edges in an induced nn-vertex subgraph of the specified triangular-lattice Cayley graph; equivalently, for n≥3n\geq 3,

e(n):={6n−46n−6if n=24k2−24k+7 for some k∈N,⌊6n−96n−63⌋otherwise.e(n):=\begin{cases} 6n-4\sqrt{6n-6}&\text{if }n=24k^2-24k+7\text{ for some }k\in\mathbb{N},\\ \lfloor 6n-\sqrt{96n-63}\rfloor&\text{otherwise}.\end{cases}

Asymptotic two-smallest-distances conjecture. For any sufficiently large nn, f(n)=e(n)f(n)=e(n), and the only sets SS attaining f(n)=m1(S)+m2(S)f(n)=m_1(S)+m_2(S) are geometrically similar to the extremal sets on the triangular lattice. The theorem preceding this conjecture supplies the lower bound f(n)≥e(n)f(n)\geq e(n), while the known general upper bound is f(n)≤6nf(n)\leq 6n. The conjecture asserts both eventual sharpness of the lattice construction and uniqueness up to geometric similarity.

References
  1. Cameron Strachan and Konrad Swanepoel, “Edge isoperimetry of lattices”, arXiv:2503.09591 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.