Bounds on two-distance sets in Euclidean space and Unit Sphere
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 $n$ of a two-distance set. [ n \le \dfrac{(d+1)\left(\left(\frac{1+\delta2}{1-\delta2}\right)2 - 1\right)}{\left(\frac{1+\delta2}{1-\delta2}\right)2-(d+1)}+1. ] if the two distances are $1$ and $\delta$ in $\mathbb{R}d$. For spherical two-distance sets with $n$ points and inner products $a, b$ on $\mathbb{S}{d-1}$, we will have the following: [ \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 < 0$) is the same as the relative bound for the equiangular lines in one higher dimension.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.