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

Simple item page
dc.creatorVance, Bennet
dc.date2001-12-11
dc.date.accessioned2026-07-07T04:45:10Z
dc.date.available2026-07-07T04:45:10Z
dc.descriptionWe 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.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/math/0112107
dc.identifierhttp://arxiv.org/abs/math/0112107
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/62866
dc.subjectCombinatorics
dc.titleA derivation of the Catalan numbers from a bijection between permutations and labeled trees
dc.typetext

Files

Collections

arXiv