The Matrix Ansatz, Orthogonal Polynomials, and Permutations

DSpace/Manakin Repository

The Matrix Ansatz, Orthogonal Polynomials, and Permutations

Citable link to this page

 

 
Title: The Matrix Ansatz, Orthogonal Polynomials, and Permutations
Author: Corteel, Sylvie; Josuat-Vergès, Matthieu; Williams, Lauren

Note: Order does not necessarily reflect citation order of authors.

Citation: Corteel, Sylvie, Josuat-Vergès, Matthieu, and Lauren K. Williams. 2011. The Matrix Ansatz, orthogonal polynomials, and permutations. Advances in Applied Mathematics 46(1-4): 209–225.
Full Text & Related Files:
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.
Published Version: doi:10.1016/j.aam.2010.04.009
Other Sources: http://arxiv.org/abs/1005.2696
Terms of Use: This article is made available under the terms and conditions applicable to Open Access Policy Articles, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#OAP
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:8316218
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)

 
 

Search DASH


Advanced Search
 
 

Submitters