Supercongruences using modular forms

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…