Bellaterra graphs are two-sided expanders

Let BnB_n be the 33-regular Bellaterra graph at level nn, for n1n\geq 1. A family of 33-regular graphs is two-sided expanding when there is an ε>0\varepsilon>0 such that its second-largest and smallest eigenvalues satisfy

λ2<3εandλn>3+ε.\lambda_2<3-\varepsilon\qquad\text{and}\qquad\lambda_n>-3+\varepsilon.

Bellaterra expander conjecture. The Bellaterra graphs {Bi}i=1\{B_i\}_{i=1}^\infty are a family of two-sided expanders. The authors' computations suggest an eigenvalue gap of roughly 0.050.05, but the conjecture remains unproved in the supplied text.

Sources & referencesView supporting material

Primary source

Anton Malyshev and Igor Pak, “Lifts, derandomization, and diameters of Schreier graphs of Mealy automata”, arXiv:1407.4600 (2014).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.