Computations of the partition function

DOI10.2307/3618767MaRDI QIDQ3125852zbMATH OpenOpenAlexFDO

Authors Peter Shiu

Publication date 20 March 1997

Published in The Mathematical Gazette (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3618767

zbMATH Keywords

computationcongruencesDedekind sumsHardy-Ramanujan-Rademacher formulapentagonal number formulaunrestricted partition function

Mathematics Subject Classification ID

Linear Diophantine equations (11D04) Elementary theory of partitions (11P81) Partitions; congruences and congruential restrictions (11P83)

Recommendations

• Computing the integer partition function
• On the partition function
• The calculation of Kostant's partition function
• Fast computation of the partition function
• The complexity of partition functions
• Automata, Languages and Programming
• scientific article; zbMATH DE number 6341750
• The partition function revisited
• Combinatorics and complexity of partition functions

Cited in

(12)

• Computing a pyramid partition generating function with dimer shuffling
• Functional integral representations of partition function without limiting procedure. Techniques of calculation of moments
• On a nonlinear relation for computing the overpartition function
• Fast computation of the partition function
• Finite differences of the logarithm of the partition function
• scientific article; zbMATH DE number 6341750 (Why is no real title available?)
• Computing the integer partition function
• Differences of the partition function
• Nuclear partitions and a formula for \(p(n)\)
• Efficient implementation of the Hardy-Ramanujan-Rademacher formula
• In the style of Herschel
• An explicit formula for computing the partition numbers p(n)

This page was built for publication: Computations of the partition function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3125852)