Euler Coefficients and Restricted Dyck Paths

Simple item page
dc.creatorNiederhausen, Heinrich
dc.creatorSullivan, Shaun
dc.date2007-05-21
dc.date.accessioned2026-07-07T08:02:47Z
dc.date.available2026-07-07T08:02:47Z
dc.descriptionWe 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.
dc.description15 pages
dc.identifierhttps://arxiv.org/abs/0705.3065
dc.identifierhttp://arxiv.org/abs/0705.3065
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/129336
dc.subjectCombinatorics
dc.subject05A15; 05A40
dc.titleEuler Coefficients and Restricted Dyck Paths
dc.typetext

Files

Collections

arXiv