Abstract
We characterize decomposition over C of polynomials f n ( a , B ) ( x ) defined by the generalized Dickson-type recursive relation ( n ⩾ 1 ) f 0 ( a , B ) ( x ) = B , f 1 ( a , B ) ( x ) = x , f n + 1 ( a , B ) ( x ) = x f n ( a , B ) ( x ) − a f n − 1 ( a , B ) ( x ) , where B , a ∈ Q or R . As a direct application of the uniform decomposition result, we fully settle the finiteness problem for the Diophantine equation f n ( a , B ) ( x ) = f m ( a ˆ , B ˆ ) ( y ) . This extends and completes work of Dujella/Tichy and Dujella/Gusić concerning Dickson polynomials of the second kind. The method of the proof involves a new sufficient criterion for indecomposability of polynomials with fixed degree of the right component.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
