The Lasserre hierarchy for equiangular lines with a fixed angle
Preprint
Abstract
We compute the second and third levels of the Lasserre hierarchy for the spherical finite distance problem. A connection is used between invariants in representations of the orthogonal group and representations of the general linear group, which allows computations in high dimensions. We give new linear bounds on the maximum number of equiangular lines in dimension $n$ with common angle $\arccos \alpha$. These are obtained through asymptotic analysis in $n$ of the semidefinite programming bound given by the second level.
Keywords
All Related Versions
This publication has 57 references indexed in Scilit:
- k-Point semidefinite programming bounds for equiangular linesMathematical Programming, 2021
- Equiangular lines and spherical codes in Euclidean spaceInventiones Mathematicae, 2017
- Semidefinite bounds for nonbinary codes based on quadruplesDesigns, Codes and Cryptography, 2016
- The Density of Sets Avoiding Distance 1 in Euclidean SpaceDiscrete & Computational Geometry, 2015
- A semidefinite programming hierarchy for packing problems in discrete geometryMathematical Programming, 2014
- Structure and Geometry of Lie Groups2012
- Lower Bounds for Measurable Chromatic NumbersGeometric and Functional Analysis, 2009
- Representation Theory2004
- Spherical codes and designsGeometriae Dedicata, 1977
- A characterisation of Leech's latticeInventiones Mathematicae, 1969