Lattice path enumeration and umbral calculus
The author uses the umbral calculus and operator methods in solving systems of difference equations with given initial values. Such systems arise in lattice path enumeration problems: in particular, for paths underneath a boundary of straight lines, inside a diagonal band, weighted paths, paths with several step directions, and paths crossing some line a given number of times. In turn, they are connected with empirical distribution functions of Kolmogorov-Smirnov tests and the ballot problem. To solve these problems, some special Sheffer polynomial sequences are constructed. Most results presented here were published earlier [see, e.g., the author, J. Stat. Plann. Inference 54, No. 1, 87-100 (1996; Zbl 0857.05013)], except the theorem on geometric Sheffer sequences. For the entire collection see [Zbl 0865.00053].
- Lattice path enumeration by formal schema
- Recursive initial value problems for Sheffer sequences
- Partial difference equation method for lattice path problems
- Polynomial sequences of binomial type path integrals
- Two-boundary lattice paths and parking functions
- On combinatorial properties and the zero distribution of certain Sheffer sequences
- scientific article; zbMATH DE number 4202259 (Why is no real title available?)
- scientific article; zbMATH DE number 1161359 (Why is no real title available?)
- Counting lattice paths taking steps in infinitely many directions under special access restrictions
- Polynomial structures in rank statistics distributions
- An application of the umbral calculus
- A history and a survey of lattice path enumeration
This page was built for publication: Lattice path enumeration and umbral calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4353153)
