Counting strings at height \(j\) in Dyck paths

DOI10.1016/j.jspi.2010.12.022zbMath1209.05010OpenAlexW2020546943WikidataQ60692252 ScholiaQ60692252MaRDI QIDQ630940

Kostas Manes, Panagiotis Tsikouras, Ioannis Tasoulas, Aristidis Sapounakis

Publication date: 22 March 2011

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jspi.2010.12.022

zbMATH Keywords

Dyck pathstringlattice pathCatalan numbersperiodic wordDyck prefix

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (4)

Equivalence classes of ballot paths modulo strings of length 2 and 3 ⋮ Nonleft peaks in Dyck paths: a combinatorial approach ⋮ Some statistics on generalized Motzkin paths with vertical steps ⋮ Semantic enhanced cloud environment for surveillance data management using video structural description

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• General results on the enumeration of strings in Dyck paths
• Some bijections and identities for the Catalan and Fine numbers
• Counting upper interactions in Dyck paths
• A bijection on Dyck paths and its cycle structure
• Pattern avoiding ballot paths and finite operator calculus
• Enumeration of strings in Dyck paths: A bijective approach
• An involution on Dyck paths and its consequences
• Dyck path enumeration
• Some statistics on Dyck paths
• A bijection on Dyck paths and its consequences
• The statistic ``number of udu's in Dyck paths
• Counting strings in Dyck paths
• Dyck Paths with Peaks Avoiding or Restricted to a Given Set
• Euler Coefficients and Restricted Dyck Paths

This page was built for publication: Counting strings at height \(j\) in Dyck paths