Factoring \(n\)-cycles and counting maps of given genus

From MaRDI portal
Publication:1272787

DOI10.1006/eujc.1998.0215zbMath0915.05007OpenAlexW2028897994MaRDI QIDQ1272787

Gilles Schaeffer, Alain Goupil

Publication date: 22 March 1999

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

Full work available at URL: https://doi.org/10.1006/eujc.1998.0215




Related Items

A general framework for the polynomiality property of the structure coefficients of double-class algebrasEXPLICIT EXPRESSION FOR THE PRODUCT OF THE CLASS OF TWO TRANSPOSITIONS WITH THE CLASS OF CYCLES OF LENGTH kOn the matchings-Jack conjecture for Jack connection coefficients indexed by two single part partitionsIntegrality in the Matching-Jack conjecture and the Farahat-Higman algebraCounting partitions of a fixed genusGaussian fluctuations of Young diagrams and structure constants of Jack charactersLarge expanders in high genus unicellular mapsMirror symmetry for extended affine Weyl groupsA bijection for covered maps on orientable surfacesOrigamis associated to minimally intersecting filling pairsOn the number of factorizations of a full cycleThe number of shortest paths in the (n, k)-star graphA combinatorial way of counting unicellular maps and constellationsTopological classification and enumeration of RNA structures by genusA versatile combinatorial approach of studying products of long cycles in symmetric groupsUnnamed ItemA simple model of trees for unicellular mapsUnnamed ItemEntanglement, quantum randomness, and complexity beyond scramblingBijective enumeration of 3-factorizations of an \(N\)-cycleMoments of normally distributed random matrices given by generating series for connection coefficients -- explicit bijective computationCombinatorially refine a Zagier-Stanley result on products of permutationsOn breadth‐first constructions of scaling limits of random graphs and random unicellular mapsPolynomial properties of Jack connection coefficients and generalization of a result by DénesOn products of long cycles: short cycle dependence and separation probabilitiesOn products of permutations with the most uncontaminated cycles by designated labelsThe algebra of conjugacy classes of the wreath product of a finite group with the symmetric groupEnumerative geometry of surfaces. Abstracts from the workshop held June 13--19, 2021 (hybrid meeting)Direct bijective computation of the generating series for 2 and 3-connection coefficients of the symmetric groupOdd permutations are nicer than even onesNear-central permutation factorization and Strahov's generalized Murnaghan-Nakayama ruleCardinality of Rauzy classesUnnamed ItemStructure coefficients of the Hecke algebra of \((\mathcal{S}_{2n},\mathcal{B}_n)\)Bijective enumeration of some colored permutations given by the product of two long cyclesCurves on surfaces and surgeriesA bijective proof of Jackson's formula for the number of factorizations of a cycleThe number of shortest paths in the arrangement graphCounting non-crossing permutations on surfaces of any genusEnumeration of almost polynomial rational functions with given critical valuesA bijection for covered maps, or a shortcut between Harer-Zagiers and Jacksons formulasAsymptotics of characters of symmetric groups, genus expansion and free probability.The structure of unicellular maps, and a connection between maps of positive genus and planar labelled treesKatriel's operators for products of conjugacy classes of \(\mathfrak S_n\)A new combinatorial identity for unicellular maps, via a direct bijective approachInequivalent factorizations of permutations\(\operatorname{GL}_n(\mathbb{F}_q)\)-analogues of factorization problems in the symmetric groupUnnamed ItemThe joint distribution of the marginals of multipartite random quantum statesk-Extendibility of high-dimensional bipartite quantum statesFactorization problems in complex reflection groupsMoments of normally distributed random matrices given by generating series for connection coefficients -- explicit algebraic computationCombinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson