Diophantine equations between polynomials obeying second order recurrences (Q2567397)

This paper is mainly inspired by and based on the paper of \textit{Y.~Bilu and R. F.~Tichy} [Acta Arith. 95, 261--288 (2000; Zbl 0958.11049)]. It focuses on special equations \(f(x)=g(y)\) which arise, for example, from combinatorial problems. These equations are defined as follows: For \(n=-1,0,1,\ldots\) define recursively the polynomial \(P_n(x)\) by \(P_{-1}(x)=0\), \(P_0(x)=1\) and \(P_{n+1}(x)=xP_n(x)+c_nP_{n-1}(x)\) for \(n\geq 0\); here \(c_n\), \(n=0,1,\ldots\) is an arbitrary sequence of rational numbers. The equation under consideration is \(P_n(x)=P_m(y)\), where \(m,n\geq 2\) and \(m\neq n\). The authors prove a sufficient condition -- somewhat technical to be stated here -- for the existence of at most finitely many integer solutions \((x,y)\) to this equation. As corollaries, they note that their sufficient condition is satisfied, for example, when \(c_n=B\) for every \(n\) or when \(c_n=nB\) for every \(n\) where, in both cases, \(B\) is a positive constant.