A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
k-Point semidefinite programming bounds for equiangular lines
2021
Mathematical programming
Preserved Fulltext
AbstractWe 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.
doi:10.1007/s10107-021-01638-x
fatcat:pieyhz3aave2zlmm6yg34fap5m