2020
DOI: 10.1142/s1793042120501171
|View full text |Cite
|
Sign up to set email alerts
|

Ranks of overpartitions modulo 4 and 8

Abstract: An overpartition of [Formula: see text] is a partition of [Formula: see text] in which the first occurrence of a number may be overlined. Then, the rank of an overpartition is defined as its largest part minus its number of parts. Let [Formula: see text] be the number of overpartitions of [Formula: see text] with rank congruent to [Formula: see text] modulo [Formula: see text]. In this paper, we study the rank differences of overpartitions [Formula: see text] for [Formula: see text] or [Formula: see text] and … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 17 publications
0
6
0
Order By: Relevance
“…The inequalities from Theorems 1, 2 and 4 also shed light on the signs of the coefficients of the rank differences found for ∈ {3, 4, 5, 7, 8} in [14], [17] and [21]. A study of rank inequalities based on q-series expansions was done in [18] for ∈ {6, 10}, but this was only possible in the case of some fairly simple expressions for which it is not difficult to conclude, say, that the coefficients are all positive (see, e.g., the proof of [18,Theorem 1.4]).…”
Section: Remarkmentioning
confidence: 78%
See 4 more Smart Citations
“…The inequalities from Theorems 1, 2 and 4 also shed light on the signs of the coefficients of the rank differences found for ∈ {3, 4, 5, 7, 8} in [14], [17] and [21]. A study of rank inequalities based on q-series expansions was done in [18] for ∈ {6, 10}, but this was only possible in the case of some fairly simple expressions for which it is not difficult to conclude, say, that the coefficients are all positive (see, e.g., the proof of [18,Theorem 1.4]).…”
Section: Remarkmentioning
confidence: 78%
“…By computing rank differences for = 4 and = 8, Cui, Gu and Su [14] established very recently 1 a few identities and inequalities, see Theorems 1.2-1.5 in [14], most of which also follow from Theorem 1 and the next result. However, while Theorem 1.5 in [14] gives several inequalities that hold modulo 8 for n in certain residue classes, it does not capture the full behavior of the inequalities. This is answered by Theorem 1 of the current paper, applied to the case c = 8.…”
Section: Resultsmentioning
confidence: 97%
See 3 more Smart Citations