Linearization and connection coefficients of polynomial sequences: A matrix approach
Abstract
For a sequence of polynomials \pk(t)\ in one real or complex variable, where pk has degree k, for k 0, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients d(n,m,k), called linearization coefficients, that satisfy pn(t) pm(t)=Σk=0n+m d(n,m,k) pk(t). For any pair of polynomial sequences \uk(t)\ and \pk(t)\ we find infinite matrices whose entries are the coefficients e(n,m,k) that satisfy pn(t) pm(t)=Σk=0n+m e(n,m,k) uk(t). Such results are obtained using a matrix approach. We also obtain recurrence relations for the linearization coefficients, apply the general results to general orthogonal polynomial sequences and to particular families of orthogonal polynomials such as the Chebyshev, Hermite, and Charlier families.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.