A derivation of the Catalan numbers from a bijection between permutations and labeled trees
Combinatorics
2007-05-23 v1
Abstract
We present an algorithmic mapping from permutations of length dn to labeled n-node d-ary trees and back again. Given such a bijection, one can interpret each of the factorials in the formula for the Catalan numbers as a count of permutations.
Cite
@article{arxiv.math/0112107,
title = {A derivation of the Catalan numbers from a bijection between permutations and labeled trees},
author = {Bennet Vance},
journal= {arXiv preprint arXiv:math/0112107},
year = {2007}
}
Comments
10 pages