A unification of two refinements of Euler's partition theorem

DOI10.1007/s11139-008-9156-7zbMath1218.05020arXiv0812.2826MaRDI QIDQ618842

William Y. C. Chen, Henry Y. Gao, Martin Y. X. Li, Kathy Qing Ji

Publication date: 17 January 2011

Published in: The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0812.2826

zbMATH Keywords

partition; bijection; refinement; Euler's partition theorem; Andrews-Olsson's theorem; Bessenrodt's bijection

Mathematics Subject Classification ID

05A17: Combinatorial aspects of partitions of integers

11P81: Elementary theory of partitions

Related Items

The Andrews-Olsson identity and Bessenrodt insertion algorithm on Young walls

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A four-parameter partition identity
• Lecture hall partitions. II
• Lecture hall partitions
• A combinatorial proof of a refinement of the Andrews-Olsson partition identity
• A note on partitions into distinct parts and odd parts
• A bijection for Lebesgue's partition identity in the spirit of Sylvester
• On a partition function of Richard Stanly
• Generalisations of the Andrews-Olsson partition identity and applications
• The \(q\)-variations of Sylvester's bijection between odd and strict partitions
• On generalizations of Euler's partition theorem
• A combinatorial proof of Andrews’ partition functions related to Schur’s partition theorem
• Partition Identities--From Euler to the Present