Combinatorial constructions for integrals over normally distributed random matrices
HTML articles powered by AMS MathViewer
- by I. P. Goulden and D. M. Jackson PDF
- Proc. Amer. Math. Soc. 123 (1995), 995-1003 Request permission
Abstract:
Recent results of Hanlon, Stanley, and Stembridge give the expected values of certain functions of matrices of normal variables in the real and complex cases. They point out that in both cases the results are equivalent to combinatorial results and suggest further that these results may have purely combinatorial proofs, in this way avoiding the use of the theory of spherical functions. Such proofs are given in this paper. In the complex case we use the familiar cycle decomposition for permutations. In the real case we introduce an analogous decomposition into cyclically ordered sequences, called chains, which makes the real and complex cases strikingly similar.References
- I. P. Goulden and D. M. Jackson, The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group, European J. Combin. 13 (1992), no. 5, 357–365. MR 1181077, DOI 10.1016/S0195-6698(05)80015-0
- Philip J. Hanlon, Richard P. Stanley, and John R. Stembridge, Some combinatorial aspects of the spectra of normally distributed random matrices, Hypergeometric functions on domains of positivity, Jack polynomials, and applications (Tampa, FL, 1991) Contemp. Math., vol. 138, Amer. Math. Soc., Providence, RI, 1992, pp. 151–174. MR 1199126, DOI 10.1090/conm/138/1199126
Additional Information
- © Copyright 1995 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 123 (1995), 995-1003
- MSC: Primary 05E05; Secondary 20B30, 60E99, 62H10
- DOI: https://doi.org/10.1090/S0002-9939-1995-1249878-0
- MathSciNet review: 1249878