arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1108.6038math.CO
收藏

最大减子树长度固定的有根树上的双射

Bijections on rooted trees with fixed size of maximal decreasing subtrees

Jang Soo Kim

摘要:

Seo和Shin证明了$[n+1]$上的有根树的数目使得具有相同根的最大递减子树具有$k+1$顶点等于函数$f:[n]\to[n]$的数目使得$f$的图像包含$[k]$。我们给出了这个定理的一个双射证明。

英文摘要:

Seo and Shin showed that the number of rooted trees on $[n+1]$ such that the maximal decreasing subtree with the same root has $k+1$ vertices is equal to the number of functions $f:[n]\to[n]$ such that the image of $f$ contains $[k]$. We give a bijective proof of this theorem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑