# Effective Bounds for the Andrews spt-function

## TL;DR

This paper derives an effective asymptotic formula for the Andrews spt-function, proves inequalities involving it and the partition function, and employs trace formulas of singular moduli to establish bounds.

## Contribution

It provides the first effective bounds for the spt-function using trace formulas, confirming conjectures and strengthening inequalities related to partition functions.

## Key findings

- Established an asymptotic formula with effective error bounds for spt(n)
- Proved inequalities relating spt(n) and p(n) with explicit constants
- Demonstrated the use of trace formulas of singular moduli for effective bounds

## Abstract

In this paper, we establish an asymptotic formula with an effective bound on the error term for the Andrews smallest parts function $\mathrm{spt}(n)$. We use this formula to prove recent conjectures of Chen concerning inequalities which involve the partition function $p(n)$ and $\mathrm{spt}(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 $n\geq N(\epsilon)$, we have \begin{equation*} \frac{\sqrt{6}}{\pi}\sqrt{n}\,p(n)<\mathrm{spt}(n)<\left(\frac{\sqrt{6}}{\pi}+\epsilon\right) \sqrt{n}\,p(n). \end{equation*} Due to the conditional convergence of the Rademacher-type formula for $\mathrm{spt}(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 $\mathrm{spt}(n)$ can be expressed as traces of singular moduli.