On the probability that certain compositions have the same number of parts

DOI10.1007/s00026-010-0060-7zbMath1233.05005OpenAlexW2035219093MaRDI QIDQ659592

Miklós Bóna, Arnold Knopfmacher

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-010-0060-7

zbMATH Keywords

asymptoticsprobabilitycompositionlattice pathsfence poset

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)

Related Items

The degree of symmetry of lattice paths, Diagonal Asymptotics for Products of Combinatorial Classes, Enumeration and asymptotics of restricted compositions having the same number of parts, Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata, A simple sorting algorithm for compositions

Cites Work

• On the rank polynomial of the lattice of order ideals of fences and crowns
• Singularity Analysis of Generating Functions
• Unnamed Item