Explicit bounds for the number of p-core partitions

Byungchan Kim, Jeremy Rouse

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

In this article, we derive explicit bounds on ct(n), the number of t-core partitions of n. In the case when t = p is prime, we express the generating function f(z) as the sum f(z) = epE(z) +Σirigi(z) of an Eisenstein series and a sum of normalized Hecke eigenforms. We combine the Hardy-Littlewood circle method with properties of the adjoint square lifting from automorphic forms on GL(2) to GL(3) to bound R(p):= Σi |ri|, solving a problem raised by Granville and Ono. In the case of general t, we use a combination of techniques to bound ct(n) and as an application prove that for all n ≥ 0, n ≠t + 1, ct+1(n) ≥ ct(n) provided 4 ≤ t ≤ 198, as conjectured by Stanton.

Original languageEnglish
Pages (from-to)875-902
Number of pages28
JournalTransactions of the American Mathematical Society
Volume366
Issue number2
DOIs
StatePublished - 2014

Fingerprint

Dive into the research topics of 'Explicit bounds for the number of p-core partitions'. Together they form a unique fingerprint.

Cite this