Indexed metadata

Generalized Frobenius Partitions Modulo Powers of 22

Manjil P. Saikia

Source record

Source: arXiv

Published: Sep 10, 2026

arXiv: 2609.11813

Open original source ↗

Source abstract

Let cφk(n)cφ_k(n) denote the number of kk-colored generalized Frobenius partitions of nn. We prove that, for every m2m\geq2 and every k2(mod2m)k\equiv2\pmod{2^m}, n0cφk(n)qnφ(q)(q2;q2)(q;q)2n0cφk/2(n)q2n(mod2m), \sum_{n\geq0}cφ_k(n)q^n\equiv\frac{\varphi(q)\,(q^2;q^2)_\infty}{(q;q)_\infty^2}\sum_{n\geq0}cφ_{k/2}(n)q^{2n}\pmod{2^m}, where φ(q)\varphi(q) is the classical theta function. For m=2m=2 this recovers a congruence of Chan, Wang, and Yang. Applied with k=18k=18, we determine cφ18(2n+1)cφ_{18}(2n+1) modulo 1616 completely. In particular, we also prove n0cφ18(6n+1)qn4rZqr(3r1)/2(mod16), \sum_{n\geq0}cφ_{18}(6n+1)q^n \equiv4\sum_{r\in\mathbb{Z}}q^{r(3r-1)/2}\pmod{16}, which proves the congruences cφ18(30n+19)cφ18(30n+25)0(mod16)cφ_{18}(30n+19)\equiv cφ_{18}(30n+25)\equiv0\pmod{16} recently conjectured by Das, Nath, and Sarma (2026). It also yields further congruences modulo 1616 and a simple modulo-88 characterization that recovers and extends a recent congruence of those authors. As a second application we set k=10k=10 and determine cφ10(2n+1)cφ_{10}(2n+1) modulo 88.

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.