Upper bounds for s-distance sets and equiangular lines

DOI10.1016/J.AIM.2018.03.024zbMATH Open1394.52026arXiv1611.09479OpenAlexW2962992826WikidataQ130025486 ScholiaQ130025486MaRDI QIDQ1644979FDOQ1644979

Authors: Alexey Glazyrin, Wei-Hsuan Yu 

Publication date: 22 June 2018

Published in: Advances in Mathematics (Search for Journal in Brave)

Abstract: The set of points in a metric space is called an $s$-distance set if pairwise distances between these points admit only $s$ distinct values. Two-distance spherical sets with the set of scalar products $alpha,-alpha$, $alphain[0,1)$, are called equiangular. The problem of determining the maximum size of $s$-distance sets in various spaces has a long history in mathematics. We suggest a new method of bounding the size of an $s$-distance set in compact two-point homogeneous spaces via zonal spherical functions. This method allows us to prove that the maximum size of a spherical two-distance set in $mathbb{R}^n$, $ngeq7$, is $fracn(n+1)2$ with possible exceptions for some $n=(2k+1{)}^2-3$, $kinmathbbN$. We also prove the universal upper bound $simfrac23n{a}^2$ for equiangular sets with $alpha=frac1a$ and, employing this bound, prove a new upper bound on the size of equiangular sets in all dimensions. Finally, we classify all equiangular sets reaching this new bound.

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

Recommendations

• New bounds for equiangular lines and spherical two-distance sets
• Spherical two-distance sets
• Bounds on three- and higher-distance sets
• Bounds on \(s\)-distance sets with strength \(t\)
• New Bounds for Spherical Two-Distance Sets

zbMATH Keywords

semidefinite programmingequiangular lines\(s\)-distance sets

Mathematics Subject Classification ID

Semidefinite programming (90C22) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection theorems with geometric consequences
• The complete nontrivial-intersection theorem for systems of finite sets
• Positive definite functions on spheres
• Universally optimal distribution of points on spheres
• Title not available (Why is that?)
• On the Erdős distinct distances problem in the plane
• Title not available (Why is that?)
• Grassmannian frames with applications to coding and communication
• Finite two-distance tight frames
• A characterisation of Leech's lattice
• Erdős-Ko-Rado theorems. Algebraic approaches
• On Sets of Distances of n Points
• The exact bound in the Erdős-Ko-Rado theorem
• On the existence of equiangular tight frames
• Title not available (Why is that?)
• A survey on spherical designs and algebraic combinatorics on spheres
• Spherical codes and designs
• Tight spherical designs. I
• Optimal frames for erasures.
• Large equiangular sets of lines in euclidean space
• Two-point homogeneous spaces
• Erdös–Ko–Rado Theorem—22 Years Later
• A generalization of Larman-Rogers-Seidel's theorem
• Title not available (Why is that?)
• Equiangular lines in Euclidean spaces
• New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
• On the construction of equiangular frames from graphs
• Title not available (Why is that?)
• New upper bounds for kissing numbers from semidefinite programming
• On t-designs
• Equiangular lines
• On tight spherical designs
• Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances
• A new proof of several inequalities on codes and sets
• Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
• Intersection Properties of Systems of Finite Sets
• Title not available (Why is that?)
• The Erdős-Ko-Rado theorem for twisted Grassmann graphs
• Erdős-Ko-Rado-type results over \(J_q(n,d),H_q(n,d)\) and their designs
• Spherical two-distance sets
• An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
• New maximal two-distance sets
• New Bounds for Spherical Two-Distance Sets
• Title not available (Why is that?)
• Bounds on three- and higher-distance sets
• The sphere packing problem in dimension 8
• Spherical designs of harmonic index \(t\)
• On Two-Distance Sets in Euclidean Space
• 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 sets with few distances
• Bounds on equiangular lines and on related spherical codes
• Equiangular tight frames with centroidal symmetry
• Equiangular lines and spherical codes in Euclidean space
• Equiangular Tight Frames From Hyperovals
• New bounds for equiangular lines
• New bounds for equiangular lines and spherical two-distance sets
• Title not available (Why is that?)
• Forbidden subgraphs for graphs of bounded spectral radius, with applications to equiangular lines
• Large sets of complex and real equiangular lines

Cited In (43)

• Open problems in the spectral theory of signed graphs
• Complex spherical codes with three inner products
• Spherical two-distance sets and eigenvalues of signed graphs
• Bounds for sets with few distances distinct modulo a prime ideal
• On codes with distances \(d\) and \(n\)
• Majorization and minimal energy on spheres
• 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
• Nearly \(k\)-distance sets
• \(k\)-point semidefinite programming bounds for equiangular lines
• Graphs and spherical two-distance sets
• Title not available (Why is that?)
• Repeated minimizers of \(p\)-frame energies
• Real equiangular lines in dimension 18 and the Jacobi identity for complementary subgraphs
• Bounds on \(s\)-distance sets with strength \(t\)
• A new proof of a generalization of Gerzon's bound
• Equiangular lines in Euclidean spaces: Dimensions 17 and 18
• Semidefinite programming bounds for spherical three-distance sets
• Title not available (Why is that?)
• An upper bound for the size of \(s\)-distance sets in real algebraic sets
• A generalization of Gerzon's bound on spherical \(s\)-distance sets
• Bounds on equiangular lines and on related spherical codes
• Maximality of Seidel matrices and switching roots of graphs
• Equiangular lines in low dimensional Euclidean spaces
• Bounds for the sum of distances of spherical sets of small size
• Saturated configuration and new large construction of equiangular lines
• Equiangular lines with a fixed angle
• An upper bound for the cardinality of an \(s\)-distance set in Euclidean space
• New upper bounds for equiangular lines by pillar decomposition
• Forbidden subgraphs for graphs of bounded spectral radius, with applications to equiangular lines
• A remark on sets with few distances in \(\mathbb{R}^d\)
• Regular two-distance sets
• New bounds for equiangular lines and spherical two-distance sets
• Bounds on three- and higher-distance sets
• Constructions and restrictions for balanced splittable Hadamard matrices
• Bounds on antipodal spherical designs with few angles
• Equiangular lines and the Lemmens-Seidel conjecture
• Maximal 2-distance sets containing the regular simplex
• On a generalization of distance sets
• Spherical two-distance sets
• Equiangular line systems and switching classes containing regular graphs
• New maximal two-distance sets

This page was built for publication: Upper bounds for \(s\)-distance sets and equiangular lines

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