Effective bounds for the Andrews spt-function

From MaRDI portal




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



Cites work


Cited in
(24)






This page was built for publication: Effective bounds for the Andrews spt-function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2311862)