Advanced search
Start date
Betweenand


k-Point semidefinite programming bounds for equiangular lines

Full text
Author(s):
de Laat, David ; Machado, Fabricio Caluza ; de Oliveira Filho, Fernando Mario ; Vallentin, Frank
Total Authors: 4
Document type: Journal article
Source: MATHEMATICAL PROGRAMMING; v. 194, n. 1-2, p. 35-pg., 2021-04-21.
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. (AU)

FAPESP's process: 17/25237-4 - Applications of harmonic analysis to Discrete Geometry
Grantee:Fabrício Caluza Machado
Support Opportunities: Scholarships in Brazil - Doctorate