Effective Bounds for the Andrews spt-function

preprint2019arXivOpen access

Abstract

In this paper, we establish an asymptotic formula with an effective bound on the error term for the Andrews smallest parts function spt(n)\mathrm{spt}(n). We use this formula to prove recent conjectures of Chen concerning inequalities which involve the partition function p(n)p(n) and spt(n)\mathrm{spt}(n). Further, we strengthen one of the conjectures, and prove that for every ε>0ε>0 there is an effectively computable constant N(ε)>0N(ε) > 0 such that for all n≥N(ε)n\geq N(ε), we have \begin{equation*} \frac{\sqrt{6}}π\sqrt{n}\,p(n)<\mathrm{spt}(n)<\left(\frac{\sqrt{6}}π+ε\right) \sqrt{n}\,p(n). \end{equation*} Due to the conditional convergence of the Rademacher-type formula for spt(n)\mathrm{spt}(n), we must employ methods which are completely different from those used by Lehmer to give effective error bounds for p(n)p(n). Instead, our approach relies on the fact that p(n)p(n) and spt(n)\mathrm{spt}(n) can be expressed as traces of singular moduli.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.