Euler Coefficients and Restricted Dyck Paths
Combinatorics
2007-05-23 v1
Abstract
We consider the problem of enumerating Dyck paths staying weakly above the x-axis with a limit to the number of consecutive up steps, or a limit to the number of consecutive down steps. We use Finite Operator Calculus to obtain formulas for the number of all such paths reaching a given point in the first quadrant. All our results are based on the Eulerian coefficients.
Cite
@article{arxiv.0705.3065,
title = {Euler Coefficients and Restricted Dyck Paths},
author = {Heinrich Niederhausen and Shaun Sullivan},
journal= {arXiv preprint arXiv:0705.3065},
year = {2007}
}