2000/06/27 by Krishnaswami Alladi, K. Alladi, Alladi, K. +3
Mathematics · #05a15 #05a17 #05a19 #11p81 #11p82 #11p83 #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Analytic Number Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT) #Quantum Algebra (math.QA) #math.CO #math.NT #math.QA #msc:05a15 #msc:05a17 #msc:05a19 #msc:11p81 #msc:11p82 #msc:11p83
paper · pdf · doi:10.48550/arxiv.math/0006207
20 pages, to appear in Erdos memorial issue of Janos Bolyai Society Definitions in Theorems 2 and 3 corrected, references updated
openalex publication_date 2000/06/27 · arxiv created 2000/10/22 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.