Diophantine Equations for Polynomial Recursive Sequences

Abstract

We study the Diophantine equation of type Un(x)=Vm(y), where (Un)n≥ 0 and (Vm)m≥ 0 are polynomial power sums defined over a number field K. By applying the finiteness criterion of Bilu and Tichy, we show under appropriate assumptions that equation Un(x)=Vm(y) has infinitely many solutions with bounded OS-denominator. We also study decomposable polynomials in third and second order linear recurrence sequences. In particular, we show that if Wn(x)=g(h(x)) for a simple third order linear recurrence sequence (Wn(x))n≥ 0 of complex polynomials, then deg g is bounded. Furthermore, we show that if (un1+un2)(x)=g(h(x)) for a binary recurrence sequence (un(x))n≥ 0 then deg g is bounded.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…