Metraipolis › archive › dc_150bb4b6566d
A quadratic-residue dichotomy for two partition functions modulo 3 — arXiv:2609.22340
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.22340
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T21:50:04.019Z
- SHA-256 of the archived text
d51d9f1e572289ee6694c1bc7fa157b7601b9b6561a5eae16a961719e5e2ea98- Stable URL of this page
https://metraipolis.com/documento/dc_150bb4b6566d
How to cite
A quadratic-residue dichotomy for two partition functions modulo 3 — arXiv:2609.22340 — arXiv (en), https://arxiv.org/abs/2609.22340 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_150bb4b6566d (Metraipolis archive dc_150bb4b6566d, sha256 d51d9f1e572289ee6694c1bc7fa157b7601b9b6561a5eae16a961719e5e2ea98)
BibTeX
@misc{dc150bb4b6566d,
title = {A quadratic-residue dichotomy for two partition functions modulo 3 — arXiv:2609.22340},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.22340},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_150bb4b6566d; sha256 d51d9f1e572289ee6694c1bc7fa157b7601b9b6561a5eae16a961719e5e2ea98},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.22340. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $f_{0,1,4}(n)$ denote the number of partitions of $n$ into parts congruent to 0, 1 or 4 modulo 5 with each part used at most twice, and let $f_{0,2,3}(n)$ be defined analogously for parts congruent to 0, 2 or 3 modulo 5. We prove that for every prime $p \equiv 3 \pmod 4$ there are explicit non-negative integers $a(p)$ and $b(p)$, determined by $20a(p) \equiv -9$ and $20b(p) \equiv -1 \pmod{p^2}$, such that $f_{0,1,4}(p^2m + a(p))$ and $f_{0,2,3}(p^2m + b(p))$ are congruent modulo 3 to $f_{0,1,4}(m)$ and $f_{0,2,3}(m)$ when $p \equiv \pm 1 \pmod 5$, and to $f_{0,2,3}(m)$ and $f_{0,1,4}(m)$ when $p \equiv \pm 2 \pmod 5$. By quadratic reciprocity the two functions are preserved exactly when 5 is a quadratic residue modulo $p$, and interchanged otherwise. The smallest cases are $f_{0,1,4}(9m) \equiv f_{0,2,3}(m)$ and $f_{0,2,3}(9m+4) \equiv f_{0,1,4}(m)$. The proof reduces each generating function modulo 3 to the square of a Rogers-Ramanujan-type theta function by means of $(1-x)^{\ell} \equiv 1-x^{\ell} \pmod{\ell}$ and the Jacobi triple product, and then dissects the resulting binary quadratic form using the fact that $-1$ is a quadratic non-residue modulo $p$. As corollaries we obtain, for each such $p$, a congruence with exceptions on a progression of modulus $p$, and an infinite family of self-similarity congruences on progressions of modulus $p^{dn}$ with $d = 2$ or $d = 4$ and constants $9(p^{dn}-1)/20$ and $(p^{dn}-1)/20$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.CO).
Categorie arXiv: Number Theory (math.NT) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.22340 — 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-09T21:26:41.168Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).