arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1402.0620math.NTmath.CO
收藏

Almost-Ramanujan图与素间隙

Almost-Ramanujan Graphs and Prime Gaps

Adrian Dudek

摘要:

Murty和Cioabrant的方法展示了如何使用素数之间的间隙的结果来构造几乎Ramanujan图族。在本文中,我们给出了一个更简单的结构,避免了完美匹配的搜索,从而消除了计算的需要。然后利用最近几个关于连续素数间隔的显式界,构造了具有谱间隔显式下界的$k$ -正则族.然后,我们表明,本-Aroya和Ta-Shma的结果可以使用我们的简单的结构的假设下的黎曼假设,这揭示了一些更多的光Reingold,Vadhan和Widgerson提出的问题得到改进。

英文摘要:

The method of Murty and Cioabă shows how one can use results about gaps between primes to construct families of almost-Ramanujan graphs. In this paper we give a simpler construction which avoids the search for perfect matchings and thus eliminates the need for computation. A couple of recent explicit bounds on the gap between consecutive primes are then used to give the construction of $k$-regular families with explicit lower bounds on the spectral gaps. We then show that a result of Ben-Aroya and Ta-Shma can be improved using our simpler construction on the assumption of the Riemann Hypothesis, which sheds some more light on a question raised by Reingold, Vadhan and Widgerson.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑