Generalized Chebyshev polynomials and Pell–Abel equation

In this paper the question of the compositional reducibility of generalized Chebyshev polynomials is solved by studying the combinatorial structure of plane trees. As a particular case we deduce the criterion of minimality of the solution of Pell–Abel equation corresponding to a given plane tree. Some other applications are also considered.