Pattern Avoiding Ballot Paths and Finite Operator Calculus

Simple item page
dc.creatorNiederhausen, Heinrich
dc.creatorSullivan, Shaun
dc.date2007-09-06
dc.date.accessioned2026-07-07T08:27:57Z
dc.date.available2026-07-07T08:27:57Z
dc.descriptionCounting 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 right and up 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. Keywords: Pattern avoidance, ballot path, Dyck path, Finite Operator Calculus, Umbral Calculus
dc.description6TH International Conference on Lattice Path Combinatorics and Applications, 11 pages
dc.identifierhttps://arxiv.org/abs/0709.0878
dc.identifierhttp://arxiv.org/abs/0709.0878
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/137447
dc.subjectCombinatorics
dc.subject05A15; 05A40
dc.titlePattern Avoiding Ballot Paths and Finite Operator Calculus
dc.typetext

Files

Collections

arXiv