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

The $$M_{2}$$ M 2 -rank of partitions without repeated odd parts modulo $$6$$ 6 and $$10$$ 10

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(15 citation statements)
references
References 13 publications
0
15
0
Order By: Relevance
“…Continuing on their work, Mao [6,7] extended the results for Dyson rank differences modulo 10 and M 2 rank differences modulo 6 and 10. He obtained several interesting inequalities based on his results such as N (1, 10, 5n + 1) > N (5, 10, 5n + 1), N 2 (0, 6, 3n + 1) + N 2 (1, 6, 3n + 1) > N 2 (2, 6, 3n + 1) + N 2 (3, 6, 3n + 1).…”
Section: Introduction and Resultsmentioning
confidence: 76%
See 1 more Smart Citation
“…Continuing on their work, Mao [6,7] extended the results for Dyson rank differences modulo 10 and M 2 rank differences modulo 6 and 10. He obtained several interesting inequalities based on his results such as N (1, 10, 5n + 1) > N (5, 10, 5n + 1), N 2 (0, 6, 3n + 1) + N 2 (1, 6, 3n + 1) > N 2 (2, 6, 3n + 1) + N 2 (3, 6, 3n + 1).…”
Section: Introduction and Resultsmentioning
confidence: 76%
“…Mao also gave some conjectures in [6,7] based on computational evidence, both for the Dyson rank and M 2 rank for partitions with unique odd parts. …”
Section: Introduction and Resultsmentioning
confidence: 99%
“…We give these identities for c = 7. Similar formulas were determined by Lovejoy and Osburn for c = 3 and c = 5 in [16] and for c = 6 and c = 10 by Mao in [18]. Rather than using harmonic Maass forms, those formulas used the q-series techniques developed by Atkin and Swinnerton-Dyer [2] to determine rank difference formulas for the rank of partitions.…”
Section: Statement Of Resultsmentioning
confidence: 96%
“…Most recently, Mao [7,8] has derived generating function formulas for Dyson's rank on partitions modulo 10, and the M 2 rank on partitions without repeated odd parts modulo 6 and 10. In this work he proves a number of inequalities, including for example N (0, 10, 5n + 1) > N (4, 10, 5n + 1),…”
Section: Introduction and Statement Of Resultsmentioning
confidence: 99%
“…We will also make use of the following theorem for M 2 rank of partitions without repeated odd parts. Theorem 2.3 (Mao [8]). We have that ∞ n=0 N 2 (0, 10, n) + N 2 (1, 10, n) − N 2 (4, 10, n) − N 2 (5, 10, n) q n 45,100…”
Section: 50mentioning
confidence: 99%