A simple model of trees for unicellular maps
From MaRDI portal
Abstract: We consider unicellular maps, or polygon gluings, of fixed genus. A few years ago the first author gave a recursive bijection transforming unicellular maps into trees, explaining the presence of Catalan numbers in counting formulas for these objects. In this paper, we give another bijection that explicitly describes the "recursive part" of the first bijection. As a result we obtain a very simple description of unicellular maps as pairs made by a plane tree and a permutation-like structure. All the previously known formulas follow as an immediate corollary or easy exercise, thus giving a bijective proof for each of them, in a unified way. For some of these formulas, this is the first bijective proof, e.g. the Harer-Zagier recurrence formula, the Lehman-Walsh formula and the Goupil-Schaeffer formula. We also discuss several applications of our construction: we obtain a new proof of an identity related to covered maps due to Bernardi and the first author, and thanks to previous work of the second author, we give a new expression for Stanley character polynomials, which evaluate irreducible characters of the symmetric group. Finally, we show that our techniques apply partially to unicellular 3-constellations and to related objects that we call quasi-constellations.
Recommendations
- A simple model of trees for unicellular maps
- scientific article; zbMATH DE number 1088521
- Simplicial and cellular trees
- Binary tree approach to scaling in unimodal maps
- scientific article; zbMATH DE number 4065010
- Publication:3485641
- Universal maps on trees
- Renormalization of binary trees derived from one-dimensional unimodal maps
- The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees
- scientific article; zbMATH DE number 1163254
Cites work
- scientific article; zbMATH DE number 6909301 (Why is no real title available?)
- scientific article; zbMATH DE number 3900794 (Why is no real title available?)
- A bijection for covered maps, or a shortcut between Harer-Zagiers and Jacksons formulas
- A bijective proof of Jackson's formula for the number of factorizations of a cycle
- A combinatorial proof of the Harer-Zagier formula
- A direct bijection for the Harer-Zagier formula
- A new combinatorial identity for unicellular maps, via a direct bijective approach
- An analogue of the Harer-Zagier formula for unicellular maps on general surfaces
- Analytic combinatorics
- Asymptotic enumeration of constellations and related families of maps on orientable surfaces
- Bijections and symmetries for the factorizations of the long cycle
- Bijective counting of tree-rooted maps and shuffles of parenthesis systems
- Coalescent random forests
- Counting rooted maps by genus. I
- Counting trees using symmetries
- Counting unicellular maps on non-orientable surfaces
- Enumeration of planar constellations
- Factoring \(n\)-cycles and counting maps of given genus
- Factorizations of large cycles in the symmetric group
- Graphs on surfaces and their applications. Appendix by Don B. Zagier
- Maps, hypermaps and their automorphisms: A survey. I
- On the Enumeration of Tree-Rooted Maps
- Planar maps as labeled mobiles
- Representations of symmetric groups and free probability
- Separation probabilities for products of permutations
- Some combinatorial problems associated with products of conjugacy classes of the symmetric group
- Stanley's character polynomials and coloured factorisations in the symmetric group
- Stanley's formula for characters of the symmetric group.
- The Euler characteristic of the moduli space of curves
- The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
Cited in
(41)- Factorization problems in complex reflection groups
- Short cycles in high genus unicellular maps
- Maps of unfixed genus and blossoming trees
- Unicellular maps vs. hyperbolic surfaces in large genus: simple closed curves
- Simple formulas for constellations and bipartite maps with prescribed degrees
- \(\mathrm{GL}_n(\mathbf{F}_q)\)-analogues of factorization problems in \(\mathfrak{S}_n\)
- Factorization problems in complex reflection groups
- Contribution of \(n\)-cylinder square-tiled surfaces to Masur-Veech volume of \(\mathcal{H}(2g-2)\)
- A versatile combinatorial approach of studying products of long cycles in symmetric groups
- Szeged-like entropies of graphs
- The Harer-Zagier and Jackson formulas and new results for one-face bipartite maps
- Large unicellular maps in high genus
- Shifted symmetric functions and multirectangular coordinates of Young diagrams
- Virtual Euler characteristics via topological recursion
- A combinatorial identity concerning plane colored trees and its applications
- Combinatorial study of graphs arising from the Sachdev-Ye-Kitaev model
- \(\operatorname{GL}_n(\mathbb{F}_q)\)-analogues of factorization problems in the symmetric group
- An analogue of the Harer-Zagier formula for unicellular maps on general surfaces
- Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson
- A bijection for covered maps, or a shortcut between Harer-Zagiers and Jacksons formulas
- Generalisations of the Harer-Zagier recursion for 1-point functions
- Reflection length with two parameters in the asymptotic representation theory of type B/C and applications
- Moments of normally distributed random matrices given by generating series for connection coefficients -- explicit bijective computation
- Iterated foldings of discrete spaces and their limits: candidates for the role of Brownian map in higher dimensions
- A simple model of trees for unicellular maps
- Bijection between trees in Stanley character formula and factorizations of a cycle
- Hypergraph matrix models and generating functions
- Planarity and non-separating cycles in uniform high genus quadrangulations
- Bijection between trees in Stanley character formula and factorizations of a cycle
- The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees
- Counting unicellular maps on non-orientable surfaces
- A new combinatorial identity for unicellular maps, via a direct bijective approach
- Random generation and scaling limits of fixed genus factorizations into transpositions
- Large expanders in high genus unicellular maps
- The Harer-Zagier recursion for an irregular spectral curve
- The joint distribution of the marginals of multipartite random quantum states
- On products of permutations with the most uncontaminated cycles by designated labels
- Calculating the Euler characteristic of the moduli space of curves
- Simple formulas for constellations and bipartite maps with prescribed degrees
- Simple recurrence formulas to count maps on orientable surfaces
- Bijective counting of tree-rooted maps and shuffles of parenthesis systems
This page was built for publication: A simple model of trees for unicellular maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388727)
