A simple model of trees for unicellular maps

Details A simple model of trees for unicellular maps A simple model of trees for unicellular maps

2012-02-15

arxiv.org/abs/1202.3252v1

Mathematics

Combinatorics

Scientific paper

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, or the Lehman-Walsh/Goupil-Schaeffer formulas. Thanks to previous work of the second author this also leads us to a new expression for Stanley character polynomials, which evaluate irreducible characters of the symmetric group.

Affiliated with

Also associated with

No associations

Rating

A simple model of trees for unicellular maps does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A simple model of trees for unicellular maps, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A simple model of trees for unicellular maps will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-556940