Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 2 Sep 2026 in math.NT and cs.LO | (2609.03127v1)

Abstract: Let RR be a commutative ring and f(a1,…,an)=∑i=1<sup>k</sup>ri1<sup>a1</sup>⋯rin<sup>an</sup>mif(a_1, \ldots, a_n) = \sum_{i=1}<sup>k</sup> r_{i1}<sup>{a_1}</sup> \cdots r_{in}<sup>{a_n}</sup> m_i be a linear-exponential map over an RR-module MM. Dong and Shafrir (2026) showed that, when ℓM=0\ell M = 0 for some $\ell \in \mathbb{N}_{&gt;0}$, the zero set of ff is the intersection of effectively computable pp-normal sets, where pp ranges over the prime divisors of ℓ\ell. This generalizes an earlier theorem of Derksen and Masser (2012) on the solution set of SS-unit equations over fields of positive characteristic. The purpose of this paper is twofold. First, we give a shorter proof of Dong and Shafrir's result, using the theorem of Derksen-Masser as a blackbox. Our proof also yields a decomposition of the zero set as a positive Boolean combination of affine transformations of zero sets of linear-exponential equations over fields. Second, we prove a multi-dimensional generalization of the Skolem-Mahler-Lech theorem over rings of finite characteristic. Specifically, we show that the zero set of every nn-dimensional linear recurrence sequence over an RR-module MM satisfying ℓM=0\ell M = 0 is the intersection of effectively computable pp-normal sets (in N<sup>n\mathbb{N}<sup>n), where pp ranges over the prime divisors of ℓ\ell. For example, this gives a decision procedure for whether two classical linear recurrence sequences have a common value over a ring of characteristic p<sup>ap<sup>a or p<sup>a</sup>q<sup>bp<sup>a</sup> q<sup>b, where pp and qq are primes.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.