2017/02/15 by Quentin Lambotte, Lambotte, Quentin, Françoise Point +1
Mathematics · Computer Science · #Mathematical Dynamics and Fractals #Computability, Logic, AI Algorithms #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1702.04795
Call a (strictly increasing) sequence (rn) of natural numbers regular if it satisfies the following condition: rn+1/rn→θ∈ℝ>1∪\∞\ and, if θ is algebraic, then (rn) satisfies a linear recurrence relation whose characteristic polynomial is the minimal polynomial of θ. Our main result states that (ℤ,+,0,R) is superstable whenever R is enumerated by a regular sequence. We give two proofs of this result. One relies on a result of E. Casanovas and M. Ziegler and the other on a quantifier elimination result. We also show that (ℤ,+,0,1.