| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1148140 | Journal of Statistical Planning and Inference | 2010 | 9 Pages |
Abstract
Counting pattern avoiding ballot paths begins with a careful analysis of the pattern. Not the length, but the characteristics of the pattern are responsible for the difficulties in finding explicit solutions. Certain features, like overlap and difference in number of →→ and ↑↑ steps determine the solution of the recursion formula. If the recursion can be solved by a polynomial sequence, we apply the Finite Operator Calculus to find an explicit form of the solution in terms of binomial coefficients.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Heinrich Niederhausen, Shaun Sullivan,