加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本