A new bijective proof of a partition theorem of K. Alladi

详细信息	查看全文 | 推荐本文 |

• 作者：Padmavathamma ; Raghavendra ; R. ; Chandrashekara ; B.M.
• 关键词：primary 11P81 ; 11P83 ; secondary 05A19 ; Partitions ; Bijective proof ; Alladi's theorem
• 刊名：Discrete Mathematics
• 出版年：2004
• 期刊代码：47_0012365x
• 类别：cp
• 出版时间：October 28, 2004
• 卷：287
• 期：1-3
• 页码：125-128
• 文件大小：145 K

摘要

The theorem “ the number of partitions of a positive integer n into distinct odd parts equals the number of partitions of n into parts <b>Formula Not Shownb> and differing by <b>Formula Not Shownb> with strict inequality if a part is even” was first discovered and then proved by Krishnaswamy Alladi in the year 1999. The object of this paper is to give a different bijective proof of this result.