An iterative-bijective approach to generalizations of Schur's theorem
Combinatorics
2007-09-11 v2
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\"ollnitz, two of Andrews' generalizations of Schur's theorem, and the Andrews-Olsson identities.
Cite
@article{arxiv.math/0404508,
title = {An iterative-bijective approach to generalizations of Schur's theorem},
author = {Sylvie Corteel and Jeremy Lovejoy},
journal= {arXiv preprint arXiv:math/0404508},
year = {2007}
}
Comments
16 pages