Counting lattice paths taking steps in infinitely many directions under special access restrictions

DOI10.1016/j.tcs.2004.02.008zbMath1043.05008OpenAlexW2073832137MaRDI QIDQ596071

Heinrich Niederhausen, Katherine Humphreys

Publication date: 10 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.008

zbMATH Keywords

Sheffer sequenceInfinite step setLattice path countingPrivileged accessUmbral calculus

Mathematics Subject Classification ID

Umbral calculus (05A40) Exact enumeration problems, generating functions (05A15)

Related Items

On the enumeration of non-crossing pairings of well-balanced binary strings, A history and a survey of lattice path enumeration

Cites Work

• The umbral calculus
• Underdiagonal lattice paths with unrestricted steps
• Counting lattice paths by Narayana polynomials
• Linear recurrences with constant coefficients: The multivariate case
• Basic analytic combinatorics of directed lattice paths
• On the foundations of combinatorial theory. VIII: Finite operator calculus
• On Some Alternative Characterizations of Riordan Arrays
• Generalized Sheffer sequences satisfying piecewise functional conditions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item