2012
DOI: 10.1515/crelle.2011.165
|View full text |Cite
|
Sign up to set email alerts
|

A proof of Subbarao's conjecture

Abstract: Let pðnÞ denote the ordinary partition function. Subbarao conjectured that in every arithmetic progression r ðmod tÞ there are infinitely many integers N 1 r ðmod tÞ for which pðNÞ is even, and infinitely many integers M 1 r ðmod tÞ for which pðMÞ is odd. In the even case the conjecture was settled by Ken Ono. In this paper we prove the odd part of the conjecture which together with Ono's result implies the full conjecture. We also prove that for every arithmetic progression r ðmod tÞ there are infinitely many… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
30
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 24 publications
(30 citation statements)
references
References 13 publications
(22 reference statements)
0
30
0
Order By: Relevance
“…See also [3] and the sources contained therein for further results. However, recent work of Radu [9] proved that there are no linear congruences of p(n) modulo 2 and 3, affirming a famous conjecture of Subbarao. The main ingredients of his proof are skillful computations and the q-expansion principle due to Deligne and Rapoport [4].…”
Section: Introduction and Statement Of Resultsmentioning
confidence: 83%
“…See also [3] and the sources contained therein for further results. However, recent work of Radu [9] proved that there are no linear congruences of p(n) modulo 2 and 3, affirming a famous conjecture of Subbarao. The main ingredients of his proof are skillful computations and the q-expansion principle due to Deligne and Rapoport [4].…”
Section: Introduction and Statement Of Resultsmentioning
confidence: 83%
“…(3.25) By the argument in [28,Theorem 4.2], we see that as a ranges over integers with (a, 6m) = 1, the quantity…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…We require a fact proved by Deligne and Rapoport (see [14,VII,Corollary 3.12] or [28,Corollary 5.3]): If f ∈ M k (Γ 1 (N)) has coefficients in Z[ζ N ] then the same is true of f | k γ for each γ ∈ Γ 0 (N).…”
Section: Proof Of Theoremmentioning
confidence: 99%
See 1 more Smart Citation
“…Despite the difficulty of this conjecture, there are some results. For example, Subbarao's [12] Conjecture has been proved by the works of the first author and Radu [8,11]. For every progression r (mod t), there are infinitely many m (resp.…”
mentioning
confidence: 99%