Spherical two-distance sets and eigenvalues of signed graphs

DOI10.1007/S00493-023-00002-1MaRDI QIDQ6057494zbMATH OpenOpenAlexFDO

Authors Zilin Jiang, Jonathan Tidor, Yuan Yao, Shengtong Zhang, Yufel Zhao

Publication date 4 October 2023

Published in Combinatorica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

eigenvalue multiplicitysigned graphspherical two-distance set

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Ramsey theory (05D10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Abstract: We study the problem of determining the maximum size of a spherical two-distance set with two fixed angles (one acute and one obtuse) in high dimensions. Let $$ denote the maximum number of unit vectors in $mathbb{R}^d$ where all pairwise inner products lie in $$. For fixed $$, we propose a conjecture for the limit of $$ as $doinfty$ in terms of eigenvalue multiplicities of signed graphs. We determine this limit when $$ or $$. Our work builds on our recent resolution of the problem in the case of $$ (corresponding to equiangular lines). It is the first determination of $$ for any nontrivial fixed values of $alpha$ and $$ outside of the equiangular lines setting.

Review text

A set of unit vectors in real \(d\)-dimensional space is a spherical two-distance set if the inner product of distinct vectors of the set only take two values. Much work in discrete geometry has been done to determine the maximum size of a spherical two-distance set.\par In this paper, the authors study the problem of determining the maximum size of a spherical two-distance set with two fixed angles (one acute and one obtuse) in high dimensions. Let \(N_{\alpha, \beta}(d)\) denote the maximum number of unit vectors where all pairwise inner products lie in \(\{\alpha, \beta\}\). The special case where \(\alpha =-\beta\) corresponds to equiangular lines which has a rich history. The authors expand upon recent work to achieve novel results that are the first to significantly expand this area of study. For fixed \(-1\le \beta<0\le\alpha <1\), the authors use eigenvalue multiplicities of signed graphs to determine the limit of \(\frac{N_{\alpha, \beta}(d)}{d}\) as \(d \to \infty\).

Recommendations

• Spherical two-distance sets
• New Bounds for Spherical Two-Distance Sets
• Upper bounds for \(s\)-distance sets and equiangular lines
• Graph representations, two-distance sets, and equiangular lines
• New bounds for equiangular lines and spherical two-distance sets

Cited in

(12)

• scientific article; zbMATH DE number 5901910 (Why is no real title available?)
• Graphs with high second eigenvalue multiplicity
• Nodal domain theorems for p-Laplacians on signed graphs
• Eigenpairs of adjacency matrices of balanced signed graphs
• Curvature, diameter and signs of graphs
• On the size of maximal binary codes with 2, 3, and 4 distances
• Forbidden induced subgraphs for graphs and signed graphs with eigenvalues bounded from below
• Uniacute spherical codes
• On symmetric hollow integer matrices with eigenvalues bounded from below
• Repelling curvature via -repelling Laplacian on positive connected signed graphs
• Set families: restricted distances via restricted intersections
• Sparsest cut and eigenvalue multiplicities on low degree abelian Cayley graphs

This page was built for publication: Spherical two-distance sets and eigenvalues of signed graphs

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