General results on the enumeration of strings in Dyck paths
From MaRDI portal
Publication:540063
zbMath1217.05028MaRDI QIDQ540063
Aristidis Sapounakis, Kostas Manes, Panagiotis Tsikouras, Ioannis Tasoulas
Publication date: 1 June 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/233021
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)
Related Items (5)
Counting pairs of noncrossing binary paths: a bijective approach ⋮ Equivalence classes of ballot paths modulo strings of length 2 and 3 ⋮ Descent distribution on Catalan words avoiding ordered pairs of relations ⋮ Counting strings at height \(j\) in Dyck paths ⋮ Nonleft peaks in Dyck paths: a combinatorial approach
This page was built for publication: General results on the enumeration of strings in Dyck paths
