Papers
Topics
Authors
Recent
Search
2000 character limit reached

On recurrence coefficients of classical orthogonal polynomials

Published 28 Jul 2025 in math.GM | (2507.20646v1)

Abstract: In Lett. Math. Phys. 114, 54 (2024) and 115, 70 (2025), the author introduces what is presented as a novel method for determining whether a sequence of orthogonal polynomials is "classical", based solely on its initial recurrence coefficients. This note demonstrates that all the results contained in those works are already encompassed by two general theorems previously established in J. Math. Anal. Appl. 515 (2022), Article 126390. A symbolic algorithm, implemented in Mathematica, is also provided to enable automated verification of the classical character of orthogonal polynomial sequences on quadratic lattices. As an application, it is shown that the so-called para-Krawtchouk polynomials on bi-lattices, discussed in Lett. Math. Phys. 115, 70 (2025), constitute a particular instance of a classical orthogonal family on a linear lattice. Consequently, their algebraic properties follow as a specific case of one of the main theorems established in J. Math. Anal. Appl. 515 (2022), Article 126390.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We found no open problems mentioned in this paper.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.