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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
