Ballot Paths Avoiding Depth Zero Patterns

MaRDI QIDQ3012583zbMATH OpenFDO

Authors Haun Sullivan, Heinrich Niederhausen

Publication date 6 July 2011

Full work available at URL https://arxiv.org/abs/1004.2710

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Abstract: In a paper by Sapounakis, Tasoulas, and Tsikouras cite{stt}, the authors count the number of occurrences of patterns of length four in Dyck paths. In this paper we specify in one direction and generalize in another. We only count ballot paths that avoid a given pattern, where a ballot path stays weakly above the diagonal $y=x$, starts at the origin, and takes steps from the set $uparrow,o=u,r$. A pattern is a finite string made from the same step set; it is also a path. Notice that a ballot path ending at a point along the diagonal is a Dyck path.

Cited in

(1)

• Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata

This page was built for publication: Ballot Paths Avoiding Depth Zero Patterns

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