2000 character limit reached
A bijection for Delannoy paths (2202.04649v1)
Published 9 Feb 2022 in math.CO
Abstract: We exhibit a bijection between central Delannoy $n$-paths, that is, lattice paths from the origin to $(n,n)$ with steps $E=(1,0), \,N=(0,1),\,D=(1,1)$ and the lattice paths from the origin to $(n+1,n)$ where the only restriction on the steps is that they have finite nonnegative slope.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.