Bounds on antipodal spherical designs with few angles

DOI10.37236/9891zbMath1471.05017arXiv2007.13999OpenAlexW3195141816MaRDI QIDQ2049613

Yanyan Li

Publication date: 27 August 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\(s\)-distance setoptimal line packing problem

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30) Combinatorial geometries and geometric closure systems (51D20)

Cites Work

• Unnamed Item
• Unnamed Item
• Spectra of graphs
• On the construction of equiangular frames from graphs
• On the existence of equiangular tight frames
• A survey on spherical designs and algebraic combinatorics on spheres
• Designs as maximum codes in polynomial metric spaces
• Spherical codes and designs
• Tight spherical designs. I
• McLaren's improved snub cube and other new spherical designs in three dimensions
• Energy on spheres and discreteness of minimizing measures
• Classification of spherical 2-distance \(\{4,2,1\}\)-designs by solving Diophantine equations
• Non-existence of (76,30,8,14) strongly regular graph
• Equiangular lines
• Bounds on s-Distance Sets with Strength t
• Universally optimal distribution of points on spheres
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• Regular 2-Graphs
• Packings in Real Projective Spaces
• Packing Lines, Planes, etc.: Packings in Grassmannian Spaces

This page was built for publication: Bounds on antipodal spherical designs with few angles