TY - JOUR
T1 - MacMahon's partition identity and the coin exchange problem
AU - Yee, Ae Ja
N1 - Funding Information:
Research partially supported by National Science Foundation Grant DMS-0801184. E-mail address: [email protected]. 1 The author is an Alfred P. Sloan Research Fellow.
PY - 2009/10
Y1 - 2009/10
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=67349119846&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67349119846&partnerID=8YFLogxK
U2 - 10.1016/j.jcta.2009.02.006
DO - 10.1016/j.jcta.2009.02.006
M3 - Article
AN - SCOPUS:67349119846
SN - 0097-3165
VL - 116
SP - 1228
EP - 1231
JO - Journal of Combinatorial Theory. Series A
JF - Journal of Combinatorial Theory. Series A
IS - 7
ER -