Combinatorial Constructions for Integrals Over Normally Distributed Random Matrices
DOI10.2307/2160694zbMATH Open0836.05076OpenAlexW4256019512MaRDI QIDQ4844409FDOQ4844409
Authors: David M. Jackson, I. P. Goulden
Publication date: 26 March 1996
Full work available at URL: https://doi.org/10.2307/2160694
Recommendations
- scientific article; zbMATH DE number 431552
- On the Diaconis-Shahshahani method in random matrix theory
- Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit bijective computation
- Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit algebraic computation
- Cumulants for random matrices as convolutions on the symmetric group. II
permutationseigenvaluespartitionHecke algebrasymmetric groupconstructionsGelfand pairgroup algebraconnection coefficientswreath productcombinatorial structuresdisjoint cycle decompositionclass algebra
Random matrices (algebraic aspects) (15B52) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of representation theory (05E10) Combinatorial aspects of partitions of integers (05A17)
Cites Work
Cited In (7)
- Connection coefficients, matchings, maps and combinatorial conjectures for Jack symmetric functions
- Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson
- Title not available (Why is that?)
- \(\operatorname{GL}_n(\mathbb{F}_q)\)-analogues of factorization problems in the symmetric group
- A graphical calculus for integration over random diagonal unitary matrices
- Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit bijective computation
- How many zeros of a random polynomial are real?
This page was built for publication: Combinatorial Constructions for Integrals Over Normally Distributed Random Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4844409)