For little q-Jacobi polynomials, q-Hahn polynomials and big q-Jacobi polynomials we give particular q-hypergeometric series representations in which the termwise q = 0 limit can be taken. When rewritten in matrix form, these series representations can be viewed as decompositions into a lower triangular matrix times upper triangular matrix. We develop a general theory of such decompositions rela...

We use Young’s raising operators to introduce and study double eta polynomials, which are an even orthogonal analogue of Wilson’s double theta polynomials. Our double eta polynomials give Giambelli formulas which represent the equivariant Schubert classes in the torus-equivariant cohomology ring of even orthogonal Grassmannians, and specialize to the single eta polynomials of Buch, Kresch, and ...

This publication is an exercise which extends to two variables the Christoffel’s construction of orthogonal polynomials for potentials of one variable with external sources. We generalize the construction to biorthogonal polynomials. We also introduce generalized Schur polynomials as a set of orthogonal, symmetric, non homogeneous polynomials of several variables, attached to Young tableaux.

We obtain a property which characterizes the Chebyshev orthogonal polynomials of first, second, third, and fourth kind. Indeed, we prove that the four Chebyshev sequences are the unique classical orthogonal polynomial families such that their linear combinations, with fixed length and constant coefficients, can be orthogonal polynomial sequences. 1. Introduction The classical orthogonal polynom...

An overview is given for classical orthogonal polynomials as moments for other classical orthogonal polynomials. Some combinatorial explanations and open problems are discussed.

We obtain an extension of the Christoffel–Darboux formula for matrix orthogonal polynomials with a generalized Hankel symmetry, including the Adler-van Moerbeke generalized orthogonal polynomials.

New criteria for nonnegativity of connection coefficients between to systems of orthogonal polynomials are given. The results apply to classical orthogonal polynomials.

We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the higher-order matching polynomial corresponds to coverings by paths. Several families of classical orthogonal polynomials—the Chebyshev, Hermite, and Laguerre poly...

Skew orthogonal polynomials arise in the calculation of the n-point distribution function for the eigenvalues of ensembles of random matrices with orthogonal or symplectic symmetry. In particular, the distribution functions are completely determined by a certain sum involving the skew orthogonal polynomials. In the cases that the eigenvalue probability density function involves a classical weig...

The zeros of certain different sequences of orthogonal polynomials interlace in a well-defined way. The study of this phenomenon and the conditions under which it holds lead to a set of points that can be applied as bounds for the extreme zeros of the polynomials. We consider different sequences of the discrete orthogonal Meixner and Kravchuk polynomials and use mixed three term recurrence rela...