Kusner’s conjecture on equilateral sets in ℓ_p^n

For every integer n≥1n\geq 1 and every real pp satisfying 2<p<∞2<p<\infty, the maximum cardinality of an equilateral set in ℓpn\ell_p^n is e(ℓpn)=n+1e(\ell_p^n)=n+1. Equivalently, every set X⊂RnX\subset\mathbb{R}^n whose distinct points have pairwise ℓp\ell_p-distance 11 has at most n+1n+1 elements.

References

Primary source

arXiv

Additional references

Progress summary

Refreshed
Claimed solved

A new unrefereed preprint claims the conjecture fails by exhibiting 58 equally separated points in a 56-dimensional five-norm space, while another preprint claims the bound through four.

R. B. Kusner posed the conjecture in 1983: every equilateral set in ℓpn\ell_p^n should have at most n+1n+1 points for p≥2p\ge 2. The new construction directly challenges this finite-pp range.

Known results

  • The conjecture was known for p=2p=2 and p=4p=4 before the 2026 developments.
  • For every 1<p<21<p<2, earlier constructions give failures in sufficiently large dimension; some explicit cases already occur in dimension 66 (2003–2004).
  • Large-pp work provides improved upper bounds but does not settle the conjecture (2020).

June–August 2026 developments

A June preprint claims the bound e(ℓpn)≤n+1e(\ell_p^n)\le n+1 for all 2≤p≤42\le p\le4. In August, Logan R. Chalmers claimed an exact-arithmetic-certified configuration with e(ℓ556)≥58>57e(\ell_5^{56})\ge58>57, the first finite-p≥2p\ge2 example exceeding n+1n+1; persistence near p=5p=5 would place the failure threshold in [4,5)[4,5).

Current status (as of August 2026): The bound is claimed for 2≤p≤42\le p\le4 and a counterexample is claimed at p=5p=5, but both 2026 preprint claims remain unverified.

Sources

Solutions 0

No solutions have been posted yet.