Counting lattice paths by Narayana polynomials (Q1578477): Difference between revisions

If \(d(n)\) counts the lattice paths from \((0,0)\) to \((n,n)\) using steps \((0,1)\), \((1,0)\), and \((1,1)\), and \(e(n)\) counts the lattice paths from \((0,0)\) to \((n,n)\) using all possible steps \((a,b)\) with \(a\), \(b\) nonnegative integers, \((a,b)\neq (0,0)\), then \(e(n)= 2^{n- 1}d(n)\). In this paper a bijective proof of this identity is given. Several other bijections are provided between sets of lattice paths.