arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1307.8395math.NThep-thmath-phmath.MP
收藏

基于临界线上第$n$零点的显式方程的Riemann零点的统计和其它性质

Statistical and other properties of Riemann zeros based on an explicit equation for the $n$-th zero on the critical line

Guilherme França, André LeClair

摘要:

我们表明,有一个无穷多个黎曼零点的临界线上,列举的正整数$n=1,2,\dotsc$,其纵坐标可以得到一个新的超越方程,只依赖于$n$的解决方案。在弱的假设下,我们表明,这样的零的数量已经饱和的计数公式为零的数量在整个临界带上。因此,这些结果构成了一个具体的建议,以验证黎曼假设。我们对精确方程进行了数值分析,并讨论了其大纵坐标的渐近极限。出发点是一个明确的解析公式的近似解的确切方程的兰伯特$W$功能。这样,我们既不需要使用Gram点,也不需要处理违反Gram定律的问题。因此,我们的数值方法构成了一种新的方法来计算零点。采用这些数值解,我们验证了渐近版本的解决方案是足够准确的,以确认蒙哥马利和Odlyzko的对相关图,也重建素数计数功能。

英文摘要:

We show that there are an infinite number of Riemann zeros on the critical line, enumerated by the positive integers $n=1,2,\dotsc$, whose ordinates can be obtained as the solution of a new transcendental equation that depends only on $n$. Under weak assumptions, we show that the number of such zeros already saturates the counting formula for the numbers of zeros on the entire critical strip. These results thus constitute a concrete proposal toward verifying the Riemann hypothesis. We perform numerical analyses of the exact equation, and its asymptotic limit of large ordinate. The starting point is an explicit analytical formula for an approximate solution to the exact equation in terms of the Lambert $W$ function. In this way, we neither have to use Gram points or deal with violations of Gram's law. Our numerical approach thus constitutes a novel method to compute the zeros. Employing these numerical solutions, we verify that solutions of the asymptotic version are accurate enough to confirm Montgomery's and Odlyzko's pair correlation conjectures and also to reconstruct the prime number counting function.

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

↑