Enumeration and asymptotics of restricted compositions having the same number of parts

Abstract

We study pairs and m--tuples of compositions of a positive integer n with parts restricted to a subset P of positive integers. We obtain some exact enumeration results for the number of tuples of such compositions having the same number of parts. Under the uniform probability model, we obtain the asymptotics for the probability that two or, more generally, m randomly and independently chosen compositions of n have the same number of parts. For a large class of compositions, we show how a nice interplay between complex analysis and probability theory allows to get full asymptotics for this probability. Our results extend an earlier work of Bóna and Knopfmacher. While we restrict our attention to compositions, our approach is also of interest for tuples of other combinatorial structures having the same number of parts.

Discrete Applied Mathematics (2012) 1-13

References in corpus (2)

• Why Delannoy numbers?
• The variance of the Stirling cycle numbers

Cited by in corpus (6)

• Integer compositions with part sizes not exceeding k
• Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
• Points on a line, shoelace and dominoes
• S-Restricted Compositions Revisited
• Some Elementary Congruences for the Number of Weighted Integer Compositions
• On the number of simultaneous core partitions with $d$-distinct parts