arXiv math/05105832005-10-27math.NTmath.AC

A Skolem-Mahler-Lech Theorem in Positive Characteristic and Finite Automata

Harm Derksen

备注：: 43 pages

英文摘要：

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.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Mordell-Lang and Skolem-Mahler-Lech theorems for endomorphisms of semiabelian varieties

Using the Skolem-Mahler-Lech theorem, we prove a dynamical Mordell-Lang conjecture for semiabelian varieties.

2008-06-23math.AGmath.NT

A generalised Skolem-Mahler-Lech theorem for affine varieties

The Skolem-Mahler-Lech theorem states that if $f(n)$ is a sequence given by a linear recurrence over a field of characteristic 0,then the set of $m$ such that $f(m)$ is equal to 0 is the union of a finite number of arithmetic progressions in $m\ge 0$ and a finite set. We prove that if $X$ is a subvariety of an affine variety $Y$ over a field of characteristic 0 and ${\bf q}$ is a point in $Y$, and $σ$ is an automorphism of $Y$, then the set of $m$ such that $σ^m({\bf q})$ lies in $X$ is a union of a finite number of complete doubly-infinite arithmetic progressions and a finite set. We show tha…

2007-09-15math.AGmath.NT

Skolem-Mahler-Lech定理中的伪有效性

Pseudo-Effectivity in the Skolem-Mahler-Lech Theorem

Institut de Recherche en Informatique Fondamentale（基础信息学研究所）

本文提出伪有效方法，证明Skolem-Mahler-Lech定理的有限性在低高度扰动下仍成立，并为线性轨道建立移动目标有限性结果。

2026-09-29math.NT

A Skolem-Mahler-Lech theorem for iterated automorphisms of $K$-algebras

This paper proves a commutative algebraic extension of a generalized Skolem-Mahler-Lech theorem due to the first author. Let $A$ be a finitely generated commutative $K$-algebra over a field of characteristic $0$, and let $σ$ be a $K$-algebra automorphism of $A$. Given ideals $I$ and $J$ of $A$, we show that the set $S$ of integers $m$ such that $σ^m(I) \supseteq J$ is a finite union of complete doubly infinite arithmetic progressions in $m$, up to the addition of a finite set. Alternatively, this result states that for an affine scheme $X$ of finite type over $K$, an automorphism $σ\in {\rm Au…

2013-12-18math.ACmath.AGmath.DS

A Euclidean Skolem-Mahler-Lech-Chabauty method

Using the theory of o-minimality we show that the $p$-adic method of Skolem-Mahler-Lech-Chabauty may be adapted to prove instances of the dynamical Mordell-Lang conjecture for some real analytic dynamical systems. For example, we show that if $f_1,...,f_n$ is a finite sequence of real analytic functions $f_i:(-1,1) \to (-1,1)$ for which $f_i(0) = 0$ and $|f_i'(0)| \leq 1$ (possibly zero), $a = (a_1,...,a_n)$ is an $n$-tuple of real numbers close enough to the origin and $H(x_1,...,x_n)$ is a real analytic function of $n$ variables, then the set $\{m \in {\mathbb N} : H (f_1^{\circ m} (a_1),...…

2010-10-04math.AGmath.DSmath.LO

Skolem Meets Schanuel

The celebrated Skolem-Mahler-Lech Theorem states that the set of zeros of a linear recurrence sequence is the union of a finite set and finitely many arithmetic progressions. The corresponding computational question, the Skolem Problem, asks to determine whether a given linear recurrence sequence has a zero term. Although the Skolem-Mahler-Lech Theorem is almost 90 years old, decidability of the Skolem Problem remains open. The main contribution of this paper is an algorithm to solve the Skolem Problem for simple linear recurrence sequences (those with simple characteristic roots). Whenever th…

2022-04-28cs.LOmath.NT

更多相关论文收起更多论文

正特征环上的Skolem-Mahler-Lech定理：更简短的证明与多维推广

Skolem-Mahler-Lech in rings of positive characteristic: a shorter proof and a multi-dimensional generalization

Magdalen College, University of Oxford（牛津大学莫德林学院）；Department of Mathematics, Ben-Gurion University of the Negev（内盖夫本-古里安大学数学系）

本文给出正特征环上Dong与Shafrir结果的更简短证明，并将Skolem-Mahler-Lech定理推广至多维线性递推序列，为相关问题提供判定方法。

2026-09-04cs.LOmath.NT

线性递推序列的扭曲有理零点与局部-全局原理

Twisted Rational Zeros and Local-Global Principles for Linear Recurrence Sequences

University of Oxford, UK（英国牛津大学）；Max Planck Institute for Software Systems, Saarland Informatics Campus, Germany（德国萨尔兰信息校园马克斯·普朗克软件研究所）

本文研究线性递推序列的Skolem猜想，通过扭曲有理零点与p-adic零点的关系，在p-adic Schanuel猜想下证明了两个互素LRS同时零点的局部-全局原理，并回答了相关开放问题。

2026-09-16cs.FLmath.NT

Algebraic Degree Periodicity in Recurrence Sequences

The degree sequence of the algebraic numbers in an algebraic linear recurrence sequence is shown to be virtually periodic. This is proved using the Skolem-Mahler-Lech theorem. It has applications to the degree sequence and the minimal polynomial sequence for exponential sums over finite fields. The degree periodicity also holds for some more complicated non-linear recurrence sequences. We give one example from the iterations of a polynomial map. This depending on the dynamic Mordell-Lang conjecture which has been proved in some cases.

2020-09-30math.NT

Effective formulas for linear recurrence sequences of integers

We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be deduced from the Skolem-Mahler-Lech theorem and the Subspace Theorem. We will give details of this deduction that is due to P. Corvaja in the full version of this extended abstract.

2020-02-27math.COmath.NT

On vanishing coefficients of algebraic power series over fields of positive characteristic

Let $K$ be a field of characteristic $p>0$ and let $f(t_1,...,t_d)$ be a power series in $d$ variables with coefficients in $K$ that is algebraic over the field of multivariate rational functions $K(t_1,...,t_d)$. We prove a generalization of both Derksen's recent analogue of the Skolem-Mahler-Lech theorem in positive characteristic and a classical theorem of Christol, by showing that the set of indices $(n_1,...,n_d)\in \mathbb{N}^d$ for which the coefficient of $t_1^{n_1}...t_d^{n_d}$ in $f(t_1,...,t_d)$ is zero is a $p$-automatic set. Applying this result to multivariate rational functions …

2012-05-18math.NT

On the set of zero coefficients of a function satisfying a linear differential equation

Let $K$ be a field of characteristic zero and suppose that $f:\mathbb{N}\to K$ satisfies a recurrence of the form $$f(n)\ =\ \sum_{i=1}^d P_i(n) f(n-i),$$ for $n$ sufficiently large, where $P_1(z),...,P_d(z)$ are polynomials in $K[z]$. Given that $P_d(z)$ is a nonzero constant polynomial, we show that the set of $n\in \mathbb{N}$ for which $f(n)=0$ is a union of finitely many arithmetic progressions and a finite set. This generalizes the Skolem-Mahler-Lech theorem, which assumes that $f(n)$ satisfies a linear recurrence. We discuss examples and connections to the set of zero coefficients of a …

2011-05-30math.COmath.NT

On nearly linear recurrence sequences

A nearly linear recurrence sequence (nlrs) is a complex sequence $(a_n)$ with the property that there exist complex numbers $A_0$,$\ldots$, $A_{d-1}$ such that the sequence $\big(a_{n+d}+A_{d-1}a_{n+d-1}+\cdots +A_0a_n\big)_{n=0}^{\infty}$ is bounded. We give an asymptotic Binet-type formula for such sequences. We compare $(a_n)$ with a natural linear recurrence sequence (lrs) $(\tilde{a}_n)$ associated with it and prove under certain assumptions that the difference sequence $(a_n- \tilde{a}_n)$ tends to infinity. We show that several finiteness results for lrs, in particular the Skolem-Mahler…

2016-07-29math.NTmath.OC

F-sets and finite automata

The classical notion of a k-automatic subset of the natural numbers is here extended to that of an F-automatic subset of an arbitrary finitely generated abelian group $Γ$ equipped with an arbitrary endomorphism F. This is applied to the isotrivial positive characteristic Mordell-Lang context where F is the Frobenius action on a commutative algebraic group G over a finite field, and $Γ$ is a finitely generated F-invariant subgroup of G. It is shown that the F-subsets of $Γ$ introduced by the second author and Scanlon are F-automatic. It follows that when G is semiabelian and X is a closed subva…

2019-07-08math.LOmath.NT