The Matrix Ansatz, Orthogonal Polynomials, and Permutations
Combinatorics
2021-01-26 v1
Abstract
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.
Cite
@article{arxiv.1005.2696,
title = {The Matrix Ansatz, Orthogonal Polynomials, and Permutations},
author = {Sylvie Corteel and Matthieu Josuat-Vergès and Lauren K. Williams},
journal= {arXiv preprint arXiv:1005.2696},
year = {2021}
}
Comments
to appear in Advances in Applied Mathematics, special issue for Dennis Stanton