2000 character limit reached
Supercongruences using modular forms
Published 5 Mar 2024 in math.NT and math.AG | (2403.03301v3)
Abstract: 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 $p2$ or even $p3$. 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.