Name
Abstract | ||
|---|---|---|
One of MacMahon's partition theorems says that the number of partitions of n into parts divisible by 2 or 3 equals the number of partitions of n into parts with multiplicity larger than 1. Recently, Holroyd has obtained a generalization. In this short note, we provide a bijective proof of his theorem. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.jcta.2009.02.006 | Journal of Combinatorial Theory Series A |
Keywords | DocType | Volume |
coin exchange problem,bijective proof,partition identity,short note,partition theorem,parts divisible | Journal | 116 |
Issue | ISSN | Citations |
7 | 0097-3165 | 0 |
PageRank | References | Authors |
0.34 | 2 | 1 |