2021
DOI: 10.5802/ahl.71
|View full text |Cite
|
Sign up to set email alerts
|

Kesten–McKay law for the Markoff surface mod p

Abstract: For each prime p, we study the eigenvalues of a 3-regular graph on roughly p 2 vertices constructed from the Markoff surface. We show they asymptotically follow the Kesten-McKay law, which also describes the eigenvalues of a random regular graph. The proof is based on the method of moments and takes advantage of a natural group action on the Markoff surface.Résumé. -Pour chaque nombre premier p, on décrit les valeurs propres d'un graphe 3-régulier ayant environ p 2 sommets construit à partir de la surface de M… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…For k ¤ 0 or 4, the number of fixed points is dictated by a curve (2.6) of genus 1, which in our case degenerates to a conic. Theorem 2.4 (de Courcy-Ireland and Magee [13]). There is an absolute constant C > 0 such that any reduced word of length L in m 1 , m 2 , m 3 has at most C L p fixed points.…”
Section: Some Key Countsmentioning
confidence: 99%
“…For k ¤ 0 or 4, the number of fixed points is dictated by a curve (2.6) of genus 1, which in our case degenerates to a conic. Theorem 2.4 (de Courcy-Ireland and Magee [13]). There is an absolute constant C > 0 such that any reduced word of length L in m 1 , m 2 , m 3 has at most C L p fixed points.…”
Section: Some Key Countsmentioning
confidence: 99%
“…Bourgain, Gamburd and Sarnak [2,3] have obtained several major results towards Conjecture 1.1, see also [4,6,7,10]. For example, by [2, Theorem 1] we have (1.3) # (M p \ C p ) = p o (1) , as p → ∞, and also by [2,Theorem 2] we know that Conjecture 1.1 holds for all but maybe at most X o (1) primes p ≤ X as X → ∞.…”
mentioning
confidence: 94%
“…Indeed, it follows from the separator theorem for planar graphs of Lipton-Tarjan [8] that planar graphs cannot form an expander family. We direct the reader to the exposition of this fact in de Courcy-Ireland's recent work [2,Section 12] demonstrating that, for certain primes 𝑝, Markoff graphs modulo 𝑝 -another conjectured expander family -are non-planar.…”
Section: Introductionmentioning
confidence: 99%