2000 character limit reached
Effective results on the Skolem Problem for linear recurrence sequences
Published 26 May 2015 in math.NT | (1505.07147v6)
Abstract: In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond which every term of the sequence is non-zero. It turns out that this case covers almost all such sequences whose coefficients are rational numbers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.