Path count asymptotics and Stirling numbers
Combinatorics
2011-02-25 v2 Dynamical Systems
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.
Cite
@article{arxiv.0911.1970,
title = {Path count asymptotics and Stirling numbers},
author = {K. Petersen and A. Varchenko},
journal= {arXiv preprint arXiv:0911.1970},
year = {2011}
}
Comments
Misprint corrected. To appear in Proc. Amer. Math. Soc