TY - JOUR
T1 - k-Point semidefinite programming bounds for equiangular lines
AU - de Laat, David
AU - Caluza Machado, Fabrício
AU - de Oliveira Filho, Fernando Mário
AU - Vallentin, Frank
PY - 2021
Y1 - 2021
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85104952812&partnerID=8YFLogxK
U2 - 10.1007/s10107-021-01638-x
DO - 10.1007/s10107-021-01638-x
M3 - Article
AN - SCOPUS:85104952812
SN - 0025-5610
VL - 194
SP - 533
EP - 567
JO - Mathematical Programming
JF - Mathematical Programming
IS - 1-2
ER -