Algebraic power series and their automatic complexity II: modulo prime powers
<|reference_start|>Algebraic power series and their automatic complexity II: modulo prime powers: Christol and, independently, Denef and Lipshitz showed that an algebraic sequence of $p$-adic integers (or integers) is $p$-automatic when reduced modulo $p^\alpha$. Previously, the best known bound on the minimal automaton size for such a sequence was doubly exponential in $\alpha$. We improve this bound to the order of $p^{\alpha^3 h d}$, where $h$ and $d$ are the height and degree of the minimal annihilating polynomial modulo $p$. We achieve this bound by showing that all states in the automaton are naturally represented in a new numeration system. This significantly restricts the set of possible states. Since our approach embeds algebraic sequences as diagonals of rational functions, we also obtain bounds more generally for diagonals of multivariate rational functions.<|reference_end|>
@article{rowland2024algebraic,
    title={Algebraic power series and their automatic complexity II: modulo prime
  powers},
    author={Eric Rowland, Reem Yassawi},
    journal={arXiv preprint arXiv:2408.00750},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.00750},
    primaryClass={math.NT cs.FL cs.SC}
}