A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
From MaRDI portal
Publication:901158
DOI10.1016/J.EJC.2015.11.003zbMATH Open1328.05034arXiv1409.6995OpenAlexW2195670318MaRDI QIDQ901158FDOQ901158
Authors: Takayuki Okuda, Wei-Hsuan Yu 
Publication date: 23 December 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: We give a new upper bound of the cardinality of a set of equiangular lines in with a fixed angle for each satisfying certain conditions. Our techniques are based on semi-definite programming methods for spherical codes introduced by Bachoc--Vallentin [J.Amer.Math.Soc.2008]. As a corollary to our bound, we show the nonexistence of spherical tight designs of harmonic index 4 on with .
Full work available at URL: https://arxiv.org/abs/1409.6995
Recommendations
- The nonexistence of certain tight spherical designs
- New bounds for equiangular lines and spherical two-distance sets
- On spherical designs of some harmonic indices
- Bounds on antipodal spherical designs with few angles
- New nonexistence results for spherical designs
- scientific article; zbMATH DE number 1959435
- On optimal tight 4-designs on 2 concentric spheres
- A Sharpening of the Welch Bounds and the Existence of Real and Complex Spherical $t$ –Designs
- scientific article; zbMATH DE number 1456826
- New bounds for equiangular lines
Cites Work
- Title not available (Why is that?)
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Equiangular lines in Euclidean spaces
- Optimality and uniqueness of the \((4,10,1/6)\) spherical code
- New upper bounds for kissing numbers from semidefinite programming
- Equiangular lines
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- New Bounds for Spherical Two-Distance Sets
- Spherical designs of harmonic index \(t\)
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Bounds for codes by semidefinite programming
- New bounds for equiangular lines
Cited In (20)
- Design theory from the viewpoint of algebraic combinatorics
- Half of an antipodal spherical design
- On equiangular lines in $17$ dimensions and the characteristic polynomial of a Seidel matrix
- \(p\)-adic Welch bounds and \(p\)-adic Zauner conjecture
- \(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
- Bounds on equiangular lines and on related spherical codes
- Equiangular lines in low dimensional Euclidean spaces
- Classification of spherical 2-distance \(\{4,2,1\}\)-designs by solving Diophantine equations
- New upper bounds for equiangular lines by pillar decomposition
- Enumeration of Seidel matrices
- The change of Seidel energy of tripartite Turán graph due to edge deletion
- Spherical designs and modular forms of the \(D_4\) lattice
- Harmonic index designs in binary Hamming schemes
- New bounds for equiangular lines and spherical two-distance sets
- Equiangular lines and the Lemmens-Seidel conjecture
- Upper bounds for \(s\)-distance sets and equiangular lines
- Title not available (Why is that?)
- On spherical designs of some harmonic indices
This page was built for publication: A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q901158)
