Combinatorial identities using Bernoulli Graphs
Combinatorics
2022-12-09 v1
Abstract
In here, I present a series of combinatorial equalities derived using a graph based approach. Different nodes in the graphs are visited following probabilistic dynamics of a moving dot. The results are presented in such a way that the generalisation (to more nodes, or dimensions) is straightforward. At an instant m, we "take a picture" of the system and we compute the probabilities of being at particular positions in space. The sum of all these probabilities is equal to one.
Cite
@article{arxiv.2212.04302,
title = {Combinatorial identities using Bernoulli Graphs},
author = {Jacques Bourg},
journal= {arXiv preprint arXiv:2212.04302},
year = {2022}
}
Comments
5 pages, 2 figures