A Polynomial Variant of Diophantine Triples in Linear Recurrences
Abstract
Let (Gn)n=0∞ be a polynomial power sum, i.e. a simple linear recurrence sequence of complex polynomials with power sum representation Gn = f1α1n + ·s + fkαkn and polynomial characteristic roots α1,…,αk . For a fixed polynomial p , we consider triples (a,b,c) of pairwise distinct non-zero polynomials such that ab+p, ac+p, bc+p are elements of (Gn)n=0∞ . We will prove that under a suitable dominant root condition there are only finitely many such triples if neither f1 nor f1 α1 is a perfect square.
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.