Metraipolis › archive › dc_a4cee244d9bb
Strongly explicit Ramanujan 2-lift towers via Hilbert modular forms — arXiv:2610.39485
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.39485
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:37:56.030Z
- SHA-256 of the archived text
0d08e12b743ee714f062421498417f9ad021c9f6d56db6d58cf50c14ec672a31- Stable URL of this page
https://metraipolis.com/documento/dc_a4cee244d9bb
How to cite
Strongly explicit Ramanujan 2-lift towers via Hilbert modular forms — arXiv:2610.39485 — arXiv (en), https://arxiv.org/abs/2610.39485 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a4cee244d9bb (Metraipolis archive dc_a4cee244d9bb, sha256 0d08e12b743ee714f062421498417f9ad021c9f6d56db6d58cf50c14ec672a31)
BibTeX
@misc{dca4cee244d9bb,
title = {Strongly explicit Ramanujan 2-lift towers via Hilbert modular forms — arXiv:2610.39485},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.39485},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a4cee244d9bb; sha256 0d08e12b743ee714f062421498417f9ad021c9f6d56db6d58cf50c14ec672a31},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.39485. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Expander graphs have been central objects of study for over fifty years. Ramanujan graphs attain the asymptotically optimal nontrivial adjacency-eigenvalue threshold for infinite fixed-degree families. The original arithmetic constructions by Lubotzky-Phillips-Sarnak (1988) and Margulis (1988), and the iterative $2$-lift method of Bilu-Linial (2006) provide different approaches to Ramanujan graph constructions. Motivated by work on Mealy automata, we combine both approaches to give the following new arithmetic construction. For every prime $p\equiv 1\pmod {17}$, we construct a infinite tower of $(p+1)$-regular non-bipartite Ramanujan graphs on $2^n$ vertices, with label-preserving $2$-lifts between consecutive levels. These construction is strongly explicit: for fixed $p$, a neighbor or lift sign is computable in $O_p(n^3)$ bit operations. The construction uses fixed algebraic $2$-adic transformations, specified by finite data computable in preprocessing depending only on $p$. The main number-theoretic tool is Blasius's Ramanujan-Petersson theorem for Hilbert modular forms, applied through the Jacquet-Langlands correspondence to obtain the sharp bound $|\lambda|\leq2\sqrt p$ for every nontrivial adjacency eigenvalue of our $(p+1)$-regular graphs. The transformations preserve $2$-adic distance, which gives the binary covers and an explicit formula for their signings.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM); Number Theory (math.NT).
Pagina del lavoro: https://arxiv.org/abs/2610.39485 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:15:28.275Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).