New bounds for equiangular lines and spherical two-distance sets

DOI10.1137/16M109377XzbMATH Open1366.52024arXiv1609.01036MaRDI QIDQ5346565FDOQ5346565

Authors: Wei-Hsuan Yu 

Publication date: 24 May 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Abstract: A set of lines in $mathbb{R}^n$ is called equiangular if the angle between each pair of lines is the same. We derive new upper bounds on the cardinality of equiangular lines. Let us denote the maximum cardinality of equiangular lines in $mathbb{R}^n$ with the common angle $arccosalpha$ by $M_{alpha}(n)$. We prove that $M_{frac1a}(n)leqfrac12(a^2-2)(a^2-1)$ for any $ninmathbbN$ in the interval $a^2-2leqnleq3a^2-16$ and $ageq3$. Moreover, we discuss the relation between equiangular lines and spherical two-distance sets and we obtain the new results on the maximum spherical two-distance sets in $mathbb{R}^n$ up to $nleq417$.

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

Recommendations

• Upper bounds for \(s\)-distance sets and equiangular lines
• New bounds for equiangular lines
• Equiangular lines and spherical codes in Euclidean space
• Bounds on equiangular lines and on related spherical codes
• Equiangular lines in Euclidean spaces

zbMATH Keywords

semidefinite programmingequiangular linestwo-distance set

Mathematics Subject Classification ID

Linear programming (90C05) Semidefinite programming (90C22) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Configurations and arrangements of linear subspaces (14N20)

Cites Work

• Title not available (Why is that?)
• Spherical codes and designs
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• Title not available (Why is that?)
• Equiangular lines in Euclidean spaces
• The nonexistence of certain tight spherical designs
• New upper bounds for kissing numbers from semidefinite programming
• Equiangular lines
• On tight spherical designs
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• Spherical two-distance sets
• New Bounds for Spherical Two-Distance Sets
• Spherical designs of harmonic index \(t\)
• On spherical designs of some harmonic indices
• A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
• Bounds on equiangular lines and on related spherical codes
• Equiangular lines and spherical codes in Euclidean space
• New bounds for equiangular lines
• There is no (75,32,10,16) strongly regular graph

Cited In (20)

• A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
• New bounds for equiangular lines
• ON 2-TRANSITIVE SETS OF EQUIANGULAR LINES
• Biangular lines revisited
• Spherical two-distance sets and eigenvalues of signed graphs
• On equiangular lines in $17$ dimensions and the characteristic polynomial of a Seidel matrix
• Nearly orthogonal vectors and small antipodal spherical codes
• \(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
• Real equiangular lines in dimension 18 and the Jacobi identity for complementary subgraphs
• Equiangular lines in Euclidean spaces: Dimensions 17 and 18
• A generalization of Gerzon's bound on spherical \(s\)-distance sets
• Bounds on equiangular lines and on related spherical codes
• Equiangular lines in low dimensional Euclidean spaces
• New upper bounds for equiangular lines by pillar decomposition
• Nearly orthogonal vectors and small antipodal spherical codes
• New Bounds for Spherical Two-Distance Sets
• 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 and spherical two-distance sets

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