Counting lattice paths taking steps in infinitely many directions under special access restrictions
type: Item
instance of: scholarly article
title: Counting lattice paths taking steps in infinitely many directions under special access restrictions
zbMATH Open document ID: 1043.05008
author: Katherine Humphreys
author: Heinrich Niederhausen
published in: Theoretical Computer Science
publication date: 2004-08-10T00:00:00Z
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05A40
zbMATH DE Number: 2085497
zbMATH Keywords: Lattice path counting
zbMATH Keywords: Infinite step set
zbMATH Keywords: Umbral calculus
zbMATH Keywords: Sheffer sequence
zbMATH Keywords: Privileged access
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.02.008
OpenAlex ID: W2073832137
cites work: Basic analytic combinatorics of directed lattice paths
cites work: Linear recurrences with constant coefficients: The multivariate case
cites work: Q4275389
cites work: Counting lattice paths with privileged access using Sheffer sequences
cites work: On Some Alternative Characterizations of Riordan Arrays
cites work: Underdiagonal lattice paths with unrestricted steps
cites work: Q5675806
cites work: Q3792691
cites work: Generalized Sheffer sequences satisfying piecewise functional conditions
cites work: The umbral calculus
cites work: On the foundations of combinatorial theory. VIII: Finite operator calculus
cites work: Q4236280
cites work: Counting lattice paths by Narayana polynomials
DOI: 10.1016/J.TCS.2004.02.008
description: scientific article; zbMATH DE number 2085497