A generalisation of a second partition theorem of Andrews to overpartitions

DOI10.1016/J.JCTA.2016.07.003MaRDI QIDQ507798zbMATH OpenOpenAlexFDO

Authors Jehanne Dousse

Publication date 9 February 2017

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1501.07478

zbMATH Keywords

\(q\)-difference equationsinteger partitionspartition identitiesrecurrences

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17)

Abstract: In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which generalise Schur's celebrated partition identity (1926). Andrews' two generalisations of Schur's theorem went on to become two of the most influential results in the theory of partitions, finding applications in combinatorics, representation theory and quantum algebra. In a recent paper, the author generalised the first of these theorems to overpartitions, using a new technique which consists in going back and forth between $q$-difference equations on generating functions and recurrence equations on their coefficients. Here, using a similar method, we generalise the second theorem of Andrews to overpartitions.

Recommendations

• A generalisation of two partition theorems of Andrews
• A generalisation of a partition theorem of Andrews
• An Andrews-Gordon type identity for overpartitions
• On generalizations of partition theorems of Schur and Andrews to overpartitions
• Unification, refinements and companions of generalisations of Schur's theorem

Cites work

• 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?)
• A Combinatorial Proof of Schur's 1926 Partition Theorem
• A General Theorem on Partitions with Difference Conditions
• A THEOREM ON SEVEN-COLORED OVERPARTITIONS AND ITS APPLICATIONS
• A combinatorial proof of a refinement of the Andrews-Olsson partition identity
• A generalisation of a partition theorem of Andrews
• A new generalization of Schur's second partition theorem
• Alder's conjecture
• An iterative-bijective approach to generalizations of Schur's theorem
• Bressoud's generalization of Schur's theorem extension to overpartitions
• Generalizations of Schur's partition theorem
• On Partition Functions Related to Schur's Second Partition Theorem
• On Schur's second partition theorem
• On a theorem of Schur and Gleissberg
• On generalizations of partition theorems of Schur and Andrews to overpartitions
• The Andrews-Olsson identity and Bessenrodt insertion algorithm on Young walls

Cited in

(9)

• The method of weighted words revisited
• A generalization of Agarwal's theorem
• A generalisation of two partition theorems of Andrews
• On a Rogers-Ramanujan type identity from crystal base theory
• Combinatorial proofs and generalization of Bringmann, Lovejoy and Mahlburg's overpartition theorems
• Weighted words at degree two. I: Bressoud's algorithm as an energy transfer
• Siladić's theorem: weighted words, refinement and companion
• A generalisation of a partition theorem of Andrews
• On generalizations of partition theorems of Schur and Andrews to overpartitions

This page was built for publication: A generalisation of a second partition theorem of Andrews to overpartitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507798)