arXiv Analytics

Sign in

arXiv:1112.0970 [math.CA]AbstractReferencesReviewsResources

Separation of variables and combinatorics of linearization coefficients of orthogonal polynomials

Mourad E. H. Ismail, Anisse Kasraoui, Jiang Zeng

Published 2011-12-05, updated 2012-11-18Version 2

We propose a new approach to the combinatorial interpretations of linearization coefficient problem of orthogonal polynomials. We first establish a difference system and then solve it combinatorially and analytically using the method of separation of variables. We illustrate our approach by applying it to determine the number of perfect matchings, derangements, and other weighted permutation problems. The separation of variables technique naturally leads to integral representations of combinatorial numbers where the integrand contains a product of one or more types of orthogonal polynomials. This also establishes the positivity of such integrals.

Comments: Journal of Combinatorial Theory, Series A 120 (2013) 561--599
Categories: math.CA, math.CO
Subjects: 33D15, 05A15, 30E05, C15
Related articles: Most relevant | Search more
arXiv:0809.1821 [math.CA] (Published 2008-09-10)
Abstract integration, Combinatorics of Trees and Differential Equations
arXiv:1308.6614 [math.CA] (Published 2013-08-29)
The sharp estimates on the orthogonal polynomials from the Steklov class
arXiv:0812.0726 [math.CA] (Published 2008-12-03)
Convexity of the zeros of some orthogonal polynomials and related functions