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

msra（2001）

引用 24|浏览2

暂无评分

摘要

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.

查看译文

关键词

catalan number

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要