Lattice path enumeration and umbral calculus (Q4353153)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1058045
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lattice path enumeration and umbral calculus |
scientific article; zbMATH DE number 1058045 |
Statements
19 January 1998
0 references
umbral calculus
0 references
lattice path enumeration
0 references
distribution functions
0 references
Kolmogorov-Smirnov tests
0 references
ballot problem
0 references
Sheffer polynomial sequences
0 references
0.8023487329483032
0 references
0.771733283996582
0 references
Lattice path enumeration and umbral calculus (English)
0 references
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].
0 references