arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.03301math.NTmath.AG
收藏

利用模形式的超同余

Supercongruences using modular forms

Frits Beukers

AI总结:

该研究针对组合数生成级数中广泛存在的模素数高次幂的超同余现象,提出利用模函数与模形式可解释大部分已发现的超同余关系,为超同余研究提供了模形式视角的理论路径。

摘要:

许多具有组合意义的数的生成级数具备这样的性质:在某个合适的点处,阶小于$p$的项之和与无穷多个素数$p$模下的某个ζ函数零点同余。令人惊讶的是,这些同余常常在模$p^2$甚至$p^3$下依然成立。我们将这类同余称为超同余,过去15年间已发现大量此类同余关系。本文证明,其中很大一部分都可以通过模函数与模形式得到解释。

英文摘要:

Many generating series of combinatorially interesting numbers have the property that the sum of the terms of order $<p$ at some suitable point is congruent to a zero of a zeta-function modulo infinitely many primes $p$. Surprisingly, very often these congruences turn out to hold modulo $p^2$ or even $p^3$. We call such congruences supercongruences and in the past 15 years an abundance of them have been discovered. In this paper we show that a large proportion of them can be explained by the use of modular functions and forms.

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

↑