Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4654468 | European Journal of Combinatorics | 2006 | 17 Pages |
Abstract
We 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Sylvie Corteel, Jeremy Lovejoy,