An iterative-bijective approach to generalizations of Schur's theorem

Simple item page
dc.creatorCorteel, Sylvie
dc.creatorLovejoy, Jeremy
dc.date2004-04-28
dc.date2007-09-11
dc.date.accessioned2026-07-07T08:28:37Z
dc.date.available2026-07-07T08:28:37Z
dc.descriptionWe start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colored partitions. These theorems imply a number of important results, including Schur's theorem, Bressoud's generalization of a theorem of Göllnitz, two of Andrews' generalizations of Schur's theorem, and the Andrews-Olsson identities.
dc.description16 pages
dc.identifierhttps://arxiv.org/abs/math/0404508
dc.identifierhttp://arxiv.org/abs/math/0404508
dc.identifierEurop. J. Combin. 27 (2006), 496-512
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/137681
dc.subjectCombinatorics
dc.subject11P81; 05A17
dc.titleAn iterative-bijective approach to generalizations of Schur's theorem
dc.typetext

Files

Collections

arXiv