A Combinatorial Proof of Schur's 1926 Partition Theorem
From MaRDI portal
Publication:3885769
DOI10.2307/2043263zbMath0443.05009OpenAlexW4232542436MaRDI QIDQ3885769
Publication date: 1980
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2043263
Related Items (23)
An iterative-bijective approach to generalizations of Schur's theorem ⋮ A new bijective proof of a partition theorem of K. Alladi ⋮ Generalisations of the Andrews-Olsson partition identity and applications ⋮ Partition bijections, a survey ⋮ Beyond Göllnitz' theorem. II: Arbitrarily many primary colors ⋮ A polynomial identity implying Schur’s partition theorem ⋮ Weighted words at degree two. I: Bressoud's algorithm as an energy transfer ⋮ A combinatorial correspondence related to Göllnitz’ (big) partition theorem and applications ⋮ Bijective proofs of some classical partition identities ⋮ On generalizations of partition theorems of Schur and Andrews to overpartitions ⋮ A generalisation of a second partition theorem of Andrews to overpartitions ⋮ The duals of the 2-modular irreducible modules of the alternating groups ⋮ A bijective proof of the Alladi-Andrews-Gordon partition theorem ⋮ Combinatorial proofs and generalization of Bringmann, Lovejoy and Mahlburg's overpartition theorems ⋮ A bijective proof and generalization of Siladić's theorem ⋮ Beyond Göllnitz' theorem. I: A bijective approach ⋮ Beyond Göllnitz' theorem. I: A bijective approach ⋮ A bijective proof and generalization of Siladić's theorem ⋮ A bijection for Euler's partition theorem in the spirit of Bressoud ⋮ Parity of Schur's partition function ⋮ Generalizations of Schur's partition theorem ⋮ On generalized Schur’s partitions ⋮ On the work of Basil Gordon
This page was built for publication: A Combinatorial Proof of Schur's 1926 Partition Theorem
