Partition Asymptotics from Recursion Equations
From MaRDI portal
Publication:5749377
DOI10.1137/0150020zbMath0718.11052MaRDI QIDQ5749377
Charles Knessl, Joseph B. Keller
Publication date: 1990
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0150020
partitions; method of matched asymptotic expansions; WKB method; ray method; recursion equation; approximate formulae
05A17: Combinatorial aspects of partitions of integers
11P81: Elementary theory of partitions
11P82: Analytic theory of partitions
Related Items
Threshold Functions for Distinct Parts: Revisiting Erdős–Lehner, Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example, Geometrical optics and chessboard pebbling, Limit theorems for the number of summands in integer partitions, Binary and \(q\)-ary Tardos codes, revisited, Finite difference of the overpartition function, Equilibration of small and large subsystems in field theories and matrix models, Finite differences of the logarithm of the partition function, Stirling Number Asymptotics from Recursion Equations Using the Ray Method