arXiv · 2510.01440
Cobham's theorem for the Gaussian integers
Abstract
Assuming the four exponentials conjecture, Hansel and Safer showed that if a subset $S$ of the Gaussian integers is both $\alpha=-m+i $- and $\beta=-n+i$-recognizable, then it is syndetic, and they conjectured that $S$ must be eventually periodic. Without assuming the four exponentials conjecture, we show that if $\alpha$ and $\beta$ are multiplicatively independent Gaussian integers, and at least one of $\alpha$, $\beta$ is not an $n$-th root of an integer, then any $\alpha$- and $\beta$-automatic configuration is eventually periodic; in particular we prove Hansel and Safer's conjecture. Otherwise, there exist non-eventually periodic configurations which are $\alpha$-automatic for any root of an integer $\alpha$. Our work generalises the Cobham-Semenov theorem to Gaussian numerations.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Álvaro Bustos-Gajardo, Robbert Fokkink, Reem Yassawi. 2025-10-01. Cobham's theorem for the Gaussian integers. https://arxiv.org/abs/2510.01440
Cite the original work for its findings. Save a collection to share your selection of sources.