New bounds for equiangular lines

MaRDI QIDQ3464535zbMATH OpenFDO

Authors Alexander Barg, Wei-Hsuan Yu

Publication date 27 January 2016

Full work available at URL https://arxiv.org/abs/1311.3219

zbMATH Keywords

semidefinite programmingequiangular linestight designstwo-distance sets

Mathematics Subject Classification ID

Semidefinite programming (90C22) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Abstract: A set of lines in $mathbb{R}^n$ is called equiangular if the angle between each pair of lines is the same. We address the question of determining the maximum size of equiangular line sets in $mathbb{R}^n$, using semidefinite programming to improve the upper bounds on this quantity. Improvements are obtained in dimensions $24leqnleq136$. In particular, we show that the maximum number of equiangular lines in $mathbb{R}^n$ is $276$ for all $24leqnleq41$ and is 344 for $n=43.$ This provides a partial resolution of the conjecture set forth by Lemmens and Seidel (1973).

Recommendations

• Equiangular lines and spherical codes in Euclidean space
• New bounds for equiangular lines and spherical two-distance sets
• Equiangular lines and the Lemmens-Seidel conjecture
• Equiangular lines in Euclidean spaces
• \(k\)-point semidefinite programming bounds for equiangular lines

Cited in

(28)

• Equi-isoclinic planes of Euclidean spaces
• A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
• Semidefinite programming bounds for binary codes from a split Terwilliger algebra
• The Lemmens-Seidel conjecture and forbidden subgraphs
• On maximal antipodal spherical codes with few distances
• scientific article; zbMATH DE number 2196437 (Why is no real title available?)
• Equiangular lines in Euclidean spaces
• \(k\)-point semidefinite programming bounds for equiangular lines
• \(p\)-adic Welch bounds and \(p\)-adic Zauner conjecture
• On the size of maximal binary codes with 2, 3, and 4 distances
• Equiangular lines in Euclidean spaces: Dimensions 17 and 18
• scientific article; zbMATH DE number 840680 (Why is no real title available?)
• Bounds on equiangular lines and on related spherical codes
• Semidefinite programming bounds for spherical three-distance sets
• Finite two-distance tight frames
• Equiangular lines in low dimensional Euclidean spaces
• Saturated configuration and new large construction of equiangular lines
• A simple construction of complex equiangular lines
• Equiangular lines with a fixed angle
• New upper bounds for equiangular lines by pillar decomposition
• Enumeration of Seidel matrices
• Equiangular lines and subspaces in Euclidean spaces
• New bounds for equiangular lines and spherical two-distance sets
• Equiangular subspaces in Euclidean spaces
• Equiangular lines and the Lemmens-Seidel conjecture
• Equiangular line systems and switching classes containing regular graphs
• Upper bounds for \(s\)-distance sets and equiangular lines
• Equiangular lines and spherical codes in Euclidean space

This page was built for publication: New bounds for equiangular lines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3464535)