k-Point semidefinite programming bounds for equiangular lines
D. de Laat (TU Delft - Discrete Mathematics and Optimization)
Fabrício Caluza Machado (Universidade de São Paulo)
Fernando Mário de Oliveira Filho (TU Delft - Discrete Mathematics and Optimization)
Frank Vallentin (Universität zu Köln)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
We propose a hierarchy of k-point bounds extending the Delsarte–Goethals–Seidel linear programming 2-point bound and the Bachoc–Vallentin semidefinite programming 3-point bound for spherical codes. An optimized implementation of this hierarchy allows us to compute 4, 5, and 6-point bounds for the maximum number of equiangular lines in Euclidean space with a fixed common angle.
help_outline