A generalisation of a second partition theorem of Andrews to overpartitions

DOI10.1016/J.JCTA.2016.07.003zbMATH Open1355.05036arXiv1501.07478OpenAlexW2963554163MaRDI QIDQ507798FDOQ507798

Authors: Jehanne Dousse 

Publication date: 9 February 2017

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

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.

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

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

zbMATH Keywords

\(q\)-difference equationsinteger partitionspartition identitiesrecurrences

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17)

Cites Work

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

Cited In (9)

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