Semantic Scholar uses AI to extract papers important to this topic.
A nearly linear recurrence sequence (nlrs) is a complex sequence (an) with the property that there exist complex numbers A0… (More)
— Let K be a field of characteristic p > 0 and let f(t1, . . . , td) be a power series in d variables with coefficients in K that… (More)
A sequence of rational functions in a variable q is q-holonomic if it satisfies a linear recursion with coefficients polynomials… (More)
Motivated by the famous Skolem-Mahler-Lech theorem we initiate in this paper the study of a natural class of determinantal… (More)
We improve by one exponential W. M. Schmidt’s estimate for the Skolem-Mahler-Lech theorem on the number of arithmetic… (More)
The Skolem-Mahler-Lech theorem states that if f(n) is a sequence given by a linear recurrence over a field of characteristic 0… (More)
Using the Skolem-Mahler-Lech theorem, we prove a dynamical Mordell-Lang conjecture for semiabelian 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… (More)
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… (More)