Duality of orthogonal polynomials on a finite set
classification
🧮 math.CA
math.PR
keywords
orthogonaldualityfinitepolynomialscertaincomputingcorrelationdefined
read the original abstract
We prove a certain duality relation for orthogonal polynomials defined on a finite set. The result is used in a direct proof of the equivalence of two different ways of computing the correlation functions of a discrete orthogonal polynomial ensemble.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.