A generalisation of a partition theorem of Andrews
\textit{G. E. Andrews} [Am. J. Math. 91, 18--24 (1969; Zbl 0186.30203)] proved a theorem on partitions with difference conditions which considerably generalizes the celebrated partitions identity of \textit{I. Schur} [Sitzungsberichte Akad. Berlin 1926, 488--495 (1926; JFM 52.0166.03)]. \textit{J. Lovejoy} [Int. J. Number Theory 1, No. 2, 215--224 (2005; Zbl 1087.11063)] generalized Schur's theorem to overpartitions. (An overpartition of \(n\) is a partition of \(n\) in which the frst occurrence of a part may be overlined.) In a previous paper, the author [Ramanujan J. 35, No. 3, 339--360 (2014; Zbl 1307.11106)] generalized a special case of Andrews' result to overpartitions. In the paper under review, the author extends Andrews' theorem in its full generality to overpartitions. The proof uses \(q\)-difference equations and recurrences.
- A generalisation of two partition theorems of Andrews
- A generalisation of a second partition theorem of Andrews to overpartitions
- On generalizations of partition theorems of Schur and Andrews to overpartitions
- Generalisations of the Andrews-Olsson partition identity and applications
- Unification, refinements and companions of generalisations of Schur's theorem
- A General Theorem on Partitions with Difference Conditions
- A new generalization of Schur's second partition theorem
- A THEOREM ON SEVEN-COLORED OVERPARTITIONS AND ITS APPLICATIONS
- Alder's conjecture
- An iterative-bijective approach to generalizations of Schur's theorem
- scientific article; zbMATH DE number 3127712 (Why is no real title available?)
- scientific article; zbMATH DE number 4154697 (Why is no real title available?)
- scientific article; zbMATH DE number 194092 (Why is no real title available?)
- scientific article; zbMATH DE number 1023394 (Why is no real title available?)
- On generalizations of partition theorems of Schur and Andrews to overpartitions
- The Andrews-Olsson identity and Bessenrodt insertion algorithm on Young walls
- A combinatorial proof of a refinement of the Andrews-Olsson partition identity
- Unification, refinements and companions of generalisations of Schur's theorem
- The method of weighted words revisited
- Overpartitions with bounded part differences
- Generalisations of the Andrews-Olsson partition identity and applications
- Unimodality of the Andrews-Garvan-Dyson cranks of partitions
- Weighted words at degree two. I: Bressoud's algorithm as an energy transfer
- A generalisation of two partition theorems of Andrews
- On q-difference equations for partitions without k-sequences
- Siladić's theorem: weighted words, refinement and companion
- Bressoud's generalization of Schur's theorem extension to overpartitions
- scientific article; zbMATH DE number 7399930 (Why is no real title available?)
- On a Rogers-Ramanujan type identity from crystal base theory
- On generalizations of partition theorems of Schur and Andrews to overpartitions
- A generalisation of a second partition theorem of Andrews to overpartitions
- Generalisation of a result on distinct partitions with bounded part differences
- scientific article; zbMATH DE number 6456841 (Why is no real title available?)
- scientific article; zbMATH DE number 7069623 (Why is no real title available?)
- On partitions with difference conditions.
This page was built for publication: A generalisation of a partition theorem of Andrews
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2634822)
