Linear-exponent bounds for the automatic complexity of rational diagonals modulo prime powers
Let $p$ be a prime and let $G$ be the diagonal of $N/Q$ in $m$ variables over the $p$-adic integers, with $Q(0)$ a unit. We prove that the $p$-kernel of the coefficients of $G$ modulo $p^\alpha$ has size $K_\alpha(G)\le p^{(|J|+1)\alpha-1}+(p^\alpha-1)/(p-1)$, where $J$ is an explicit finite support set determined by t...