← All problems

Malyshev–Pak conjecture on Bellaterra graphs

There exists a constant ε>0\varepsilon>0 such that, for every level nn, every nontrivial adjacency eigenvalue λ\lambda of the cubic Bellaterra graph BnB_n satisfies ∣λ∣≤3−ε|\lambda|\le 3-\varepsilon. Equivalently, the family (Bn)n≥1(B_n)_{n\ge 1} is a family of two-sided spectral expanders.

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

An unrefereed preprint claims to prove the conjecture, but no independent mathematical assessment has been found.

The conjecture asks whether the Bellaterra graphs form a family of two-sided spectral expanders. Malyshev's thesis records the conjecture and reports computational evidence, but says the available methods were insufficient for a proof.

Known results

  • Computations suggested an eigenvalue gap of roughly 0.050.05.
  • The established general bound is diam⁡(Bn)=O(n2)\operatorname{diam}(B_n)=O(n^2).
  • Malyshev's thesis states that the authors were not close to proving the expansion conjecture.

October 2026 preprint claim

Olga Kharlampovich and Alina Vdovina claim that the Bellaterra graphs can be identified with arithmetic graphs and satisfy the Ramanujan bound, which would imply the Malyshev–Pak conjecture. The claim is from an unrefereed preprint and has no independent mathematical corroboration in the retrieved record.

Current status (as of October 2026): The conjecture is claimed solved by an unrefereed preprint, but remains unverified; no independent proof or assessment was found.

Sources

Solutions 0

No solutions have been posted yet.