Abstract:The smallest eigenvalue of a graph is the smallest eigenvalue of its adjacency matrix. We show that the family of graphs with smallest eigenvalue at least −λ can be defined by a finite set of forbidden induced subgraphs if and only if λ < λ * , where λ * = β 1/2 + β −1/2 ≈ 2.01980 and β is the unique real root of x 3 = x + 1. This resolves a question raised by Bussemaker and Neumaier. As a byproduct, we find all the limit points of smallest eigenvalues of graphs, supplementing Hoffman's work on those limit poi… Show more
“…Remark After this work is completed, building on our forbidden induced subgraph framework, Jiang and Polyanskii [8] proved Conjecture 1.11 for every λ < λ * , where λ * = β 1/2 + β −1/2 ≈ 2.01980 and β is the unique real root of…”
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_{\alpha ,\beta }(d)$$
N
α
,
β
(
d
)
denote the maximum number of unit vectors in $${\mathbb {R}}^d$$
R
d
where all pairwise inner products lie in $$\{\alpha ,\beta \}$$
{
α
,
β
}
. For fixed $$-1\le \beta<0\le \alpha <1$$
-
1
≤
β
<
0
≤
α
<
1
, we propose a conjecture for the limit of $$N_{\alpha ,\beta }(d)/d$$
N
α
,
β
(
d
)
/
d
as $$d \rightarrow \infty $$
d
→
∞
in terms of eigenvalue multiplicities of signed graphs. We determine this limit when $$\alpha +2\beta <0$$
α
+
2
β
<
0
or $$(1-\alpha )/(\alpha -\beta ) \in \{1, \sqrt{2}, \sqrt{3}\}$$
(
1
-
α
)
/
(
α
-
β
)
∈
{
1
,
2
,
3
}
.Our work builds on our recent resolution of the problem in the case of $$\alpha = -\beta $$
α
=
-
β
(corresponding to equiangular lines). It is the first determination of $$\lim _{d \rightarrow \infty } N_{\alpha ,\beta }(d)/d$$
lim
d
→
∞
N
α
,
β
(
d
)
/
d
for any nontrivial fixed values of $$\alpha $$
α
and $$\beta $$
β
outside of the equiangular lines setting.
“…Remark After this work is completed, building on our forbidden induced subgraph framework, Jiang and Polyanskii [8] proved Conjecture 1.11 for every λ < λ * , where λ * = β 1/2 + β −1/2 ≈ 2.01980 and β is the unique real root of…”
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_{\alpha ,\beta }(d)$$
N
α
,
β
(
d
)
denote the maximum number of unit vectors in $${\mathbb {R}}^d$$
R
d
where all pairwise inner products lie in $$\{\alpha ,\beta \}$$
{
α
,
β
}
. For fixed $$-1\le \beta<0\le \alpha <1$$
-
1
≤
β
<
0
≤
α
<
1
, we propose a conjecture for the limit of $$N_{\alpha ,\beta }(d)/d$$
N
α
,
β
(
d
)
/
d
as $$d \rightarrow \infty $$
d
→
∞
in terms of eigenvalue multiplicities of signed graphs. We determine this limit when $$\alpha +2\beta <0$$
α
+
2
β
<
0
or $$(1-\alpha )/(\alpha -\beta ) \in \{1, \sqrt{2}, \sqrt{3}\}$$
(
1
-
α
)
/
(
α
-
β
)
∈
{
1
,
2
,
3
}
.Our work builds on our recent resolution of the problem in the case of $$\alpha = -\beta $$
α
=
-
β
(corresponding to equiangular lines). It is the first determination of $$\lim _{d \rightarrow \infty } N_{\alpha ,\beta }(d)/d$$
lim
d
→
∞
N
α
,
β
(
d
)
/
d
for any nontrivial fixed values of $$\alpha $$
α
and $$\beta $$
β
outside of the equiangular lines setting.
“…If i 2 = 5 or i 2 ≥ 6, then Ṫ7 ⊂ Ġ or Ṫ4 ⊂ Ġ, respectively, contradiction. So, i 2 = 4 and Ġ ⊂ [G 10 5 , v 10 , s]. Subcase 1.4.…”
Section: ⊂ ġmentioning
confidence: 99%
“…, where i 2 = i 1 + 1 and v i 1 − ∼ v i 2 . By subcases 1.1 and 1.3, then Ġ ⊂ [G 10 5 , v 10 , s, v, Ġ], where the pair ( Ġ, v) ∈ {(P 4 , v 2 ), (Q 1,0 , v 1 ), (T a,1,a−1 , v a−1 ), (Q n 1 ,n 1 , v n 1 )} (a ≥ 3 and n 1 ≥ 1).…”
The Hoffman program with respect to any real or complex square matrix M associated to a graph G stems from Hoffman's pioneering work on the limit points for the spectral radius of adjacency matrices of graphs does not exceed 2 + √ 5. A signed graph Ġ = (G, σ) is a pair (G, σ), where G = (V, E) is a simple graph and σ : E(G) → {+1, −1} is the sign function. In this paper, we study the Hoffman program of signed graphs. Here, all signed graphs whose spectral radius does not exceed 2 + √ 5 will be identified.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.