Extensions of the truncated pentagonal number theorem (2504.04697v1)
Abstract: Andrews and Merca introduced and proved a $q$-series expansion for the partial sums of the $q$-series in Euler's pentagonal number theorem. Kolitsch, in 2022, introduced a generalization of the Andrews-Merca identity via a finite sum expression for $ \sum_{n \geq k} \frac{ q{ (k + m) n } }{ \left( q; q \right){n} } \left[ \begin{smaLLMatrix} n - 1 \ k - 1 \end{smaLLMatrix} \right]{q}$ for positive integers $m$, and Yao also proved an equivalent evaluation for this $q$-series in 2022, and Schlosser and Zhou extended this result for complex values $m$ in 2024, with the $m = 1$ case yielding the Andrews-Merca identity, and with the $m = 2$ case having been proved separately by Xia, Yee, and Zhao. We introduce and apply a method, based on the $q$-version of Zeilberger's algorithm, that may be used to obtain finite sum expansions for $q$-series of the form $ \sum_{n \geq 1} \frac{ q{ p(k) n } }{ \left( q; q \right){n + \ell_2} } \left[ \begin{smaLLMatrix} n - \ell{1} \ k - 1 \end{smaLLMatrix} \right]{q} $ for linear polynomials $p(k)$ and $\ell{1} \in \mathbb{N}$ and $\ell_{2} \in \mathbb{N}_{0}$, thereby generalizing the Andrews-Merca identity and the Kolitsch, Yao, and Schlosser-Zhou identities. For example, the $(p(k), \ell_1, \ell_2) = (k+1, 2, 0)$ case provides a new truncation identity for Euler's pentagonal number theorem.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.