English

Bounds on two-distance sets in Euclidean space and Unit Sphere

Combinatorics 2025-09-03 v1

Abstract

We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations and apply eigenvalue analysis to obtain explicit bounds. For Euclidean space, we have the upper bounds for the cardinality nn of a two-distance set. n(d+1)((1+δ21δ2)21)(1+δ21δ2)2(d+1)+1. n \le \dfrac{(d+1)\left(\left(\frac{1+\delta^2}{1-\delta^2}\right)^2 - 1\right)}{\left(\frac{1+\delta^2}{1-\delta^2}\right)^2-(d+1)}+1. if the two distances are 11 and δ\delta in Rd\mathbb{R}^d. For spherical two-distance sets with nn points and inner products a,ba, b on Sd1\mathbb{S}^{d-1}, we will have the following: {nd((a+b2ba)21)(a+b2ba)2d,a+b0;n(d+1)((a+b2ba)21)(a+b2ba)2(d+1),a+b<0. \begin{cases} n \le \dfrac{d\left(\left(\dfrac{a+b-2}{b-a}\right)^2-1\right)}{\left(\dfrac{a+b-2}{b-a}\right)^2-d}, &a+b \ge 0; n \le \dfrac{(d+1)\left(\left(\dfrac{a+b-2}{b-a}\right)^2-1\right)}{\left(\dfrac{a+b-2}{b-a}\right)^2-(d+1)}, &a+b < 0. \end{cases} Notice that the second bound (for a+b<0a+b < 0) is the same as the relative bound for the equiangular lines in one higher dimension.

Keywords

Cite

@article{arxiv.2509.00858,
  title  = {Bounds on two-distance sets in Euclidean space and Unit Sphere},
  author = {Wei-Chun Chen and Wei-Hsuan Yu},
  journal= {arXiv preprint arXiv:2509.00858},
  year   = {2025}
}

Comments

24 pages

R2 v1 2026-07-01T05:14:08.651Z