From recursions to asymptotics: On Szekeres' formula for the number of partitions
From MaRDI portal
Publication:1378533
zbMath0885.05015MaRDI QIDQ1378533
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
05A17: Combinatorial aspects of partitions of integers
05A20: Combinatorial inequalities
11P81: Elementary theory of partitions
05A16: Asymptotic enumeration
Related Items
Will the real Hardy-Ramanujan formula please stand up?, Counting Partitions inside a Rectangle, Maximum entropy and integer partitions, Limit shapes for unimodal sequences, Partitions of \(n\) into \(t\sqrt n\) parts, Multiplicity of summands in the random partitions of an integer, Exact limit theorems for restricted integer partitions, Optimal integer partitions, From recursions to asymptotics: Durfee and dilogarithmic deductions