{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:32Z","timestamp":1753893812178,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.37236\/561","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T03:51:48Z","timestamp":1578714708000},"source":"Crossref","is-referenced-by-count":3,"title":["General Results on the Enumeration of Strings in Dyck Paths"],"prefix":"10.37236","volume":"18","author":[{"given":"K.","family":"Manes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Sapounakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Tasoulas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Tsikouras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2011,3,31]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p74\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p74\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T23:14:42Z","timestamp":1579302882000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v18i1p74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,31]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2011,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/561","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2011,3,31]]},"article-number":"P74"}}