Ramanujan graphs and exponential sums over function fields
Naser T. Sardari, Masoud Zargar

TL;DR
This paper establishes a new upper bound on the diameter of certain Ramanujan graphs over function fields, contingent on a conjecture, and provides unconditional constructions showing the bound's optimality.
Contribution
It proves a new diameter bound for Morgenstern Ramanujan graphs assuming a twisted Linnik-Selberg conjecture and constructs infinite families demonstrating the bound's sharpness.
Findings
New diameter bound of approximately (4/3) log_q |X^{q,g}| for Ramanujan graphs.
Conditional proof relies on a twisted Linnik-Selberg conjecture over function fields.
Unconditional constructions show the (4/3) factor cannot be improved.
Abstract
We prove that -regular Morgenstern Ramanujan graphs (depending on ) have diameter at most (at least for odd and irreducible ) provided that a twisted Linnik-Selberg conjecture over is true. This would break the 30 year-old upper bound of , a consequence of a well-known upper bound on the diameter of regular Ramanujan graphs proved by Lubotzky, Phillips, and Sarnak using the Ramanujan bound on Fourier coefficients of modular forms. We also unconditionally construct infinite families of Ramanujan graphs that prove that cannot be improved.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
