A double bounded version of Schur's partition theorem
From MaRDI portal
(Redirected from Publication:1848145)
Abstract: Schur's partition theorem states that the number of partitions of n into distinct parts congruent 1, 2 (mod 3) equals the number of partitions of n into parts which differ by >= 3, where the inequality is strict if a part is a multiple of 3. We establish a double bounded refined version of this theorem by imposing one bound on the parts congruent 0,1 (mod 3) and another on the parts congruent 2 (mod 3), and by keeping track of the number of parts in each of the residue classes (mod 3). Despite the long history of Schur's theorem, our result is new, and extends earlier work of Andrews, Alladi-Gordon and Bressoud. We give combinatorial and q-theoretic proofs of our result. The special case L=M leads to a representation of the generating function of the underlying partitions in terms of the q-trinomial coefficients extending a similar previous representation of Andrews.
Recommendations
- scientific article; zbMATH DE number 970808
- Generalizations of Schur's partition theorem
- scientific article; zbMATH DE number 2063235
- The dual of Göllnitz's (big) partition theorem
- A reversal of Schur's partition theorem
- On a partition analog of the Cauchy-Davenport Theorem
- A Tauberian theorem for partitions
- Schur's Partition Theorem, Companions, Refinements and Generalizations
- A Generalization of the Classical Partition Theorems
- A Bound for the Number of Multiplicative Partitions
Cited in
(12)- Generalizations of Schur's partition theorem
- The Alladi-Schur polynomials and their factorization
- On double sum generating functions in connection with some classical partition theorems
- A reversal of Schur's partition theorem
- Linked partition ideals and the Alladi-Schur theorem
- Double series representations for Schur's partition function and related identities
- scientific article; zbMATH DE number 681086 (Why is no real title available?)
- scientific article; zbMATH DE number 727111 (Why is no real title available?)
- Schur's Partition Theorem, Companions, Refinements and Generalizations
- A polynomial identity implying Schur's partition theorem
- On generalized Schur's partitions
- A computer proof of a polynomial identity implying a partition theorem of Göllnitz
This page was built for publication: A double bounded version of Schur's partition theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1848145)