Search arXivSearch

arXiv · 2006.06633

Spherical two-distance sets and eigenvalues of signed graphs

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 $N_{α,β}(d)$ denote the maximum number of unit vectors in $\mathbb R^d$ where all pairwise inner products lie in $\{α,β\}$. For fixed $-1\leqβ<0\leqα<1$, we propose a conjecture for the limit of $N_{α,β}(d)/d$ as $d \to \infty$ in terms of eigenvalue multiplicities of signed graphs. We determine this limit when $α+2β<0$ or $(1-α)/(α-β) \in \{1, \sqrt{2}, \sqrt{3}\}$. Our work builds on our recent resolution of the problem in the case of $α= -β$ (corresponding to equiangular lines). It is the first determination of $\lim_{d \to \infty} N_{α,β}(d)/d$ for any nontrivial fixed values of $α$ and $β$ outside of the equiangular lines setting.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zilin Jiang, Jonathan Tidor, Yuan Yao, Shengtong Zhang, Yufei Zhao. 2022-06-01. Spherical two-distance sets and eigenvalues of signed graphs. https://doi.org/10.1007/s00493-023-00002-1

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO