k-Point semidefinite programming bounds for equiangular lines

Autor(es)

de Laat, David ; Machado, Fabricio Caluza ; de Oliveira Filho, Fernando Mario ; Vallentin, Frank

• Tipo de documento: Artigo Científico
• Fonte: MATHEMATICAL PROGRAMMING; v. 194, n. 1-2, p. 35-pg., 2021-04-21.

Resumo

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. (AU)

• Processo FAPESP: 17/25237-4 - Aplicações de análise harmônica em Geometria Discreta
• Beneficiário: Fabrício Caluza Machado
• Modalidade de apoio: Bolsas no Brasil - Doutorado