Computing the integer partition function
DOI10.1090/S0025-5718-07-01966-7zbMATH Open1113.11057OpenAlexW2117509169MaRDI QIDQ3433775FDOQ3433775
Authors: Neil J. Calkin, Jimena L. Davis, Elizabeth Perez, Charles Swannack, Kevin James 
Publication date: 2 May 2007
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-07-01966-7
Recommendations
Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Partitions; congruences and congruential restrictions (11P83)
Cites Work
- Arithmetic properties of the partition function
- Distribution of the partition function modulo composite integers \(M\)
- Coefficients of half-integral weight modular forms.
- Distribution of the partition function modulo \(m\)
- Congruences and conjectures for the partition function
- Note on the Parity of the Partition Functions.
- Periodicity Modulo m and Divisibility Properties of the Partition Function
- Multiplicative Congruence Properties and Density Problems for p(n)
- Congruence properties for the partition function
- Some Properties of p(n) and c(n) Modulo Powers of 13
- Recurrence Formulae for the Coefficients of Modular Forms and Congruences for the Partition Function and for the Coefficients of $j(\tau)$, $(j(\tau) - 1728)^{\frac{1}{2}}$ and $(j(\tau))^{\frac{1}{3}}$.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coefficients of half-integral weight modular forms modulo \(\ell^{ j }\)
- Title not available (Why is that?)
- On the Distribution of Parity in the Partition Function
- Computing the integer partition function
- Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression
- Distribution of parity of the partition function in arithmetic progressions
- On the parity of additive representation functions
- New congruences for the partition function
- The partition function in arithmetic progressions
Cited In (17)
- Fast computation of the partition function
- A formula for the partition function that ``counts
- Parity of the coefficients of certain eta-quotients
- Efficient implementation of the Hardy-Ramanujan-Rademacher formula
- An Algorithmic Involution for p(n)
- On the parity of the number of partitions with odd multiplicities
- On the parity of the number of multiplicative partitions and related problems
- A refinement of the Conway algorithm
- Partition analysis, modular functions, and computer algebra
- Computing a pyramid partition generating function with dimer shuffling
- Nuclear partitions and a formula for \(p(n)\)
- On the number of even values of an eta-quotient
- Computations of the partition function
- On the density of the odd values of the partition function
- Deducing the positive odd density of \(p(n)\) from that of a multipartition function: an unconditional proof
- Towards an automation of the circle method
- Computing the integer partition function
This page was built for publication: Computing the integer partition function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3433775)
