Bijections on Rooted Trees with Fixed Size of Maximal Decreasing Subtrees |
| |
| Authors: | Jang Soo Kim |
| |
| Institution: | 1. School of Mathematics, University of Minnesota, Minneapolis, MN, 55455, USA
|
| |
| Abstract: | Recently, Seo and Shin showed that the number of rooted trees on n + 1] = 1, 2, . . . , 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] → n] such that the image of f contains k]. We give a bijective proof of this theorem. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
