Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 87 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 17 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 102 tok/s Pro
Kimi K2 166 tok/s Pro
GPT OSS 120B 436 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Ramanujan graphs and exponential sums over function fields (1909.07365v2)

Published 16 Sep 2019 in math.NT, math.AG, and math.CO

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

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube