2014
DOI: 10.1007/s11139-014-9605-4
|View full text |Cite
|
Sign up to set email alerts
|

An Andrews–Gordon type identity for overpartitions

Abstract: In 1961, Gordon found a combinatorial generalization of the RogersRamanujan identities, which has been called the Rogers-Ramanujan-Gordon theorem. In 1974, Andrews derived an identity which can be considered as the generating function counterpart of the Rogers-Ramanujan-Gordon theorem, and it has been called the Andrews-Gordon identity. The Andrews-Gordon identity is an analytic generalization of the Rogers-Ramanujan identities with odd moduli. In 1979, Bressoud obtained a Rogers-Ramanujan-Gordon type theorem … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…In 2015, Chen, Sang and Shi [9] obtained the overpartition analogue of Theorem 1.1 in the case j = 0. The generating function form was also derived by Sang and Shi [14]. Here we state these two theorems in a unified form together with its generating function form.…”
Section: Then We Havementioning
confidence: 71%
“…In 2015, Chen, Sang and Shi [9] obtained the overpartition analogue of Theorem 1.1 in the case j = 0. The generating function form was also derived by Sang and Shi [14]. Here we state these two theorems in a unified form together with its generating function form.…”
Section: Then We Havementioning
confidence: 71%
“…In other words, some of the partition counters in Definition 7 have their generating functions expressed as multiple sums. Known examples are the Andrews-Gordon identities themselves [3], their counterpart for Bressoud's all-moduli generalization [6], Andrews-Gordon identities for overpartitions [7], and their Bressoud style generalization for overpartitions [19]. These constitute multiple series generating functions for 1 B 0 k,a (n), 2 B 0 k,a (n), 1 B 0 k,a (n), and 2 B 0 k,a (n).…”
Section: Discussion and Further Researchmentioning
confidence: 99%
“…It has been proved in [11] that the first reduction operation of p-th kind and The first reduction dilation of p-th kind are mutually inverse mapping. What is more, it has been proved in [30] that such two operation preserve the three conditions of G N 1 ,...,N k−1 ;i . Now we aim to give a proof of Theorem 3.3.…”
Section: Casementioning
confidence: 97%
“…Let E k,i (m, n) denote the number of overpartitions counted by E k,i (n) with exactly m parts, Sang and Shi [30] gave a combinatorial proof of the following generating function of E k,i (m, n).…”
Section: Introductionmentioning
confidence: 99%