Combinatorial Constructions for Integrals Over Normally Distributed Random Matrices

DOI10.2307/2160694zbMath0836.05076OpenAlexW4256019512MaRDI QIDQ4844409

David M. Jackson, Ian P. Goulden

Publication date: 26 March 1996

Full work available at URL: https://doi.org/10.2307/2160694

zbMATH Keywords

permutationspartitioneigenvaluesgroup algebrasymmetric groupconstructionsGelfand pairHecke algebraconnection coefficientswreath productcombinatorial structuresdisjoint cycle decompositionclass algebra

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of representation theory (05E10) Random matrices (algebraic aspects) (15B52)

Related Items (5)

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? ⋮ Connection coefficients, matchings, maps and combinatorial conjectures for Jack symmetric functions ⋮ \(\operatorname{GL}_n(\mathbb{F}_q)\)-analogues of factorization problems in the symmetric group ⋮ Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson

Cites Work

• The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
• Unnamed Item

This page was built for publication: Combinatorial Constructions for Integrals Over Normally Distributed Random Matrices