The enumeration of lattice paths with respect to their number of turns (Q4353154)
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 1058046
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The enumeration of lattice paths with respect to their number of turns |
scientific article; zbMATH DE number 1058046 |
Statements
4 September 1997
0 references
enumeration of lattice paths
0 references
two-rowed arrays
0 references
turn enumeration
0 references
path counting
0 references
0 references
0.9285562
0 references
0 references
0.92397404
0 references
0.91911954
0 references
0.9136414
0 references
0.9131271
0 references
The enumeration of lattice paths with respect to their number of turns (English)
0 references
This paper is concerned with the enumeration of lattice paths in the plane with a given number of turns. It gives a uniform approach to this problem by encoding paths in terms of two-rowed arrays. The author shows that two-rowed arrays allow to handle turn enumeration in a purely combinatorial way. The combinatorics of two-rowed arrays is able to explain all the existing formulas in a conceptual way. What is very appealing is that all the standard techniques from ordinary path counting, such as the reflection principle or the interchanging procedure for nonintersecting lattice paths, have their analogues in this theory. For the entire collection see [Zbl 0865.00053].
0 references