arXiv Analytics

Sign in

arXiv:math/0112107 [math.CO]AbstractReferencesReviewsResources

A derivation of the Catalan numbers from a bijection between permutations and labeled trees

Bennet Vance

Published 2001-12-11Version 1

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.

Comments: 10 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:math/9904107 [math.CO] (Published 1999-04-21)
A self-dual poset on objects counted by the Catalan numbers and a type-B analogue
arXiv:1410.2084 [math.CO] (Published 2014-10-08)
The freeness of Ish arrangements
arXiv:2306.07733 [math.CO] (Published 2023-06-13)
Shifted Hankel determinants of Catalan numbers and related results II: Backward shifts

Links

Toolbox