arXiv Analytics

Sign in

arXiv:1103.2650 [math.CO]AbstractReferencesReviewsResources

Some Combinatorial Identities from the Random Walk

M. J. Kronenburg

Published 2011-03-14Version 1

Eight combinatorial identities are listed and proved by counting paths in the one-dimensional random walk. Four of these identities are assumed to be new.

Related articles: Most relevant | Search more
arXiv:2101.05911 [math.CO] (Published 2021-01-14)
Counting paths, cycles and blow-ups in planar graphs
arXiv:0910.5897 [math.CO] (Published 2009-10-30)
A Probability Method to Prove Combinatorial Identities
arXiv:math/0012161 [math.CO] (Published 2000-12-18, updated 2008-06-05)
Counting Paths in Graphs