Papers
Topics
Authors
Recent
Search
2000 character limit reached

Ramanujan graphs and exponential sums over function fields

Published 16 Sep 2019 in math.NT, math.AG, and math.CO | (1909.07365v2)

Abstract: We prove that $q+1$-regular Morgenstern Ramanujan graphs $X{q,g}$ (depending on $g\in\mathbb{F}q[t]$) have diameter at most $\left(\frac{4}{3}+\varepsilon\right)\log{q}|X{q,g}|+O_{\varepsilon}(1)$ (at least for odd $q$ and irreducible $g$) provided that a twisted Linnik-Selberg conjecture over $\mathbb{F}q(t)$ is true. This would break the 30 year-old upper bound of $2\log{q}|X{q,g}|+O(1)$, 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 $\frac{4}{3}$ cannot be improved.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.