[1] Bojanov, B. D., Proof of a conjecture of Erdös about the longest polynomial, Proc. Amer. Math. Soc., 84 (1982), 99-103.
[2] Chebyshev, P. L., Théorie des mécanismes connus sous le nom de parallélogrammes, Imprimerie de l’Académie impériale des sciences, 7 (1853), 539-568.
[3] Chebyshev, P. L., Sur les fonctions analogues à celles de Legendre, J. de l. Soc. phil. de Moscou, 4 (1869).
[4] Chebyshev, P. L., Sur les fonctions qui diffèrent le moins possible de zéro, Liouville J. (2), 19 (1874), 319-346.
[5] Chebyshev, 1 L., Gesammelte ٢011٥, 76. II., St. 11019. XX u. 736 gr. 8 ° mit zwei 10111215 (1907), 1907.
[6] Fateman, R. J., Lookup tables, recurrences and complexity, in Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, 1989, 68-73.
[7] Gelca, R., Andreescu, T., Putnam and Beyond, Cham, Springer, 2017.
[8] Karjanto, N., Properties of Chebyshev polynomials (2020), available at arXiv:2002.01342.
[9] Khovanskii, A., Topological Galois Theory, Solvability and Unsolvability of Equations in Finite Terms (transl. from the Russian), Springer Berlin, 2014.
[10] Koepf, W., Efficient computation of Chebyshev polynomials in computer algebra, in Computer Algebra Systems. A Practical Guide, M. J. Wester, ed., John Wiley & Sons, New York, 1999, 79-99.
[11] Lax, P. D., Linear algebra and Its Applications, Wiley, New York, 2007.
[12] Mason, J. C., Handscomb, D. C., Chebyshev Polynomials, Chapman & Hall/CRC, Boca Raton, 2003.
[13] Rivlin, T. J., Chebyshev Polynomials, From Approximation Theory to Algebra and Number Theory, John Wiley & Sons, New York, 1990.
[14] Spielman, D., Spectral and Algebraic Graph Theory, Yale Lecture Notes, Connecticut , 2019.
[15] Szczepański, J., Chebyshev polynomials and continued fractions related, Science, Technology and Innovation, 7 (2019), no. 4.
[16] Wayne, A., Fermat’s equation and Tshebysheff’s polynomials, Amer. Math. Monthly, 56 (1949), 626.
[17] Zapponi, L., Parametric solutions of Pell equations (2015), available at arXiv:1503.00637.
