English

$M$-ary partition polynomials

Combinatorics 2024-03-13 v1 Number Theory

Abstract

Let M=(mi)i=0M=(m_{i})_{i=0}^{\infty} be a sequence of integers such that m0=1m_{0}=1 and mi2m_{i}\geq 2 for i1i\geq 1. In this paper we study MM-ary partition polynomials (pM(n,t))n=0(p_{M}(n,t))_{n=0}^{\infty} defined as the coefficient in the following power series expansion: \begin{align*} \prod_{i=0}^{\infty}\frac{1}{1-tq^{M_{i}}} = \sum_{n=0}^{\infty} p_{M}(n,t)q^{n}, \end{align*} where Mi=j=0imjM_{i}=\prod_{j=0}^{i}m_{j}. In particular, we provide a detailed description of their rational roots and show, that all their complex roots have absolute values not greater than 22. We also study arithmetic properties of MM-ary partition polynomials. One of our main results says that if n=a0+a1M1++akMkn=a_{0}+a_{1}M_{1}+\cdots +a_{k}M_{k} is a (unique) representation such that aj{0,,mj+11}a_{j}\in\{0,\ldots ,m_{j+1}-1\} for every jj, then \begin{align*} p_{M}(n,t)\equiv t^{a_{0}}\prod t^{a_{j}}f(a_{j}+1,t^{m_{j}-1}) \pmod{g_{k}(t)}, \end{align*} where f(a,t):=ta1t1f(a,t):=\frac{t^{a}-1}{t-1} and gk(t):=gcd(tm1+m21f(m2,tm11),,tmk+mk+11f(mk+1,tmk1))g_{k}(t):=\gcd \big(t^{m_{1}+m_{2}-1}f(m_{2},t^{m_{1}-1}),\ldots ,t^{m_{k}+m_{k+1}-1}f(m_{k+1},t^{m_{k}-1})\big). This is a polynomial generalisation of the well-known characterisation modulo mm of the sequence of mm-ary partition.

Cite

@article{arxiv.2403.07477,
  title  = {$M$-ary partition polynomials},
  author = {Błażej Żmija},
  journal= {arXiv preprint arXiv:2403.07477},
  year   = {2024}
}
R2 v1 2026-06-28T15:16:58.954Z