科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper we show a proof by explicit bijections of the famous Kirkman-Cayley formula for the number of dissections of a convex polygon. Our starting point is the bijective correspondence between the set of nested sets made by k subsets of {1, 2, ... , n} with cardinality >= 2 and the set of partitions of {1, 2, ... , n + k - 1} into k blocks with cardinality >= 2. A bijection between these two sets can be obtained from Peter L. Erdos and LA. Szekely result in Erdos and Szekely (1989); to make this paper self contained we describe another explicit bijection that is a variant of their bijection.
- 出版日期2015-1
