Fundamentalʹnaâ i prikladnaâ matematika, Tome 7 (2001) no. 4, pp. 1123-1145
Citer cet article
A. V. Pastor. Generalized Chebyshev polynomials and Pell–Abel equation. Fundamentalʹnaâ i prikladnaâ matematika, Tome 7 (2001) no. 4, pp. 1123-1145. http://geodesic.mathdoc.fr/item/FPM_2001_7_4_a9/
@article{FPM_2001_7_4_a9,
author = {A. V. Pastor},
title = {Generalized {Chebyshev} polynomials and {Pell{\textendash}Abel} equation},
journal = {Fundamentalʹna\^a i prikladna\^a matematika},
pages = {1123--1145},
year = {2001},
volume = {7},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/FPM_2001_7_4_a9/}
}
TY - JOUR
AU - A. V. Pastor
TI - Generalized Chebyshev polynomials and Pell–Abel equation
JO - Fundamentalʹnaâ i prikladnaâ matematika
PY - 2001
SP - 1123
EP - 1145
VL - 7
IS - 4
UR - http://geodesic.mathdoc.fr/item/FPM_2001_7_4_a9/
LA - ru
ID - FPM_2001_7_4_a9
ER -
%0 Journal Article
%A A. V. Pastor
%T Generalized Chebyshev polynomials and Pell–Abel equation
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 2001
%P 1123-1145
%V 7
%N 4
%U http://geodesic.mathdoc.fr/item/FPM_2001_7_4_a9/
%G ru
%F FPM_2001_7_4_a9
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.
