Recursive initial value problems for Sheffer sequences (Q1300983): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4393357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the foundations of combinatorial theory. VIII: Finite operator calculus / rank
 
Normal rank

Latest revision as of 21:16, 28 May 2024

scientific article
Language Label Description Also known as
English
Recursive initial value problems for Sheffer sequences
scientific article

    Statements

    Recursive initial value problems for Sheffer sequences (English)
    0 references
    24 September 2000
    0 references
    The combinatorial problem addressed in this paper is the enumeration of certain lattice paths. The paths of interest are those which take unit steps in the North and East directions and have weighted left turns (East followed by North). Furthermore, such paths are restricted to lie either entirely above or entirely below a line of positive slope. Each of these latter cases leads to a different recursively defined initial value problem which is solved using tools from finite operator calculus. Although the article is self-contained, the non-expert may wish to consult one or both of the following: \textit{H. Niederhausen} [``Lattice path enumeration and umbral calculus'', in N. Balakrishnan (ed.), Advances in combinatorial methods and applications to probability and statistics, Birkhäuser, Boston, 15-27 (1997; Zbl 0880.05003)] and \textit{G.-C. Rota}, \textit{D. Kahaner} and \textit{A. Odlyzko} [On the foundations of combinatorial theory. VIII: Finite operator calculus, J. Math. Anal. Appl. 42, 684-760 (1973; Zbl 0267.05004)].
    0 references
    enumeration
    0 references
    lattice paths
    0 references
    initial value problem
    0 references
    finite operator calculus
    0 references

    Identifiers