Decomposable polynomials in second order linear recurrence sequences (Q2420667)

Let \( d\ge 2 \) be an integer. Consider a sequence of polynomials \( \{G_n\}_{n=0}^{\infty} \) in \( \mathbb{C}[x] \) satisfying the \( d \)-th order linear recurrence relation \[G_{n+d}(x)=A_{d-1}G_{n+d-1}(x)+\cdots+A_0(x)G_n(x), \quad n\in\mathbb{N} \] determined by \( A_0, A_1, \ldots, A_{d-1}\in \mathbb{C}[x] \) and the initial terms \( G_0, G_1, \ldots, G_{d-1} \in \mathbb{C}[x]\). A polynomial \( f\in\mathbb{C}[x] \) with \( \deg f>1 \) is said to be \textit{decomposable} if it can be written as the composition \( f(x)=(g\circ h)(x)=g(h(x)) \) with \( g,h\in \mathbb{C}[x] \) and \( \deg g, \deg h>1 \), and \textit{indecomposable} otherwise. In the paper under review, the authors study the elements of the second order linear recurrence sequences \( \{G_n\}_{n=0}^{\infty} \) of polynomials in \( \mathbb{C}[x] \) which are decomposable. That is \( G_n = g\circ h \) with \( g,h\in \mathbb{C}[x] \) and \( \deg g, \deg h>1 \). Under certain assumptions, and provided that \( h \) is indecomposable and neither dihedral nor cyclic, they show that \( \deg h \) may be bounded by a positive real constant independent of \( n \), depending only on the sequence. Some of the key tools involved in their proof include: the use of various properties of Chebyshev and Dickson polynomials, and the use of height functions in function fields.