# Distribution of the partition function modulo $m$

@article{Ono2000DistributionOT, title={Distribution of the partition function modulo \$m\$}, author={Ken Ono}, journal={Annals of Mathematics}, year={2000}, volume={151}, pages={293-307} }

Ramanujan (and others) proved that the partition function satisfies a number of striking congruences modulo powers of 5, 7 and 11. A number of further congruences were shown by the works of Atkin, O'Brien, and Newman. In this paper we prove that there are infinitely many such congruences for every prime modulus exceeding 3. In addition, we provide a simple criterion guaranteeing the truth of Newman's conjecture for any prime modulus exceeding 3 (recall that Newman's conjecture asserts that the…

## 44 Citations

The spt-function of Andrews

- MathematicsProceedings of the National Academy of Sciences
- 2008

Using another type of identity, one based on Hecke operators, it is obtained a complete multiplicative theory for s(n) modulo 3 and congruences confirm unpublished conjectures of Garvan and Sellers.

Distribution of the partitions of n in which no part appears exactly once

- Mathematics
- 2022

In this paper we study the function g ( n ), which denotes the number of partitions of n in which no part appears exactly once. We prove that for each prime m ≥ 5, there exist Ramanujan-type…

Divisibility and distribution of 5-regular partitions

- Mathematics
- 2022

. In this paper we study the function b 3 ( n ), which denotes the number of 3-regular partitions of n , also the number of partitions where no part appears more than twice. We prove that for each…

Congruences satisfied by eta-quotients

- Mathematics
- 2019

The values of the partition function, and more generally the Fourier coefficients of many modular forms, are known to satisfy certain congruences. Results given by Ahlgren and Ono for the partition…

Congruences for Andrews' Smallest Parts Partition Function and New Congruences for Dyson's Rank

- Mathematics
- 2007

Let spt(n) denote the total number of appearances of smallest parts in the partitions of n. Recently, Andrews showed how spt(n) is related to the second rank moment, and proved some surprising…

Lacunary eta-quotients modulo powers of primes

- Mathematics
- 2017

An integral power series is called lacunary modulo $M$ if almost all of its coefficients are divisible by $M$. Motivated by the parity problem for the partition function, $p(n)$, Gordon and Ono…

Congruences like Atkin's for the partition function

- Mathematics
- 2021

. Let p ( n ) be the ordinary partition function. In the 1960s Atkin found a number of examples of congruences of the form p ( Q 3 ℓn + β ) ≡ 0 (mod ℓ ) where ℓ and Q are prime and 5 ≤ ℓ ≤ 31; these…

Scarcity of congruences for the partition function

- Mathematics
- 2020

The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell…

Infinite families of crank functions, Stanton-type conjectures, and unimodality

- Mathematics
- 2021

Dyson’s rank function and the Andrews–Garvan crank function famously give combinatorial witnesses for Ramanujan’s partition function congruences modulo 5, 7, and 11. While these functions can be used…

## References

SHOWING 1-10 OF 30 REFERENCES

PERIODICITY MODULO m AND DIVISIBILITY PROPERTIES OF THE PARTITION FUNCTION(

- Mathematics
- 1960

has infinitely many solutions in non-negative integers n. This conjecture seems difficult and I have only scattered results. In ?2 of this paper it will be shown that the conjecture is true for m= 5…

Congruences for the Coefficients of Modular forms and Some New Congruences for the Partition Function

- MathematicsCanadian Journal of Mathematics
- 1957

If n is a non-negative integer, define p r(n) as the coefficient of x n in ; otherwise define p r(n) as 0. In a recent paper (2) the author established the following congruence: Let r = 4, 6, 8, 10,…

CRANKS AND t-CORES

- Mathematics
- 1990

New statistics on partitions (called cranks) are defined which combinatorially prove Ramanujan’s congruences for the partition function modulo 5, 7, 11, and 25. Explicit bijections are given for the…

Dyson's crank of a partition

- Mathematics
- 1988

holds. He was thus led to conjecture the existence of some other partition statistic (which he called the crank); this unknown statistic should provide a combinatorial interpretation of ^-p(lln + 6)…

SOME PROPERTIES OF p(n) AND c(n) MODULO POWERS OF 13

- Mathematics
- 1967

j(^r) = E c(n)xn = (1 +240 0 u3(n)xn) /xf24(x) 744, where 03(n) = d3. dln Then p(n) is just the number of unrestricted partitions of n, and c(n) is the Fourier coefficient of Klein's modular…

Defect zero p-blocks for finite simple groups

- Mathematics
- 1996

We classify those finite simple groups whose Brauer graph (or decomposition matrix) has a p-block with defect 0, completing an investigation of many authors. The only finite simple groups whose…

Modular forms of weight 1/2

- Mathematics
- 1980

We will construct θ-series of weight 1/2 and 3/2 for some congruence subgroups of SL(2,ℤ) by taking appropriate coefficients of the representation \( \mathop{R}\limits^{\sim } \) of SL(2;ℝ),…

On the Parity of Additive Representation Functions

- Mathematics
- 1998

Abstract Let A be a set of positive integers,p( A , n) be the number of partitions ofnwith parts in A , andp(n)=p(N, n). It is proved that the number ofn⩽Nfor whichp(n) is even is ⪢ N , while the…

New combinatorial interpretations of Ramanujan’s partition congruences mod 5,7 and 11

- Mathematics
- 1988

Soit p(n) le nombre de partitions non restreintes de n. On donne de nouvelles interpretations combinatoires des congruences p(5n+4), p(7n+5) et p(11n+6)≡0 (mod 5,7 et 11, respectivement)