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

DOI10.1007/s00026-017-0356-yzbMath1375.05013OpenAlexW2731686496WikidataQ114231912 ScholiaQ114231912MaRDI QIDQ1684294

Ekaterina A. Vassilieva

Publication date: 8 December 2017

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-017-0356-y

zbMATH Keywords

random matricesconnection coefficientsdouble coset algebralocally orientable hypermaps

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Related Items (2)

Calculating the Euler characteristic of the moduli space of curves ⋮ Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit algebraic computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple model of trees for unicellular maps
• An analogue of the Harer-Zagier formula for unicellular maps on general surfaces
• On the number of factorizations of a full cycle
• A bijective proof of Jackson's formula for the number of factorizations of a cycle
• The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
• Factoring \(n\)-cycles and counting maps of given genus
• Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle)
• Factorizations of large cycles in the symmetric group
• The Euler characteristic of the moduli space of curves
• Some combinatorial problems associated with products of conjugacy classes of the symmetric group
• Bijective enumeration of 3-factorizations of an \(N\)-cycle
• Direct bijective computation of the generating series for 2 and 3-connection coefficients of the symmetric group
• Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit algebraic computation
• A direct bijection for the Harer-Zagier formula
• Démonstration combinatoire de la formule de Harer–Zagier
• Differential Operators on a Semisimple Lie Algebra
• The planar approximation. II
• Combinatorial Constructions for Integrals Over Normally Distributed Random Matrices
• Connection coefficients, matchings, maps and combinatorial conjectures for Jack symmetric functions
• Maps in Locally Orientable Surfaces, the Double Coset Algebra, and Zonal Polynomials
• The Poset of Conjugacy Classes and Decomposition of Products in the Symmetric Group

This page was built for publication: Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit bijective computation