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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
10 pages

Keywords

Combinatorics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/62866

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0112107
 http://arxiv.org/abs/math/0112107

Collections

arXiv