Spherical two-distance sets and eigenvalues of signed graphs (Q6057494)

A set of unit vectors in real \(d\)-dimensional space is a spherical two-distance set if the inner product of distinct vectors of the set only take two values. Much work in discrete geometry has been done to determine the maximum size of a spherical two-distance set.\par In this paper, the authors study the problem of determining the maximum size of a spherical two-distance set with two fixed angles (one acute and one obtuse) in high dimensions. Let \(N_{\alpha, \beta}(d)\) denote the maximum number of unit vectors where all pairwise inner products lie in \(\{\alpha, \beta\}\). The special case where \(\alpha =-\beta\) corresponds to equiangular lines which has a rich history. The authors expand upon recent work to achieve novel results that are the first to significantly expand this area of study. For fixed \(-1\le \beta<0\le\alpha <1\), the authors use eigenvalue multiplicities of signed graphs to determine the limit of \(\frac{N_{\alpha, \beta}(d)}{d}\) as \(d \to \infty\).