The enumeration of lattice paths with respect to their number of turns
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].
- Enumerating a class of lattice paths
- Lattice path enumeration
- scientific article; zbMATH DE number 2247202
- Counting nonintersecting lattice paths with turns
- Enumeration of restricted three-dimensional lattice paths with fixed numbers of turns and an application
- Enumeration of edges in some lattices of paths
- The research and progress of the enumeration of lattice paths
- Enumerating lattice paths to hyperplanes
- Counting lattice paths via a cycle lemma
- Simple formulas for lattice paths avoiding certain periodic staircase boundaries
- The number of lattice paths below a cyclically shifting boundary
- Enumeration of restricted three-dimensional lattice paths with fixed numbers of turns and an application
- Multivariate Lagrange inversion and the maximum of a persistent random walk
- Planar walks with recursive initial conditions
- Maintaining the spirit of the reflection principle when the boundary has arbitrary integer slope
- From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
- Counting nonintersecting lattice paths with turns
- Enumeration of lattice paths with infinite types of steps and the Chung-Feller property
- The continuous weak order
- A Chung-Feller theorem for lattice paths with respect to cyclically shifting boundaries
- Enumerating closed flows on forks
- On the join dependency relation in multinomial lattices
- Some joint distributions related to the Galton statistic and runs
- Weight-preserving bijections between integer partitions and a class of alternating sign trapezoids
- Weight-preserving bijections between integer partitions and a family of alternating sign trapezoids
- The research and progress of the enumeration of lattice paths
- Counting lattice paths via a new cycle lemma
- Lattice path enumeration
- Numbers of left-right paths of two families of 2-dimensional planar lattices
- Dénombrements de chemins dans $\mathbb {R}^2$ soumis à contraintes
- Enumerating lattice paths touching or crossing the diagonal at a given number of lattice points
- Lattice paths and harmonic means
- Normal Forms for Coupled Takens-Bogdanov Systems
- The short toric polynomial
- Counting lattice paths by crossings and major index. I: The corner-flipping bijections
- scientific article; zbMATH DE number 7199610 (Why is no real title available?)
- On the Number of Turns in Reduced Random Lattice Paths
- Some determinants of path generating functions
- Counting lattice paths by crossings and major index. II: Tracking descents via two-rowed arrays
- Lattice paths and generalized cluster complexes
- A history and a survey of lattice path enumeration
This page was built for publication: The enumeration of lattice paths with respect to their number of turns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4353154)
