Counting depth zero patterns in ballot paths

DOI10.1515/INTEG.2011.099MaRDI QIDQ2882921zbMATH OpenOpenAlexFDO

Authors Haun Sullivan, Heinrich Niederhausen

Publication date 11 May 2012

Published in Integers (Search for Journal in Brave)

Full work available at URL http://www.integers-ejcnt.org/vol11.html

zbMATH Keywords

ballot pathsfinite operator calculuspatterns

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Umbral calculus (05A40)

Review text

In this paper ballot paths are considered to be strings on two letters \(u\) and \(r\), in which no prefix has more \(r\)'s than \(u\)'s. If in the ballot path the number of \(r\)'s equals the number of \(u\)'s the well-known Dyck path is obtained. Using finite operator calculus, recursive formulas are given for the number of ballot paths with a given number of occurrences of a pattern, and for patterns with depth zero, a closed formula is obtained, too. The results are also extended to the case of two given patterns.

Recommendations

• Bivariate finite operator calculus and counting ballot paths containing patterns
• Pattern avoiding ballot paths and finite operator calculus
• Fine ballot numbers
• Equivalence classes of ballot paths modulo strings of length 2 and 3
• Counting strings in Dyck paths

Cited in

(4)

• Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
• Bivariate finite operator calculus and counting ballot paths containing patterns
• An ordered partition expansion of the determinant
• Pattern avoiding ballot paths and finite operator calculus

This page was built for publication: Counting depth zero patterns in ballot paths

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