Path count asymptotics and Stirling numbers

Details Path count asymptotics and Stirling numbers Path count asymptotics and Stirling numbers

2009-11-10

arxiv.org/abs/0911.1970v2

Mathematics

Combinatorics

Misprint corrected. To appear in Proc. Amer. Math. Soc

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Path count asymptotics and Stirling numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Path count asymptotics and Stirling numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Path count asymptotics and Stirling numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-51887