English

Diophantine Equations for Polynomial Recursive Sequences

Number Theory 2025-12-24 v1

Abstract

We study the Diophantine equation of type Un(x)=Vm(y)U_n(x)=V_m(y), where (Un)n0(U_n)_{n\geq 0} and (Vm)m0(V_m)_{m\geq 0} are polynomial power sums defined over a number field KK. By applying the finiteness criterion of Bilu and Tichy, we show under appropriate assumptions that equation Un(x)=Vm(y)U_n(x)=V_m(y) has infinitely many solutions with bounded OS\mathcal{O}_S-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))W_n(x)=g(h(x)) for a simple third order linear recurrence sequence (Wn(x))n0(W_n(x))_{n\geq 0} of complex polynomials, then deg gg is bounded. Furthermore, we show that if (un1+un2)(x)=g(h(x))(u_{n_1}+u_{n_2})(x)=g(h(x)) for a binary recurrence sequence (un(x))n0(u_n(x))_{n\geq 0} then deg gg is bounded.

Keywords

Cite

@article{arxiv.2512.20384,
  title  = {Diophantine Equations for Polynomial Recursive Sequences},
  author = {Darsana N and Sudhansu Sekhar Rout},
  journal= {arXiv preprint arXiv:2512.20384},
  year   = {2025}
}

Comments

24 pages

R2 v1 2026-07-01T08:38:36.837Z