Path count asymptotics and Stirling numbers
classification
🧮 math.CO
math.DS
keywords
numbersstirlingasymptoticsbuiltcertaincorollariescounteulerian
read the original abstract
We obtain formulas for the growth rate of the numbers of certain paths in infinite graphs built on the two-dimensional Eulerian graph. Corollaries are identities relating Stirling numbers of the first and second kinds.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.