pith. sign in

arxiv: 1201.6116 · v1 · pith:CDUBRLQPnew · submitted 2012-01-30 · 🧮 math.CO · cs.DM· math.PR

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

classification 🧮 math.CO cs.DMmath.PR
keywords compositionsnumberpartsprobabilitysameasymptoticshavingenumeration
0
0 comments X
read the original 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\'ona 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.