A Skolem-Mahler-Lech Theorem in Positive Characteristic and Finite Automata
classification
🧮 math.NT
math.AC
keywords
characteristicpositivefiniteskolem-mahler-lechtheoremautomatalechrecurrence
read the original abstract
Lech proved in 1953 that the set of zeroes of a linear recurrence sequence in a field of characteristic 0 is the union of a finite set and finitely many infinite arithmetic progressions. This result is known as the Skolem-Mahler-Lech theorem. Lech gave a counterexample to a similar statement in positive characteristic. We will present some more pathological examples. We will state and prove a correct analog of the Skolem-Mahler-Lech theorem in positive characteristic. The zeroes of a recurrence sequence in positive characteristic can be described using finite automata.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.