Between Broadway and the Hudson: A Bijection of Corridor Paths
School of Computer Science
Tel Aviv University
We present a substantial generalization of the equinumeracy of Grand Dyck
paths and Dyck-path prefixes, constrained within a band. The number of
constrained paths starting at level i and ending in a window of size 2j +
2 is equal to the number starting at level j and ending in a window of
size 2i + 2 centered around the same point. A new encoding of lattice
paths provides a bijective proof.
Full version: pdf,
(Concerned with sequences
Received January 13 2021; revised versions received January 14 2021; January 27 2021; January 30 2021.
Published in Journal of Integer Sequences,
January 30 2021.
Journal of Integer Sequences home page