A simple proof of the Skolem-Mahler-Lech theorem (Q1084125): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3691074 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4079524 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on recurring series / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3231261 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4760981 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the definition of a family of automata / rank | |||
Normal rank |
Latest revision as of 16:26, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A simple proof of the Skolem-Mahler-Lech theorem |
scientific article |
Statements
A simple proof of the Skolem-Mahler-Lech theorem (English)
0 references
1986
0 references
The author gives a simple proof of the following theorem, due to Skolem, Mahler, Lech: given a sequence \((a_n)\) which satisfies a linear recursion over a field of characteristic 0, the set \(\{n\in \mathbb{N}\mid a_n=0\}\) is ultimately periodic. The usual proofs use \(p\)-adic analysis. The proof of the author is elementary and self-contained.
0 references
Skolem-Mahler-Lech theorem
0 references
Skolem's p-adic method
0 references
linear recursive sequence
0 references
rational functions
0 references