Answers are grounded in this paper and cite their sources.
We study elements of second order linear recurrence sequences (Gₙ)n= 0∞ of polynomials in C[x] which are decomposable, i.e. representable as Gₙ=g∘ h for some g, h∈ C[x] satisfying g, h>1 . Under certain assumptions, and provided that h is not of particular type, we show that g may be bounded by a constant independent of n, depending only on the sequence.
No takes yet. Share an insight, caveat, or question.
Fuchs et al. (2018) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: