The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
From MaRDI portal
Publication:1199773
DOI10.1016/S0195-6698(05)80015-0zbMath0804.05023MaRDI QIDQ1199773
David M. Jackson, Ian P. Goulden
Publication date: 16 January 1993
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Related Items (49)
On the matchings-Jack conjecture for Jack connection coefficients indexed by two single part partitions ⋮ The Grassmann-Berezin calculus and theorems of the matrix-tree type ⋮ Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti ⋮ Combinatorial interpretation and positivity of Kerov's character polynomials ⋮ Mirror symmetry for extended affine Weyl groups ⋮ On the number of factorizations of a full cycle ⋮ Noncommutative symmetric functions and Lagrange inversion. II: Noncrossing partitions and the Farahat-Higman algebra ⋮ The topological symmetric orbifold ⋮ Enumeration of (uni- or bicolored) plane trees according to their degree distribution ⋮ A simple model of trees for unicellular maps ⋮ Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit bijective computation ⋮ \(k\)-indivisible noncrossing partitions ⋮ Finite free cumulants: Multiplicative convolutions, genus expansion and infinitesimal distributions ⋮ The chiral ring of a symmetric orbifold and its large \(N\) limit ⋮ Polynomial properties of Jack connection coefficients and generalization of a result by Dénes ⋮ On products of long cycles: short cycle dependence and separation probabilities ⋮ On products of permutations with the most uncontaminated cycles by designated labels ⋮ Braided open book decompositions in \(S^{3}\) ⋮ Stanley's character polynomials and coloured factorisations in the symmetric group ⋮ Counting trees using symmetries ⋮ Asymptotics of characters of symmetric groups related to Stanley character formula ⋮ Direct bijective computation of the generating series for 2 and 3-connection coefficients of the symmetric group ⋮ Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule ⋮ Minimum degree of the difference of two polynomials over~\({\mathbb Q}\), and weighted plane trees ⋮ On multiplicities of the Lyashko-Looijenga mapping on discriminant strata ⋮ Chamber behavior of double Hurwitz numbers in genus 0 ⋮ Dunkl kernel associated with dihedral groups ⋮ Enumeration of weighted plane trees ⋮ On decompositions of a cyclic permutation into a product of a given number of permutations ⋮ Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions ⋮ The alternating group generated by 3-cycles ⋮ Combinatorics of the categories of noncrossing partitions ⋮ Enumeration of almost polynomial rational functions with given critical values ⋮ Combinatorial Constructions for Integrals Over Normally Distributed Random Matrices ⋮ Class-sum products in the symmetric group: minimally-connected reduced class coefficients ⋮ A Differential Operator for Symmetric Functions and the Combinatorics of Multiplying Transpositions ⋮ A poset structure on the alternating group generated by 3-cycles ⋮ Unnamed Item ⋮ Parity patterns associated with lifts of Hecke groups. ⋮ Factorization problems in complex reflection groups ⋮ Enumeration of planar constellations ⋮ Enumeration of \(m\)-ary cacti ⋮ Transitive factorizations in the symmetric group, and combinatorial aspects of singularity theory ⋮ Towards the geometry of double Hurwitz numbers ⋮ Counting meromorphic functions with critical points of large multiplicities ⋮ Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit algebraic computation ⋮ Factorizations of cycles and multi-noded rooted trees ⋮ Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson ⋮ Cycle type factorizations in \(\mathrm{GL}_n \mathbb{F}_q\)
Cites Work
- Unnamed Item
- Unnamed Item
- On products of conjugacy classes of the symmetric group
- How many ways can a permutation be factored into two n-cycles?
- Nombre de représentations d'une permutation comme produit de deux cycles de longueurs données
- Factorization of permutations into n-cycles
- Some combinatorial problems associated with products of conjugacy classes of the symmetric group
- Counting Semiregular Permutations which are Products of a Full Cycle and and an Involution
- Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
- Decomposing a Permutation into Two Large Cycles: An Enumeration
- A Character Theoretic Approach to Embeddings of Rooted Maps in an Orientable Surface of Given Genus
- Character Theory and Rooted Maps in an Orientable Surface of Given Genus: Face-Colored Maps
- The Number of Planted Plane Trees with a Given Partition
This page was built for publication: The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
