arXiv:1005.2696 [math.CO]AbstractReferencesReviewsResources
The Matrix Ansatz, Orthogonal Polynomials, and Permutations
Sylvie Corteel, Matthieu Josuat-Vergès, Lauren K. Williams
Published 2010-05-15Version 1
In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We illustrate this approach with applications to moments of orthogonal polynomials, permutations, signed permutations, and tableaux.
Comments: to appear in Advances in Applied Mathematics, special issue for Dennis Stanton
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2207.02719 [math.CO] (Published 2022-07-06)
A Three-parameter Family Of Involutions In The Riordan Group Defined By Orthogonal Polynomials
arXiv:0805.0588 [math.CO] (Published 2008-05-05)
Rational and algebraic series in combinatorial enumeration
arXiv:1303.3857 [math.CO] (Published 2013-03-15)
The number of {1243, 2134}-avoiding permutations