Papers
Topics
Authors
Recent
Search
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 OPT‾<em>m(n)\overline{\mathrm{OPT}}<em>m(n) denote the number of overpartition mm-tuples of nn into odd parts. We prove that for every odd m≥1m\ge1 and every i≥3i\ge3, [\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 OPT‾m(2<sup>in)≡</sup>OPT‾m(2<sup>i−1n)(mod2<sup>i+1)\overline{\mathrm{OPT}}_m(2<sup>in)\equiv</sup> \overline{\mathrm{OPT}}_m(2<sup>{i-1}n)\pmod{2<sup>{i+1}}, with equality of $2$-adic valuations exactly at the odd squares. The proof is elementary and uniform in mm: a single family of integer polynomials, given by a three-term recurrence, governs every UU-operator identity involved, and a divisibility statement supplies one power of $2$ per iteration.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.