Recursive initial value problems for Sheffer sequences

DOI10.1016/S0012-365X(98)00376-8MaRDI QIDQ1300983zbMATH OpenFDO

Authors Heinrich Niederhausen

Publication date 24 September 2000

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

enumerationinitial value problemlattice pathsfinite operator calculus

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1161359
• scientific article; zbMATH DE number 1058045
• Symmetric Sheffer sequences and their applications to lattice path counting
• The enumeration of restricted random walks by Sheffer polynomials with applications to statistics

Cites work

• scientific article; zbMATH DE number 1058045 (Why is no real title available?)
• scientific article; zbMATH DE number 1161359 (Why is no real title available?)
• On the foundations of combinatorial theory. VIII: Finite operator calculus

Cited in

(6)

• Counting lattice paths with privileged access using Sheffer sequences
• A history and a survey of lattice path enumeration
• Generalized Sheffer sequences satisfying piecewise functional conditions
• Symbolic solutions of some linear recurrences
• On the enumeration of non-crossing pairings of well-balanced binary strings
• Pattern avoiding ballot paths and finite operator calculus

This page was built for publication: Recursive initial value problems for Sheffer sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1300983)