Table of Contents
Fetching ...

$M$-ary partition polynomials

Błażej Żmija

Abstract

Let $M=(m_{i})_{i=0}^{\infty}$ be a sequence of integers such that $m_{0}=1$ and $m_{i}\geq 2$ for $i\geq 1$. In this paper we study $M$-ary partition polynomials $(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 $M_{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 $2$. We also study arithmetic properties of $M$-ary partition polynomials. One of our main results says that if $n=a_{0}+a_{1}M_{1}+\cdots +a_{k}M_{k}$ is a (unique) representation such that $a_{j}\in\{0,\ldots ,m_{j+1}-1\}$ for every $j$, 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):=\frac{t^{a}-1}{t-1}$ and $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 $m$ of the sequence of $m$-ary partition.

$M$-ary partition polynomials

Abstract

Let be a sequence of integers such that and for . In this paper we study -ary partition polynomials 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 . In particular, we provide a detailed description of their rational roots and show, that all their complex roots have absolute values not greater than . We also study arithmetic properties of -ary partition polynomials. One of our main results says that if is a (unique) representation such that for every , 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 and . This is a polynomial generalisation of the well-known characterisation modulo of the sequence of -ary partition.
Paper Structure (6 sections, 24 theorems, 130 equations, 2 figures)

This paper contains 6 sections, 24 theorems, 130 equations, 2 figures.

Key Result

Lemma 1.1

Let $q$ be a power of a prime. Let $\mathbf{a}=(a_{n})_{n=0}^{\infty}$ be a sequence over $\mathbb{F}_{q}$. Then $\mathbf{a}$ is $q$-automatic if and only if its generating function is algebraic over $\mathbb{F}_{q}(x)$.

Figures (2)

  • Figure 1: All the roots of the polynomials $p_{4}(n,t)$ for $1\leq n\leq 400$.
  • Figure 2: All the roots of the polynomials $p_{5}(n,t)$ for $1\leq n\leq 500$.

Theorems & Definitions (52)

  • Lemma 1.1: Christol's Theorem
  • proof
  • Example 2.1
  • proof
  • proof
  • Lemma 3.1
  • proof
  • Theorem 3.2
  • proof
  • Theorem 3.3
  • ...and 42 more