Counting lattice paths by Narayana polynomials
From MaRDI portal
(Redirected from Publication:1578477)
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.
Recommendations
- Bi-banded paths, a bijection and the Narayana numbers
- Moments, Narayana numbers, and the cut and paste for lattice paths
- Riordan arrays, Łukasiewicz paths and Narayana polynomials
- Catalan path statistics having the Narayana distribution
- Generalizing Narayana and Schröder numbers to higher dimensions
Cited in
(40)- Universality results for the largest eigenvalues of some sample covariance matrix ensembles
- Identities involving Narayana polynomials and Catalan numbers
- Enumerating a class of lattice paths
- Counting curves via lattice paths in polygons
- The Carlitz lattice path polynomials
- A uniformly distributed statistic on a class of lattice paths
- A family of eigensequences
- Riordan arrays, Łukasiewicz paths and Narayana polynomials
- Weakly increasing trees on a multiset
- Counting lattice chains and Delannoy paths in higher dimensions
- On lattice paths with four types of steps
- Lattice paths and the \(q\)-ballot polynomials
- A unified approach to polynomial sequences with only real zeros
- A note on lattice chains and Delannoy numbers
- The number of fuzzy subgroups of finite cyclic groups and Delannoy numbers.
- Why Delannoy numbers?
- Moments, Narayana numbers, and the cut and paste for lattice paths
- Three dimensional Narayana and Schröder numbers
- Enumeration of generalized lattice paths by string types, peaks, and ascents
- Bi-banded paths, a bijection and the Narayana numbers
- Two new bijections on lattice paths
- scientific article; zbMATH DE number 4008398 (Why is no real title available?)
- scientific article; zbMATH DE number 165064 (Why is no real title available?)
- A combinatorial proof of the recurrence for rook paths
- Revisiting Narayana's approach to the Chung-Feller theorem
- Paths in the square unit lattice
- Counting lattice paths taking steps in infinitely many directions under special access restrictions
- Riordan arrays, generalized Narayana triangles, and series reversion
- A new hybrid generalization of Fibonacci and Fibonacci-Narayana polynomials
- Bogoyavlensky lattices and generalized Catalan numbers
- Lattice paths inside a table
- Minors of a class of recursive matrices related to partial (x,y;a,b)-Motzkin paths
- Some (not that) new examples of totally positive Riordan arrays
- Generalized Narayana polynomials and Dyck paths with coloured ascents
- New refinements of Narayana polynomials and Motzkin polynomials
- Enumerations of generalized Queen paths with respect to cyclically shifting boundaries
- On some quadratic algebras. I \(\frac{1}{2}\): Combinatorics of Dunkl and Gaudin elements, Schubert, Grothendieck, Fuss-Catalan, universal Tutte and reduced polynomials
- Identities from weighted Motzkin paths
- A history and a survey of lattice path enumeration
- An algorithm for the numbers of endomorphisms on paths (DM13208)
This page was built for publication: Counting lattice paths by Narayana polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1578477)
