Duality of orthogonal polynomials on a finite set

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.

AMSTeX, 9 pages

References in corpus (5)

• Determinantal random point fields
• Z-Measures on partitions, Robinson-Schensted-Knuth correspondence, and beta=2 random matrix ensembles
• Orthogonal polynomials, a short introduction
• Non-intersecting Paths, Random Tilings and Random Matrices
• Discrete orthogonal polynomial ensembles and the Plancherel measure

Cited by in corpus (6)

• How to construct spin chains with perfect state transfer
• The ASEP and determinantal point processes
• Asymptotic domino statistics in the Aztec diamond
• Classical Sturmian sequences
• A note on $\mathfrak{su}(2)$ models and the biorthogonality of generating functions of Krawtchouk polynomials
• Ramanujan's trigonometric sums and para-orthogonal polynomials on the unit circle