OpenAlex ·

The Bellaterra graphs are Ramanujan

Olga Kharlampovich and Alina Vdovina

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2610.25324
Original
Read it at the publisher
Topics
Combinatorics

Abstract

The Bellaterra automaton gives three involutions of every set of binary words of a fixed length. We identify their Schreier graph at level $n$ with a cubic arithmetic graph over $\Q(\sqrt{17})$, and prove that every nonconstant adjacency eigenvalue satisfies the Ramanujan bound. In particular, this proves Malyshev-Pak's Conjecture that the Bellaterra graphs form a family of two-sided expanders.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Combinatorics

Get the few papers worth your time in Combinatorics every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics