An iterative-bijective approach to generalizations of Schur's theorem
From MaRDI portal
(Redirected from Publication:2368708)
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.
A particular iteration of a method introduced by \textit{K. Alladi} and \textit{B. Gordon} [Manuscr. Math. 79, No. 2, 113--126 (1993; Zbl 0799.11043)] to extend Schur's partition theorem is used to obtain more general results on colored partitions.
Recommendations
- scientific article; zbMATH DE number 5230613
- On generalizations of partition theorems of Schur and Andrews to overpartitions
- Bressoud's generalization of Schur's theorem extension to overpartitions
- Unification, refinements and companions of generalisations of Schur's theorem
- Schur's Partition Theorem, Companions, Refinements and Generalizations
Cites work
- A combinatorial proof of a refinement of the Andrews-Olsson partition identity
- A Combinatorial Proof of Schur's 1926 Partition Theorem
- A General Theorem on Partitions with Difference Conditions
- A new generalization of Schur's second partition theorem
- An Analytic Proof of the Rogers-Ramanujan-Gordon Identities
- Generalisations of the Andrews-Olsson partition identity and applications
- Generalizations of Schur's partition theorem
- scientific article; zbMATH DE number 4154697 (Why is no real title available?)
- scientific article; zbMATH DE number 681086 (Why is no real title available?)
- scientific article; zbMATH DE number 1023394 (Why is no real title available?)
- On a partition theorem of Göllnitz.
- On Partition Functions Related to Schur's Second Partition Theorem
- On Schur's second partition theorem
- Partitionen mit Differenzenbedingungen.
- Schur's Partition Theorem, Companions, Refinements and Generalizations
Cited in
(17)- The Alladi-Schur polynomials and their factorization
- Unification, refinements and companions of generalisations of Schur's theorem
- The method of weighted words revisited
- Combinatorial proofs and generalization of Bringmann, Lovejoy and Mahlburg's overpartition theorems
- A combinatorial proof of a Schmidt type theorem of Andrews and Paule
- Beyond Göllnitz' theorem. II: Arbitrarily many primary colors
- The dual of Göllnitz's (big) partition theorem
- A generalisation of a partition theorem of Andrews
- Generalisations of Capparelli's and Primc's identities. I: Coloured Frobenius partitions and combinatorial proofs
- Weighted words at degree two. I: Bressoud's algorithm as an energy transfer
- A bijective proof of a factorization theorem for (k,l)-hook schur functions
- scientific article; zbMATH DE number 554810 (Why is no real title available?)
- scientific article; zbMATH DE number 727111 (Why is no real title available?)
- A generalisation of a second partition theorem of Andrews to overpartitions
- scientific article; zbMATH DE number 5230613 (Why is no real title available?)
- A bijective proof and generalization of Siladić's theorem
- A bijective proof and generalization of Siladić's theorem
This page was built for publication: An iterative-bijective approach to generalizations of Schur's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368708)