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

DOI10.1007/S00026-010-0060-7zbMATH Open1233.05005OpenAlexW2035219093MaRDI QIDQ659592FDOQ659592

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

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

Cites Work

• Title not available (Why is that?)
• Singularity Analysis of Generating Functions
• On the rank polynomial of the lattice of order ideals of fences and crowns

Cited In (9)

• The degree of symmetry of lattice paths
• A generating functionology approach to a problem of Wilf
• A simple sorting algorithm for compositions
• Enumeration and asymptotics of restricted compositions having the same number of parts
• Distinctness of compositions of an integer: A probabilistic analysis
• Trees with flowers: a catalog of integer partition and integer composition trees with their asymptotic analysis
• Diagonal Asymptotics for Products of Combinatorial Classes
• Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
• Balanced \(n\)-color compositions

This page was built for publication: On the probability that certain compositions have the same number of parts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659592)