New bounds for equiangular lines

zbMATH Open1333.52027arXiv1311.3219MaRDI QIDQ3464535FDOQ3464535

Authors: Alexander Barg, Wei-Hsuan Yu 

Publication date: 27 January 2016

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

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

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

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)

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
• Title not available (Why is that?)
• \(p\)-adic Welch bounds and \(p\)-adic Zauner conjecture
• On the size of maximal binary codes with 2, 3, and 4 distances
• \(k\)-point semidefinite programming bounds for equiangular lines
• Equiangular lines in Euclidean spaces
• Equiangular lines in Euclidean spaces: Dimensions 17 and 18
• Title not available (Why is that?)
• Semidefinite programming bounds for spherical three-distance sets
• Bounds on equiangular lines and on related spherical codes
• Finite two-distance tight frames
• Equiangular lines in low dimensional Euclidean spaces
• A simple construction of complex equiangular lines
• Saturated configuration and new large construction of equiangular lines
• Equiangular lines with a fixed angle
• New upper bounds for equiangular lines by pillar decomposition
• Enumeration of Seidel matrices
• New bounds for equiangular lines and spherical two-distance sets
• Equiangular lines and subspaces in Euclidean spaces
• 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)