Indexed metadata

Internal congruences modulo powers of 22 for overpartition tuples with odd parts

Manjil P. Saikia, Prabal Talukdar

Source record

Source: arXiv

Published: Sep 10, 2026

arXiv: 2609.11806

Open original source ↗

Source abstract

Let OPTm(n)\overline{\mathrm{OPT}}_m(n) denote the number of overpartition mm-tuples of nn into odd parts. We prove that for every odd m1m\ge1 and every i3i\ge3, n0(OPTm(2in)OPTm(2i1n))qn2i+1k0q(2k+1)2(mod2i+2).\sum_{n\ge0}\Bigl(\overline{\mathrm{OPT}}_m\bigl(2^in\bigr)-\overline{\mathrm{OPT}}_m\bigl(2^{i-1}n\bigr)\Bigr)q^n \equiv 2^{\,i+1}\sum_{k\ge0}q^{(2k+1)^2} \pmod{2^{\,i+2}} . Thus OPTm(2in)OPTm(2i1n)(mod2i+1)\overline{\mathrm{OPT}}_m(2^in)\equiv \overline{\mathrm{OPT}}_m(2^{i-1}n)\pmod{2^{i+1}}, with equality of 22-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 22 per iteration.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.