Unified derivation of the limit shape for multiplicative ensembles of random integer partitions with equiweighted parts
arXiv:1111.3311 · doi:10.1002/rsa.20540
Abstract
We derive the limit shape of Young diagrams, associated with growing integer partitions, with respect to multiplicative probability measures underpinned by the generating functions of the form (which entails equal weighting among possible parts ). Under mild technical assumptions on the function , we show that the limit shape exists and is given by the equation , where . The wide class of partition measures covered by this result includes (but is not limited to) representatives of the three meta-types of decomposable combinatorial structures --- assemblies, multisets and selections. Our method is based on the usual randomization and conditioning; to this end, a suitable local limit theorem is proved. The proofs are greatly facilitated by working with the cumulants of sums of the part counts rather than with their moments.
Minor editorial corrections. Published in "Random Structures and Algorithms" (18 Apr 2014, Early View, online), http://onlinelibrary.wiley.com/doi/10.1002/rsa.20540/abstract
References in corpus (1)
Cited by in corpus (6)
- Limit shapes via bijections
- Limit shape of minimal difference partitions and fractional statistics
- Limit shapes for Gibbs partitions of sets
- Limit shape of random convex polygonal lines: Even more universality
- Boltzmann Distribution on "Short" Integer Partitions with Power Parts: Limit Laws and Sampling
- Growing integer partitions with uniform marginals and the equivalence of partition ensembles