Decomposition of a recursive family of polynomials (Q2471815)

The authors investigate the polynomials \(f_{0,B,a}(x)\) which are defined recurrently by \[ f_{0,B,a}(x)- B,\quad f_{1,B,a}(x)= x,\quad f_{n+1,B,a}(x)= xf_{n,B,a}(x)- af_{n-1,B,a}(x), \] where \(B\), \(a\) are rational numbers. They obtain some criteria on their decomposability and show how to apply these results to determine the finiteness of rational solutions of the Diophantine equation \(f_{n,B,a}(x)= f_{m,C,b}(y)\).