Metraipolis › archive › dc_24480ba2c4ea

Internal congruences modulo powers of $2$ for overpartition tuples with odd parts — arXiv:2609.11806

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.11806
License (as archived)
CC0-1.0
Archived
2026-10-16T06:16:18.314Z
SHA-256 of the archived text
ac38132f5b29d763f44f784e35b82f5fb0fba9ef21208a67c612f44faae56dc9
Stable URL of this page
https://metraipolis.com/documento/dc_24480ba2c4ea

How to cite

Internal congruences modulo powers of $2$ for overpartition tuples with odd parts — arXiv:2609.11806 — arXiv (en), https://arxiv.org/abs/2609.11806 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_24480ba2c4ea (Metraipolis archive dc_24480ba2c4ea, sha256 ac38132f5b29d763f44f784e35b82f5fb0fba9ef21208a67c612f44faae56dc9)
BibTeX
@misc{dc24480ba2c4ea,
  title = {Internal congruences modulo powers of $2$ for overpartition tuples with odd parts — arXiv:2609.11806},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.11806},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_24480ba2c4ea; sha256 ac38132f5b29d763f44f784e35b82f5fb0fba9ef21208a67c612f44faae56dc9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11806. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.CO).
Categorie arXiv: Number Theory (math.NT) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.11806 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T05:59:08.327Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).