Integer partitions detect the primes

summary

The gist

Integer partitions detect prime numbers in an unexpected way by showing that primes are solutions to special equations in partition functions.

In short

This research explores how integer partitions can detect prime numbers through special equations involving MacMahon's partition functions. It proves that primes are solutions to certain linear combinations of these functions, extending this to a broader class of MacMahonesque functions. The work connects additive number theory with the distribution of primes via quasimodular forms and generating series.

Key concepts

MacMahon's Partition Functions (M_a(n))
These are partition functions that count the number of ways an integer n can be partitioned into parts, where each part has a specific multiplicity. The paper uses these functions to create equations that specifically equal zero only when n is a prime number.
Quasimodular Forms
These are special mathematical functions characterized by their Fourier expansions and how they react to the q-differential operator D. The study shows that forms in a specific space have coefficients that are non-negative for positive integers and vanish precisely when the integer is prime.
Quasi-shuffle Algebra (Zq)
This is an algebraic structure related to MacMahon's generating series, which allows the product of two such series to be calculated recursively using a 'quasi-shuffle product.' This structure helps define how these partition functions interact mathematically.
Prime-Detecting Forms
These are specific quasimodular forms identified as those whose Fourier coefficients vanish if and only if the index n is prime. Theorem 2.3 characterizes the space containing these forms, showing they are related to combinations of Eisenstein series.

Terminology used across episodes

This episode discusses

The paper

Integer partitions detect the primes · Read on arXiv

William Craig, Jan-Willem Van Ittersum, Ken Ono

European Research Council · SFB/TRR 191

We show that integer partitions, the fundamental building blocks in additive number theory, detect prime numbers in an unexpected way. Answering a question of Schneider, we show that the primes are the solutions to special equations in partition functions. For example, an integer n at least 2 is prime if and only if (3n cubed - 13n squared + 18n - 8)M 1(n) + (12n squared - 120n + 212)M 2(n) -960M 3(n) = 0, where the M a(n) are MacMahon's well-studied partition functions. More generally, for "MacMahonesque" partition functions M a vector(n), we prove that there are infinitely many such prime detecting equations with constant coefficients, such as 80M(1,1,1)(n)-12M(2,0,1)(n)+12M(2,1,0)(n)+ -12M(1,3)(n)-39M(3,1)(n)=0.

DOI: 10.1073/pnas.2409417121

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: We're looking at the paper: "Integer partitions detect the primes".

Emmy: Here's the gist of the paper. Integer partitions detect prime numbers in an unexpected way by showing that primes are solutions to special equations in partition functions.

Ada: This research demonstrates a deep connection between additive number theory, specifically integer partitions, and the distribution of prime numbers through partition theoretic equations.

Emmy: Detection of Primes via Partition Functions The paper establishes that for an integer n ≥ 2, n is prime if and only if certain expressions involving MacMahon’s partition functions M a(n) equal zero.

Ada: Specifically, the expression (3n cubed − 13n squared + 18n − 8)M 1(n) + (12n squared − 120n + 212)M 2(n) − 960M 3(n) vanishes if and only if n is prime.

Paper summary: Ada: We've covered the main thesis of this paper called "Integer partitions detect the primes," which is that primes satisfy certain partition function equations. Now we’re going to look at how they frame this idea more broadly.

Emmy: The paper establishes that for an integer n greater than two, n is prime if and only if certain expressions involving MacMahon’s partition functions equal zero >

Ada: Specifically, it gives us an example with three partition functions: three n cubed minus thirteen n squared plus eighteen n minus eight times M sub one of n plus twelve n squared minus one hundred twenty n plus two hundred twelve times M sub two of n minus nine hundred sixty times M sub three of n = zero > <ref:2405.06451#pg1>

Kolya: It’s interesting that they specify these exact coefficients. What about the general case, the MacMahonesque functions? They mention there are infinitely many prime detecting equations with constant coefficients involving MacMahonesque partition functions >

Emmy: They define natural generalizations, M sub a of n, and establish that arbitrary convolutions of these MacMahon series are always linear combinations of such functions with constant coefficients >

Ada: This means the connection isn't limited to just the basic partition functions; it extends to this wider class, which is really interesting because it suggests a more fundamental algebraic structure underlies this detection >

Kolya: Does this mean we can use these MacMahonesque functions to predict primes in some kind of probabilistic sense, or is this purely deterministic based on the equation vanishing? I'm wondering about the nature of these solutions >

Emmy: The paper relies heavily on quasimodular forms, which are characterized by their Fourier expansions and properties related to the q-differential operator D >

Ada: That’s where it gets really structural. They show that quasimodular forms in a specific space, denoted as Omega, are those whose Fourier coefficients b sub n of f satisfy b sub n of f greater than or equal to zero for positive n and vanish if and only if n is prime >

Kolya: So, the structure itself encodes the primality condition. That’s quite elegant. How does that relate back to the initial partition functions we were talking about? >

Ada: It connects back by relating these partition functions to generating series U sub a of q and their quasi-shuffle algebra Zq >

Emmy: The space Zq is shown to be a differential subalgebra of Q

[q: ] containing M f, which allows the product of any two MacMahon series to be computed recursively using the quasi-shuffle product >

Kolya: That recursion sounds like something that could govern how these functions interact, maybe telling us about the growth rates of these partition counts or something similar >

Conclusion: Ada: So, to wrap up this paper "Integer partitions detect the primes," we see that primes are solutions to a whole family of equations within MacMahonesque partition functions.

Emmy: The authors prove that there are infinitely many such prime detecting equations with constant coefficients, which means this detection mechanism is very general and applies across the wider class of MacMahon series >

Kolya: What’s the real-world implication here, beyond just proving a mathematical link? If this connection between partitions and primes is this deep, what does that suggest about our understanding of number theory overall? >

Ada: It suggests that there is a deep, structural relationship between additive number theory—the way we count partitions—and the distribution of prime numbers through these specific algebraic tools >

Emmy: The paper characterizes the space E intersect Omega as being generated by forms D sub n H sub k for n greater than or equal to zero and k greater than or equal to six >

Kolya: So, it seems they’ve managed to completely describe the set of quasimodular forms that detect primes, confirming that these specific combinations of Eisenstein series are all there >

Ada: It confirms the linear independence and structure of these spaces through dimension calculations >

Emmy: They also showed that all quasimodular forms are linear combinations of the symmetrized MacMahon U sym sub a of q, which adds up to a complete account >

More episodes

← Home