A Unification of Two Refinements of Euler's Partition Theorem

Simple item page
dc.creatorChen, William Y. C.
dc.creatorGao, Henry Y.
dc.creatorJi, Kathy Q.
dc.creatorLi, Martin Y. X.
dc.date2008-12-15
dc.date2009-02-25
dc.date.accessioned2026-07-07T12:46:06Z
dc.date.available2026-07-07T12:46:06Z
dc.descriptionWe obtain a unification of two refinements of Euler's partition theorem respectively due to Bessenrodt and Glaisher. A specialization of Bessenrodt's insertion algorithm for a generalization of the Andrews-Olsson partition identity is used in our combinatorial construction.
dc.description14 pages, 3 figures, the last version, to appear in The Ramanujan Journal
dc.identifierhttps://arxiv.org/abs/0812.2826
dc.identifierhttp://arxiv.org/abs/0812.2826
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/221266
dc.subjectCombinatorics
dc.subjectNumber Theory
dc.titleA Unification of Two Refinements of Euler's Partition Theorem
dc.typetext

Files

Collections

arXiv