A simple proof of the Skolem-Mahler-Lech theorem

DOI10.1016/0304-3975(86)90168-4zbMath0605.10007OpenAlexW2068935383MaRDI QIDQ1084125

Georges Hansel

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90168-4

zbMATH Keywords

rational functionslinear recursive sequenceSkolem-Mahler-Lech theoremSkolem's p-adic method

Mathematics Subject Classification ID

Recurrences (11B37) Formal power series rings (13F25)

Related Items (14)

On the set of zero coefficients of a function satisfying a linear differential equation ⋮ Composition of quasi-polynomial maps ⋮ Formal power series and Hadamard product ⋮ Computational limitations of affine automata and generalized affine automata ⋮ Analyzing ultimate positivity for solvable systems ⋮ D0L sequence equivalence is inPfor fixed alphabets ⋮ On vanishing coefficients of algebraic power series over fields of positive characteristic ⋮ Algebraic independence over \(\mathbb Q_p\) ⋮ Explicit test sets for iterated morphisms in free monoids and metabelian groups ⋮ On the Images of ℕ-Rational Sequences Counting Multiplicities ⋮ On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond ⋮ On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond ⋮ On the values attained by a \(k\)-regular sequence ⋮ Support of an algebraic series as the range of a recursive sequence

Cites Work

• A note on recurring series
• On the definition of a family of automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A simple proof of the Skolem-Mahler-Lech theorem