Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit algebraic computation

DOI10.1016/j.disc.2015.04.005zbMath1311.05208OpenAlexW2070811009MaRDI QIDQ2344790

Ekaterina A. Vassilieva

Publication date: 18 May 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.04.005

zbMATH Keywords

random matricesconnection coefficientszonal polynomialsdouble coset algebraclass algebra

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10)

Related Items

Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit bijective computation

Cites Work

• On the number of factorizations of a full cycle
• The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
• Factoring \(n\)-cycles and counting maps of given genus
• Shifted Jack polynomials, binomial formula, and applications
• An analytic formula for Macdonald polynomials
• Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle)
• Factorizations of large cycles in the symmetric group
• Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit bijective computation
• Some combinatorial properties of Jack symmetric functions
• Connection coefficients, matchings, maps and combinatorial conjectures for Jack symmetric functions
• The Poset of Conjugacy Classes and Decomposition of Products in the Symmetric Group
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item