# zbMATH — the first resource for mathematics

Chebyshev polynomials, Catalan numbers, and tridiagonal matrices. (English. Russian original) Zbl 1446.39001
Theor. Math. Phys. 204, No. 1, 837-842 (2020); translation from Teor. Mat. Fiz. 203, No. 1, 3-9 (2020).
Summary: We establish a relation between linear second-order difference equations corresponding to Chebyshev polynomials and Catalan numbers. The latter are the limit coefficients of a converging series of rational functions corresponding to the Riccati equation. As the main application, we show a relation between the polynomials $$\varphi_n(\mu)$$ that are solutions of the problem of commutation of a tridiagonal matrix with the simplest Vandermonde matrix and Chebyshev polynomials.
##### MSC:
 39A06 Linear difference equations 47B36 Jacobi (tridiagonal) operators (matrices) and generalizations
##### Keywords:
Chebyshev polynomial; tridiagonal matrix
Full Text:
##### References:
 [1] Mason, J. C.; Handscomb, D. C., Chebyshev Polynomials (2003), Boca Raton, Fla.: CRC Press, Boca Raton, Fla. [2] Grünbaum, A., The eigenvectors of the discrete Fourier transform: A version of the Hermite functions, J. Math. Anal. Appl., 88, 355-363 (1982) · Zbl 0516.65099 [3] Veselov, A. P., Toda chain and linear algebra [in Russian], Geometric Methods in Mathematical Physics, 0, 5-30 (2012) [4] Malozemov, V. N.; Masharskii, S. M., Foundations of Discrete Harmonic Analysis (2012), St. Petersburg: Lan’, St. Petersburg [5] Burlankov, D. E.; Kuznetsov, M. I.; Chirkov, A. Yu.; Yakovlev, V. A., Computer Algebra (2002), Nizhny Novgorod: Nizhegorod State Univ. Press, Nizhny Novgorod [6] Artisevich, A. E.; Shabat, A. B., Three theorems on Vandermonde matrices [in Russian], Vladikavk. Matem. Zhurn., 22, 5-22 (2020)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.