A generalisation of a second partition theorem of Andrews to overpartitions
From MaRDI portal
Publication:507798
DOI10.1016/J.JCTA.2016.07.003zbMath1355.05036arXiv1501.07478OpenAlexW2963554163MaRDI QIDQ507798
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
Related Items (4)
On a Rogers-Ramanujan type identity from crystal base theory ⋮ Siladić’s theorem: Weighted words, refinement and companion ⋮ Weighted words at degree two. I: Bressoud's algorithm as an energy transfer ⋮ The method of weighted words revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Andrews-Olsson identity and Bessenrodt insertion algorithm on Young walls
- On generalizations of partition theorems of Schur and Andrews to overpartitions
- A combinatorial proof of a refinement of the Andrews-Olsson partition identity
- Generalizations of Schur's partition theorem
- An iterative-bijective approach to generalizations of Schur's theorem
- On a theorem of Schur and Gleissberg
- A generalisation of a partition theorem of Andrews
- Alder's conjecture
- A Combinatorial Proof of Schur's 1926 Partition Theorem
- 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
This page was built for publication: A generalisation of a second partition theorem of Andrews to overpartitions
