Computations of the partition function

DOI10.2307/3618767zbMATH Open0872.11041OpenAlexW2799438688MaRDI QIDQ3125852FDOQ3125852

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

Recommendations

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

zbMATH Keywords

computationcongruencesDedekind sumsHardy-Ramanujan-Rademacher formulapentagonal number formulaunrestricted partition function

Mathematics Subject Classification ID

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

Cited In (12)

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

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)