Decomposable polynomials in second order linear recurrence sequences
Abstract
We study elements of second order linear recurrence sequences (Gn)n= 0∞ of polynomials in C[x] which are decomposable, i.e. representable as Gn=g h for some g, h∈ C[x] satisfying degg,degh>1. Under certain assumptions, and provided that h is not of particular type, we show that degg may be bounded by a constant independent of n, depending only on the sequence.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.