A Skolem-Mahler-Lech theorem in positive characteristic and finite automata

From MaRDI portal
Publication:2457768

DOI10.1007/S00222-006-0031-0zbMATH Open1205.11030arXivmath/0510583OpenAlexW1992173352MaRDI QIDQ2457768FDOQ2457768


Authors: Harm Derksen Edit this on Wikidata


Publication date: 23 October 2007

Published in: Inventiones Mathematicae (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/math/0510583




Recommendations




Cites Work


Cited In (23)





This page was built for publication: A Skolem-Mahler-Lech theorem in positive characteristic and finite automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457768)