Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders

Amitay Kamber, Tali Kaufman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


The question of finding expander graphs with strong vertex expansion properties such as unique neighbor expansion and lossless expansion is central to computer science. A barrier to constructing these is that strong notions of expansion could not be proven via the spectral expansion paradigm. A very symmetric and structured family of optimal spectral expanders (i.e., Ramanujan graphs) was constructed using number theory by Lubotzky, Phillips and Sarnak, and and was subsequently generalized by others. We call such graphs Number Theoretic Ramanujan Graphs. These graphs are not only spectrally optimal, but also posses strong symmetries and rich structure. Thus, it has been widely conjectured that number theoretic Ramanujan graphs are lossless expanders, or at least unique neighbor expanders. In this work we disprove this conjecture, by showing that there are number theoretic Ramanujan graphs that are not even unique neighbor expanders. This is done by introducing a new combinatorial paradigm that we term the closed orbit method. The closed orbit method allows one to construct finite combinatorial objects with extermal substructures. This is done by observing that there exist infinite combinatorial structures with extermal substructures, coming from an action of a subgroup of the automorphism group of the structure. The crux of our idea is a systematic way to construct a finite quotient of the infinite structure containing a simple shadow of the infinite substructure, which maintains its extermal combinatorial property. Other applications of the method are to the edge expansion of number theoretic Ramanujan graphs and vertex expansion of Ramanujan complexes. Finally, in the field of graph quantum ergodicity we produce number theoretic Ramanujan graphs with an eigenfunction of small support that corresponds to the zero eigenvalue. This again contradicts common expectations. The closed orbit method is based on the well-established idea from dynamics and number theory of studying closed orbits of subgroups. The novelty of this work is in exploiting this idea to combinatorial questions, and we hope that it will have other applications in the future.

Original languageEnglish
Title of host publicationSTOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
EditorsStefano Leonardi, Anupam Gupta
PublisherAssociation for Computing Machinery
Number of pages10
ISBN (Electronic)9781450392648
StatePublished - 6 Sep 2022
Event54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022 - Rome, Italy
Duration: 20 Jun 202224 Jun 2022

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017


Conference54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022

Bibliographical note

Publisher Copyright:
© 2022 ACM.


The first auther is supported by ERC under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 803711). This work began when the first-named author was a PhD student in the Hebrew University of Jerusalem under Alex Lubotzky, and was supported by ERC grant 692854. The second auther is supported by ERC.

FundersFunder number
Horizon 2020 Framework Programme803711, 692854
European Research Council


    • expander graphs
    • unique neighbor expanders


    Dive into the research topics of 'Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders'. Together they form a unique fingerprint.

    Cite this