Computing the integer partition function

DOI10.1090/S0025-5718-07-01966-7MaRDI QIDQ3433775zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

partition functiondiscrete fast Fourier transforms

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Partitions; congruences and congruential restrictions (11P83)

Recommendations

• Fast computation of the partition function
• Computations of the partition function
• Recurrences for the partition function and its relatives
• scientific article; zbMATH DE number 2108079
• A generalization of Euler's pentagonal number recurrence for the partition function

Cites work

• scientific article; zbMATH DE number 1222942 (Why is no real title available?)
• scientific article; zbMATH DE number 3372104 (Why is no real title available?)
• scientific article; zbMATH DE number 3399320 (Why is no real title available?)
• Arithmetic properties of the partition function
• Coefficients of half-integral weight modular forms modulo \(\ell^{ j }\)
• Coefficients of half-integral weight modular forms.
• Computing the integer partition function
• Congruence properties for the partition function
• Congruences and conjectures for the partition function
• Distribution of parity of the partition function in arithmetic progressions
• Distribution of the partition function modulo \(m\)
• Distribution of the partition function modulo composite integers \(M\)
• Multiplicative Congruence Properties and Density Problems for p(n)
• New congruences for the partition function
• Note on the Parity of the Partition Functions.
• On the Distribution of Parity in the Partition Function
• On the parity of additive representation functions
• Periodicity Modulo m and Divisibility Properties of the Partition Function
• 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}}$.
• Some Properties of p(n) and c(n) Modulo Powers of 13
• The partition function in arithmetic progressions
• Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression

Cited in

(18)

• Partition analysis, modular functions, and computer algebra
• Computational study of non-unitary partitions
• Parity of the coefficients of certain eta-quotients
• On the density of the odd values of the partition function
• On the parity of the number of partitions with odd multiplicities
• Efficient implementation of the Hardy-Ramanujan-Rademacher formula
• Deducing the positive odd density of \(p(n)\) from that of a multipartition function: an unconditional proof
• On the parity of the number of multiplicative partitions and related problems
• A refinement of the Conway algorithm
• On the number of even values of an eta-quotient
• Computations of the partition function
• Computing a pyramid partition generating function with dimer shuffling
• An Algorithmic Involution for p(n)
• Towards an automation of the circle method
• Fast computation of the partition function
• A formula for the partition function that ``counts
• Computing the integer partition function
• Nuclear partitions and a formula for \(p(n)\)

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)