Bounds on Equiangular Lines and on Related Spherical Codes

An $L$-spherical code is a set of Euclidean unit vectors whose pairwise inner products belong to the set $L$. We show, for a fixed $\alpha,\beta>0$, that the size of any $[-1,-\beta]\cup\{\alpha\}$-spherical code is at most linear in the dimension. In particular, this bound applies to sets of lines such that every two are at a fixed angle to each another.

[1]  Jonathan Jedwab,et al.  Large sets of complex and real equiangular lines , 2015, J. Comb. Theory, Ser. A.

[2]  B. Bukh.  Ranks of matrices with few distinct entries , 2015, 1508.00145.

[3]  Akihiro Munemasa,et al.  Equiangular lines in Euclidean spaces , 2014, J. Comb. Theory, Ser. A.

[4]  J. Seidel,et al.  SPHERICAL CODES AND DESIGNS , 1991 .

[5]  Peter Keevash,et al.  Bounds for spherical codes , 2016, 1602.07645.

[6]  Alexander Barg,et al.  New bounds for equiangular lines , 2013, Discrete Geometry and Algebraic Combinatorics.

[7]  Dominique de Caen,et al.  Large Equiangular Sets of Lines in Euclidean Space , 2000, Electron. J. Comb..

[8]  Arnold Neumaier,et al.  Graph representations, two-distance sets, and equiangular lines , 1989 .

[9]  J. J. Seidel,et al.  Equilateral point sets in elliptic geometry , 1966 .