General results on the enumeration of strings in Dyck paths

MaRDI QIDQ540063zbMATH OpenFDO

Authors K. Manes, A. Sapounakis, I. Tasoulas, P. Tsikouras

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, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p74.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Review text

Summary: Let \(\tau\) be a fixed lattice path (called in this context string) on the integer plane, consisting of two kinds of steps. The Dyck path statistic ``number of occurrences of \(\tau \) has been studied by many authors, for particular strings only. In this paper, arbitrary strings are considered. The associated generating function is evaluated when \(\tau\) is a Dyck prefix (or a Dyck suffix). Furthermore, the case when \(\tau \) is neither a Dyck prefix nor a Dyck suffix is considered, giving some partial results. Finally, the statistic ``number of occurrences of \(\tau\) at height at least \(j\) is considered, evaluating the corresponding generating function when \(\tau\) is either a Dyck prefix or a Dyck suffix.

Recommendations

• Counting strings in Dyck paths
• Counting strings at height \(j\) in Dyck paths
• Enumeration of strings in Dyck paths: A bijective approach
• Some strings in Dyck paths
• Strings of length 3 in grand-Dyck paths and the Chung-Feller property

Cited in

(16)

• Enumeration of strings in Dyck paths: A bijective approach
• On the enumeration and generation of generalized Dyck words
• Counting pairs of noncrossing binary paths: a bijective approach
• Counting strings in Dyck paths
• Equivalence classes of ballot paths modulo strings of length 2 and 3
• scientific article; zbMATH DE number 6007736 (Why is no real title available?)
• Strings of length 3 in grand-Dyck paths and the Chung-Feller property
• On Enumeration of Dyck--Schr\"oder Paths
• Nonleft peaks in Dyck paths: a combinatorial approach
• Statistics on Dyck paths
• Some strings in Dyck paths
• Enumeration of partial Łukasiewicz paths
• Descent distribution on Catalan words avoiding ordered pairs of relations
• Counting strings at height \(j\) in Dyck paths
• Enumerating runs, valleys, and peaks in Catalan words
• Subword patterns in smooth words

This page was built for publication: General results on the enumeration of strings in Dyck paths

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