Pattern avoiding ballot paths and finite operator calculus
From MaRDI portal
Publication:972837
DOI10.1016/J.JSPI.2010.01.026zbMATH Open1278.05019arXiv0709.0878OpenAlexW2033983166MaRDI QIDQ972837FDOQ972837
Heinrich Niederhausen, Haun Sullivan
Publication date: 21 May 2010
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
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 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
Full work available at URL: https://arxiv.org/abs/0709.0878
Cites Work
Cited In (7)
- Counting strings at height \(j\) in Dyck paths
- A history and a survey of lattice path enumeration
- Symbolic solutions of some linear recurrences
- Enumerating closed flows on forks
- Localization from incomplete noisy distance measurements
- Title not available (Why is that?)
- Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
This page was built for publication: Pattern avoiding ballot paths and finite operator calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972837)
