From recursions to asymptotics: On Szekeres' formula for the number of partitions

zbMath0885.05015MaRDI QIDQ1378533

E. Rodney Canfield

Publication date: 15 February 1998

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119237

zbMATH Keywords

partitionsHardy-Ramanujan formulas

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial inequalities (05A20) Elementary theory of partitions (11P81) Asymptotic enumeration (05A16)

Related Items (9)

Maximum entropy and integer partitions ⋮ Will the real Hardy-Ramanujan formula please stand up? ⋮ Exact limit theorems for restricted integer partitions ⋮ Limit shapes for unimodal sequences ⋮ Multiplicity of summands in the random partitions of an integer ⋮ Optimal integer partitions ⋮ Counting Partitions inside a Rectangle ⋮ From recursions to asymptotics: Durfee and dilogarithmic deductions ⋮ Partitions of \(n\) into \(t\sqrt n\) parts

This page was built for publication: From recursions to asymptotics: On Szekeres' formula for the number of partitions