The Harer-Zagier and Jackson formulas and new results for one-face bipartite maps
From MaRDI portal
Publication:6602153
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of representation theory (05E10) Completely integrable infinite-dimensional Hamiltonian and Lagrangian systems, integration methods, integrability tests, integrable hierarchies (KdV, KP, Toda, etc.) (37K10) Relations of low-dimensional topology with graph theory (57M15)
Recommendations
- A bijective proof of Jackson's formula for the number of factorizations of a cycle
- A combinatorial way of counting unicellular maps and constellations
- Szeged-like entropies of graphs
- Generating functions of bipartite maps on orientable surfaces
- Generating functions of bipartite maps on orientable surfaces (extended abstract)
Cites work
- A bijective proof of Jackson's formula for the number of factorizations of a cycle
- A direct bijection for the Harer-Zagier formula
- A new combinatorial identity for unicellular maps, via a direct bijective approach
- A simple model of trees for unicellular maps
- A versatile combinatorial approach of studying products of long cycles in symmetric groups
- An analogue of the Harer-Zagier formula for unicellular maps on general surfaces
- Another proof of the Harer-Zagier formula
- Bijections and symmetries for the factorizations of the long cycle
- Bijective enumeration of some colored permutations given by the product of two long cycles
- Combinatorially refine a Zagier-Stanley result on products of permutations
- Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
- Counting rooted maps by genus. I
- Enumeration of Grothendieck's dessins and KP hierarchy
- Factoring \(n\)-cycles and counting maps of given genus
- Graphs on surfaces and their applications. Appendix by Don B. Zagier
- Grothendieck’s dessins d’enfants in a web of dualities. III
- scientific article; zbMATH DE number 5880301 (Why is no real title available?)
- scientific article; zbMATH DE number 6909301 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 919921 (Why is no real title available?)
- Hypermaps versus bipartite maps
- Nombre de représentations d'une permutation comme produit de deux cycles de longueurs données
- Odd permutations are nicer than even ones
- Plane permutations and applications to a result of Zagier-Stanley and distances of permutations
- Rationality in map and hypermap enumeration by genus
- Simple formulas for constellations and bipartite maps with prescribed degrees
- Some combinatorial problems associated with products of conjugacy classes of the symmetric group
- Space-efficient generation of nonisomorphic maps and hypermaps
- The Euler characteristic of the moduli space of curves
- Two enumerative results on cycles of permutations
- Virasoro constraints and topological recursion for Grothendieck's dessin counting
This page was built for publication: The Harer-Zagier and Jackson formulas and new results for one-face bipartite maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602153)
