scientific article; zbMATH DE number 919921
From MaRDI portal
Recommendations
- Annular embeddings of permutations for arbitrary genus
- Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
- Factoring \(n\)-cycles and counting maps of given genus
- Some combinatorial problems associated with products of conjugacy classes of the symmetric group
- Counting orbits of a product of permutations
Cited in
(34)- Combinatorially refine a Zagier-Stanley result on products of permutations
- Factorizations of an \(n\)-cycle into two \(n\)-cycles
- A direct bijection for the Harer-Zagier formula
- Generation of RNA pseudoknot structures with topological genus filtration
- A character approach to directed genus distribution of graphs: the bipartite single-black-vertex case
- A bijection for tricellular maps
- On the distribution of non-paracyclic groups
- On Foulkes characters
- Two enumerative results on cycles of permutations
- A versatile combinatorial approach of studying products of long cycles in symmetric groups
- The Asymptotic Statistics of Random Covering Surfaces
- Random 2-cell embeddings of multistars
- The Harer-Zagier and Jackson formulas and new results for one-face bipartite maps
- Another proof of the Harer-Zagier formula
- Constellations and \(\tau\)-functions for rationally weighted Hurwitz numbers
- Matrix integrals and map enumeration: an accessible introduction
- Odd permutations are nicer than even ones
- A bijection for covered maps, or a shortcut between Harer-Zagiers and Jacksons formulas
- Shapes of topological RNA structures
- Lie theory of finite simple groups and the Roth property
- Enumerating graph embeddings and partial-duals by genus and Euler genus
- Finite covers of random 3-manifolds
- An analog of the Harer-Zagier formula for unicellular bicolored maps
- Plane permutations and applications to a result of Zagier-Stanley and distances of permutations
- Bijective enumeration of some colored permutations given by the product of two long cycles
- On the maximal number of elements pairwise generating the symmetric group of even degree
- Factorizations of large cycles in the symmetric group
- A new combinatorial identity for unicellular maps, via a direct bijective approach
- Annular embeddings of permutations for arbitrary genus
- On formulae of Macbeath and Hussein
- On products of permutations with the most uncontaminated cycles by designated labels
- Calculating the Euler characteristic of the moduli space of curves
- Likelihood orders for the \(p\)-cycle walks on the symmetric group
- On the genus distributions of wheels and of related graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4890772)
