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

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
 
(2 intermediate revisions by one other user not shown)
Property / reviewed by
 
Property / reviewed by: László A. Székely / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: László A. Székely / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Latest revision as of 03:58, 5 March 2024

scientific article
Language Label Description Also known as
English
Counting lattice paths by Narayana polynomials
scientific article

    Statements

    Counting lattice paths by Narayana polynomials (English)
    0 references
    0 references
    14 September 2000
    0 references
    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.
    0 references
    Delannoy numbers
    0 references
    Narayana numbers
    0 references
    lattice paths
    0 references

    Identifiers