The number of lattice paths below a cyclically shifting boundary
From MaRDI portal
Publication:1024357
Abstract: We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of varying slope. Our main result extends well known enumerative formulae concerning lattice paths, and its derivation involves a classical reflection argument. A refinement allows for the counting of paths with a specified number of corners. We also apply the result to examine paths dominated by periodic boundaries.
Recommendations
Cites work
- scientific article; zbMATH DE number 41707 (Why is no real title available?)
- scientific article; zbMATH DE number 1058046 (Why is no real title available?)
- A problem of arrangements
- A solution to the tennis ball problem
- Lattice path matroids: Enumerative aspects and Tutte polynomials
- Lattice paths not touching a given boundary
- Maintaining the spirit of the reflection principle when the boundary has arbitrary integer slope
- Simple formulas for lattice paths avoiding certain periodic staircase boundaries
Cited in
(10)- Symmetries of statistics on lattice paths between two boundaries
- Counting lattice paths taking steps in infinitely many directions under special access restrictions
- Simple formulas for lattice paths avoiding certain periodic staircase boundaries
- Lattice paths not touching a given boundary
- Maintaining the spirit of the reflection principle when the boundary has arbitrary integer slope
- Lattice and Schröder paths with periodic boundaries
- A Chung-Feller theorem for lattice paths with respect to cyclically shifting boundaries
- Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a cyclic lemma
- Counting lattice paths via a cycle lemma
- Lattice paths in corridors and cyclic corridors
This page was built for publication: The number of lattice paths below a cyclically shifting boundary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024357)