Between Broadway and the Hudson: A Bijection of Corridor Paths
From MaRDI portal
Publication:5856390
zbMath1460.05011arXiv2006.06516MaRDI QIDQ5856390
Publication date: 26 March 2021
Full work available at URL: https://arxiv.org/abs/2006.06516
Exact enumeration problems, generating functions (05A15) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting paths in corridors using circular Pascal arrays
- A history and a survey of lattice path enumeration
- Pairs of noncrossing free Dyck paths and noncrossing partitions
- Strong versions of Sperner's theorem
- Basic analytic combinatorics of directed lattice paths
- Bijections for pairs of non-crossing lattice paths and walks in the plane
- Weighted lattice paths
- Excursion and meander in random walk
- Word Problems Solvable in Logspace
- Two bijections for the area of Dyck paths
This page was built for publication: Between Broadway and the Hudson: A Bijection of Corridor Paths