English

High order congruences for $M$-ary partitions

Number Theory 2024-03-08 v1 Combinatorics

Abstract

For a sequence M=(mi)i=0M=(m_{i})_{i=0}^{\infty} of integers such that m0=1m_{0}=1, mi2m_{i}\geq 2 for i1i\geq 1, let pM(n)p_{M}(n) denote the number of partitions of nn into parts of the form m0m1mrm_{0}m_{1}\cdots m_{r}. In this paper we show that for every positive integer nn the following congruence is true: \begin{align*} p_{M}(m_{1}m_{2}\cdots m_{r}n-1)\equiv 0\ \ \left({\rm mod}\ \prod_{t=2}^{r}\mathcal{M}(m_{t},t-1)\right), \end{align*} where M(m,r):=mgcd(m,lcm(1,,r))\mathcal{M}(m,r):=\frac{m}{\gcd\big(m,{\rm lcm} (1,\ldots ,r)\big)}. Our result answers a conjecture posed by Folsom, Homma, Ryu and Tong, and is a generalisation of the congruence relations for mm-ary partitions found by Andrews, Gupta, and R{\o}dseth and Sellers.

Keywords

Cite

@article{arxiv.2403.04495,
  title  = {High order congruences for $M$-ary partitions},
  author = {Błażej Żmija},
  journal= {arXiv preprint arXiv:2403.04495},
  year   = {2024}
}
R2 v1 2026-06-28T15:12:19.773Z