Multiplicity of summands in the random partitions of an integer
Tóm tắt
In this paper, we prove a conjecture of Yakubovich regarding limit shapes of ‘slices’ of two-dimensional (2D) integer partitions and compositions of n when the number of summands m ~An
α
for some A > 0 and
$\alpha < \frac{1}{2}$
. We prove that the probability that there is a summand of multiplicity j in any randomly chosen partition or composition of an integer n goes to zero asymptotically with n provided j is larger than a critical value. As a corollary, we strengthen a result due to Erdös and Lehner (Duke Math. J.
8 (1941) 335–345) that concerns the relation between the number of integer partitions and compositions when
$\alpha = \frac{1}{3}$
.
Tài liệu tham khảo
Andrews G E, The Theory of Partitions (1984) (Cambridge University Press) second edition
Canfield E R, From Recursions to Asymptotics: On Szekeres’ formula for the number of partitions, Elec. J. Comb. 4 (1997) 1–16
Chow Y S and Teicher H, Probability Theory (1997) (Berlin: Springer-Verlag) third edition
Erdös P and Lehner J, The distribution of the number of summands in the partitions of a positive integer, Duke Math. J. 8 (1941) 335–345
Szekeres G, An asymptotic formula in the theory of partitions, Quart. J. Math. 2 (1951) 85–108
Yakubovich Yu V, On the coincidence of limit shapes for integer partitions and compositions, and a slicing of Young diagrams, J. Math. Sci. 131 (2005) 5569–5577