AI Chat AI Image Generator AI Video Text to Speech

Between Broadway and the Hudson: A Bijection of Corridor Paths

06/11/2020

∙

by Nachum Dershowitz, et al.

∙

∙

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.

research

∙ 06/11/2020

Between Broadway and the Hudson

A substantial generalization of the equinumeracy of grand-Dyck paths and...

0 Nachum Dershowitz, et al. ∙

research

∙ 09/01/2023

A lattice on Dyck paths close to the Tamari lattice

We introduce a new poset structure on Dyck paths where the covering rela...

0 Jean-Luc Baril, et al. ∙

research

∙ 08/25/2020

Flip Paths Between Lattice Triangulations

The problem of finding a diagonal flip path between two triangulations h...

0 William Sims, et al. ∙

research

∙ 05/08/2023

The induced two paths problem

We give an approximate Menger-type theorem for when a graph G contains t...

0 Sandra Albrechtsen, et al. ∙

research

∙ 06/13/2019

On discrete idempotent paths

The set of discrete lattice paths from (0, 0) to (n, n) with North and E...

0 Luigi Santocanale, et al. ∙

research

∙ 05/23/2018

Local time for lattice paths and the associated limit laws

For generalized Dyck paths (i.e., directed lattice paths with any finite...

0 Cyril Banderier, et al. ∙

research

∙ 10/06/2021

Lattice paths with a first return decomposition constrained by the maximal height of a pattern

We consider the system of equations A_k(x)=p(x)A_k-1(x)(q(x)+∑_i=0^k A_i...

0 Jean-Luc Baril, et al. ∙