Home Counting Depth Zero Patterns in Ballot Paths
Article
Licensed
Unlicensed Requires Authentication

Counting Depth Zero Patterns in Ballot Paths

  • Heinrich Niederhausen EMAIL logo and Shaun Sullivan
Published/Copyright: March 27, 2012
Become an author with De Gruyter Brill
Integers
From the journal Volume 12 Issue 2

Abstract.

The purpose of this work is to extend the theory of finite operator calculus to the multivariate setting, and apply it to the enumeration of certain lattice paths. The lattice paths we consider are ballot paths. A ballot path is a path that stays weakly above the diagonal , starts at the origin, and takes steps from the set . Given a string from the set , we want to count the ballot paths with a given number of occurrences of . In order to use finite operator calculus, we must put some restrictions on the string we wish to keep track of. A ballot path ending on the diagonal can be viewed as a Dyck path, thus all of our results also apply to the enumeration of Dyck paths with a given number of occurrences of . Finally, we give an example of counting ballot paths with a given number of occurrences of two patterns.

Received: 2010-01-25
Revised: 2011-04-14
Accepted: 2011-09-07
Published Online: 2012-03-27
Published in Print: 2012-April

© 2012 by Walter de Gruyter Berlin Boston

Downloaded on 19.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/integ.2011.099/html
Scroll to top button