2000 character limit reached
Internal congruences modulo powers of $2$ for overpartition tuples with odd parts
Published 10 Sep 2026 in math.NT and math.CO | (2609.11806v1)
Abstract: Let denote the number of overpartition -tuples of into odd parts. We prove that for every odd and every , [\sum{n\ge0}\Bigl(\overline{\mathrm{OPT}}m\bigl(2in\bigr)-\overline{\mathrm{OPT}}_m\bigl(2{i-1}n\bigr)\Bigr)qn \equiv 2{\,i+1}\sum{k\ge0}q{(2k+1)2} \pmod{2{\,i+2}}.] Thus , with equality of $2$-adic valuations exactly at the odd squares. The proof is elementary and uniform in : a single family of integer polynomials, given by a three-term recurrence, governs every -operator identity involved, and a divisibility statement supplies one power of $2$ per iteration.
Paper Prompts
Sign up for free to create and run prompts on this paper.