An iterative-bijective approach to generalizations of Schur's theorem
classification
🧮 math.CO
keywords
theoremschurgeneralizationstheoremsalladiandrewsandrews-olssonapproach
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.