Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
143 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Supercongruences using modular forms (2403.03301v3)

Published 5 Mar 2024 in math.NT and math.AG

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.

Citations (2)

Summary

We haven't generated a summary for this paper yet.