Counting lattice paths by Narayana polynomials

zbMath0953.05006MaRDI QIDQ1578477

Robert A. Sulanke

Publication date: 14 September 2000

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/120720

zbMATH Keywords

lattice pathsNarayana numbersDelannoy numbers

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items

Enumeration of generalized lattice paths by string types, peaks, and ascents, A unified approach to polynomial sequences with only real zeros, Counting lattice paths taking steps in infinitely many directions under special access restrictions, A new hybrid generalization of Fibonacci and Fibonacci-Narayana polynomials, Bogoyavlensky lattices and generalized Catalan numbers, A note on lattice chains and Delannoy numbers, On some quadratic algebras. I \(\frac{1}{2}\): Combinatorics of Dunkl and Gaudin elements, Schubert, Grothendieck, Fuss-Catalan, universal Tutte and reduced polynomials, Enumerating a class of lattice paths, Identities from weighted Motzkin paths, A history and a survey of lattice path enumeration, Counting lattice chains and Delannoy paths in higher dimensions, Riordan arrays, Łukasiewicz paths and Narayana polynomials, An algorithm for the numbers of endomorphisms on paths (DM13208), Riordan arrays, generalized Narayana triangles, and series reversion, Weakly increasing trees on a multiset, The number of fuzzy subgroups of finite cyclic groups and Delannoy numbers., Universality results for the largest eigenvalues of some sample covariance matrix ensembles, A family of eigensequences, Identities involving Narayana polynomials and Catalan numbers, Why Delannoy numbers?, Three dimensional Narayana and Schröder numbers, Lattice paths and the \(q\)-ballot polynomials