k-Point semidefinite programming bounds for equiangular lines

David de Laat, Fabrício Caluza Machado, Fernando Mário de Oliveira Filho, Frank Vallentin

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)
16 Downloads (Pure)


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.

Original languageEnglish
Pages (from-to)533-567
Number of pages35
JournalMathematical Programming
Issue number1-2
Publication statusPublished - 2021


Dive into the research topics of 'k-Point semidefinite programming bounds for equiangular lines'. Together they form a unique fingerprint.

Cite this