<%@ Page Language="C#" MasterPageFile="~/Main.master" AutoEventWireup="true" Title="Volume 13 Issue 3" %>
On the Probability that Certain Compositions Have the Same Number Of Parts
Miklós Bóna1 and Arnold Knopfmacher2
1Department of Mathematics, University of Florida, Gainesville FL 32611-8105, USA
2School of Mathematics, University of the Witwatersrand, Johannesburg, Private Bag 3, WITS 2050, South Africa
Annals of Combinatorics 14 (3) pp.291-306 September, 2010
AMS Subject Classification: 05A05, 05A15, 05A16
We compute the asymptotic probability that two randomly selected compositions of n into parts equal to a or b have the same number of parts. In addition, we provide bijections in the case of parts of sizes 1 and 2 with weighted lattice paths and central Whitney numbers of fence posets. Explicit algebraic generating functions and asymptotic probabilities are also computed in the case of pairs of compositions of n into parts at least d, for any fixed natural number d.
Keywords: composition, probability, lattice paths, fence poset, asymptotics


1. Bóna, M.: A Walk Through Combinatorics. World Scientific, River Edge, NJ (2002)

2. Flajolet, P., Odlyzko, A.M.: Singularity analysis of generating functions. SIAM J. Discrete Math. 3(2), 216--240 (1990)

3. Munarini, E., Salvi, N.Z.: On the rank polynomial of the lattice of order ideals of fences and crowns. Discrete Math. 259(1-3), 163--177 (2002)

4. Odlyzko, A.M.: Asymptotic enumeration methods. In: Handbook of Combinatorics, Vol. 2, pp. 1063--1229. Elsevier, Amsterdam (1995)

5. Stanley, R.: Enumerative Combinatorics, Volume 2. Cambridge University Press, Cambridge (1997)

6. Wilf, H.: The variance of the Stirling cycle numbers. available at arXiv:math/0511428.

7. Wilf, H.: Generatingfunctionology, 3rd edition. A K Peters, Ltd., Wellesley, MA (2006)