Efficient Computation and Congruences for Colored Partition Functions

Abstract

For a positive integer $\alpha$, let $p_{\alpha }(n)$ denote the number of $\alpha$-colored partitions of $n$. The Rademacher-type expansion of Iskander, Jain, and Talvola is valid for every real $\alpha >0$, but when $\alpha >24$ it involves several polar terms and a two-parameter family of exponential sums $A_k^{(\alpha )}(n,m)$. For integral $\alpha$, we prove multiplicativity and prime-power reduction formulas for these sums, expressing their local factors as classical or quadratically twisted Kloosterman sums. Together with explicit truncation and precision bounds, these formulas yield an efficient algorithm for computing $p_{\alpha }(n)$ exactly. Our SageMath implementation computes the 1,113,767-digit integer $p_{100}(10^{10})$ in less than one hour. As an application, we use the algorithm to certify new Ramanujan-type congruences.

arXiv comment19 pages, Comments welcome!