Relating ordinary and fully simple maps via monotone Hurwitz numbers

A direct relation between the enumeration of ordinary maps and that of fully simple maps first appeared in the work of the first and last authors. The relation is via monotone Hurwitz numbers and was originally proved using Weingarten calculus for matrix integrals. The goal of this paper is to present two independent proofs that are purely combinatorial and generalise in various directions, such as to the setting of stuffed maps and hypermaps. The main motivation to understand the relation between ordinary and fully simple maps is the fact that it could shed light on fundamental, yet still not well-understood, problems in free probability and topological recursion.


Introduction
In this paper, we aim to prove a relation between the enumeration of ordinary maps and the enumeration of fully simple maps that first appeared in the work of the first and last authors [2 2]. We begin by defining a map, our primary object of study, along with some related notions. In our context, a graph may have loops or multiple edges and we consider it with the topology of a 1-dimensional CW complex. Definition 1.1. A map is a finite graph without isolated vertices embedded into an oriented compact surface. We require the complement of the graph to be a disjoint union of topological disks, which we call faces.
Define an oriented edge to be an edge along with a choice of one of its two orientations. We say that an oriented edge is adjacent to a face if the face lies on its left and incident to a vertex if it points to the vertex. Maps are endowed with the extra structure of an ordered tuple of distinct oriented edges, such that no two are adjacent to the same face. We refer to these oriented edges as roots, to the faces adjacent to them as boundary faces, and to all remaining faces as internal faces. The number of oriented edges adjacent to a face is called the degree of the face.
Two maps are equivalent if there exists an orientation-preserving homeomorphism between their underlying surfaces such that the vertices, oriented edges and faces of the first map are carried bijectively to the vertices, oriented edges and faces of the second, preserving all adjacencies and the tuple of roots. 2 1 Figure 1: An example of an ordinary map with two boundary faces of degrees 2 and 11, and two internal faces of degrees 4 and 5.
In the final section of the paper, we consider the more general notion of a stuffed map, which is obtained by relaxing the condition that the complement of the graph is a disjoint union of topological disks.
In general, one says that a map is connected if the underlying topological surface is connected. However, note that our definition of a map does not impose any such condition and indeed, all enumerations considered in this paper include maps that may be disconnected.
The definition of a map allows for different boundary faces to be adjacent along vertices and edges, as well as for a boundary face to be adjacent to itself along vertices and edges. Informally, we call a map fully simple if such behaviour does not arise -a precise definition follows. In previous work, the term simple has been used to refer to maps in which boundary faces are not allowed to be adjacent to themselves along vertices and edges, whereas different boundary faces may be adjacent along vertices and edges [2 2]. Throughout, we use the term ordinary to refer to the class of all maps, so as to emphasise the distinction from the class of fully simple maps. We will be interested primarily in the following enumerations of ordinary and fully simple maps.

Definition 1.3.
For positive integers µ 1 , µ 2 , . . . , µ n , let Map(µ 1 , µ 2 , . . . , µ n ) denote the weighted enumeration of maps with n boundary faces, such that the degree of boundary face i is µ i for i = 1, 2, . . . , n. The weight of a map M is given byh Here, χ(M) is the Euler characteristic of the underlying surface with the interiors of the boundary faces removed, f k (M) is the number of internal faces of degree k, and |Aut M| is the number of automorphisms. Let FSMap(µ 1 , µ 2 , . . . , µ n ) denote the analogous weighted enumeration restricted to the set of fully simple maps.
An automorphism of a map is a permutation of the oriented edges arising from an orientation-preserving homeomorphism from the underlying surface to itself that preserves the tuple of roots. Note that if each connected component of M contains at least one boundary face, then |Aut M| = 1.
Although there are infinitely many maps with prescribed boundary face degrees, Map(µ 1 , µ 2 , . . . , µ n ) and FSMap(µ 1 , . For brevity, our notation makes implicit the dependence on the parametersh and t 1 , t 2 , t 3 , . . .. From these formal power series, one can extract the number of maps with prescribed boundary face degrees, internal face degrees, and Euler characteristic. The main result of this paper relates the enumerations of ordinary and fully simple maps via monotone Hurwitz numbers, which we presently describe. Call a sequence τ 1 , τ 2 , . . . , τ k of transpositions in the symmetric group S d strictly monotone (respectively, weakly monotone) if τ i = (a i b i ) with a i < b i and the sequence b 1 , b 2 , . . . , b k is strictly increasing (respectively, weakly increasing).
We package these monotone Hurwitz numbers into the generating series Note that H < (λ; µ) is a polynomial inh, while H ≤ (λ; µ) is in general a formal power series inh. Again, the dependence onh is implicit in our notation.
For d a non-negative integer, we write λ d to express that λ is a partition of d. We denote the number of parts of λ by (λ) and the sum of its elements by |λ|. Furthermore, we will use the following notation, where m j (λ) is the number of occurrences of the positive integer j in the partition λ.
The main aim of this paper is to provide two combinatorial proofs of the following result.
Theorem 1.5. For any partition λ = (λ 1 , λ 2 , . . . , λ ) of a positive integer d, This result was originally proved using the following techniques from the theory of matrix models [2 2]. Let H(N) denote the space of N × N Hermitian matrices and let dν be a formal measure on it. For a polynomial function f on H(N), we introduce the notation For µ 1 + · · · + µ n = d ≤ N, there exists a formal measure dν on H(N) that is invariant under conjugation by elements of the unitary group U (N), such that where dU denotes the Haar measure on U (N). Weingarten calculus allows one to evaluate the moments of a Haar-distributed random unitary matrix and thus, express the right side of this equation as a linear combination of Map(λ) over partitions λ [3 3]. The upshot of this calculation is the following relation, which we later show is equivalent to Theorem 1.5 1.5. Corollary 1.6. For any partition µ = (µ 1 , µ 2 , . . . , µ n ) of a positive integer d, In this paper, we provide two combinatorial proofs for Theorem 1.5 1.5. The first one is more direct: we present a simplification algorithm that starts with an ordinary map and produces a fully simple map and a strictly monotone sequence of transpositions. The second one is more geometric: it starts with an ordinary map and produces a fully simple map and a dessin d'enfant, which encodes the pattern of non-simple gluing of the boundary faces. The result then follows from the fact that dessins d'enfant are enumerated by strictly monotone Hurwitz numbers. Theorem 1.5 1.5 was generalised to stuffed maps in the previous work of the first and last authors, following the matrix model approach [2 2]. The combinatorial approaches presented herein carry over to the setting of stuffed maps, but also generalise to the context of hypermaps, which is perhaps not immediately amenable to the matrix model approach. The essential idea behind these generalisations is the fact that our combinatorial proofs are not sensitive to the behaviour of the internal faces. Since the local structure of the boundary faces in maps, stuffed maps and hypermaps agree, one has the notion of fully simple and analogues of Theorem 1.5 1.5 for each case. A discussion of these results will be presented in the final section of the paper.
It is worth remarking here on the genesis of Theorem 1.5 1.5 and a possible application. The notion of fully simple maps was introduced in the work of the first and last authors [2 2]. They show that, analogously to the identification of certain moments with the enumeration of ordinary maps, the free cumulants that arise in free probability theory can be identified with the enumeration of fully simple planar maps. This then provides an elementary tool to work with higher order free cumulants, whose original definition uses intricate objects called partitioned permutations [4 4]. Moreover, they propose a combinatorial interpretation of the symplectic invariance property of the topological recursion, which is considered important yet is still not well understood [5 5, 6 6, 7 7]. It would be both natural and useful to have a purely combinatorial proof that the enumeration of fully simple maps is governed by the topological recursion, which appears as a conjecture in [2 2]. Since the enumeration of ordinary maps is the prototypical example of a problem governed by the topological recursion, Theorem 1.5 1.5 may provide a mechanism to realise such a proof.
The structure of the paper is as follows.
In Section 2 2, we introduce the definitions and conventions for the main players in this paper: namely, ordinary and fully simple maps, monotone Hurwitz numbers, and dessins d'enfant. The permutation model for maps is presented, along with a characterisation of fully simple maps within this framework. We then describe monotone Hurwitz numbers from a representation-theoretic viewpoint and use this to prove the equivalence of Theorem 1.5 1.5 and Corollary 1.6 1.6. The final part of this section includes a proof that dessins d'enfant are enumerated by strictly monotone Hurwitz numbers. In Section 3 3, we present the first proof of Theorem 1.5 1.5. The main idea is to start with an ordinary map and to apply a simplification algorithm that produces a fully simple map and a sequence of transpositions. We then show that the resulting sequence is strictly monotone. Careful accounting of the combinatorial factors and weights involved then allows us to deduce the main theorem of the paper. In Section 4 4, we present the second proof of Theorem 1.5 1.5. The main idea is to interpret strictly monotone Hurwitz numbers as an enumeration of dessins d'enfant. The form of the theorem suggests to construct a bijection that takes an ordinary map to a pair comprising a fully simple map and a dessin d'enfant. We present such a construction, as well as its inverse, which allows us to deduce the main theorem of the paper. In Section 5 5, we consider natural generalisations of the notion of fully simple maps and of Theorem 1.5 1.5 to stuffed maps and hypermaps.

Preliminaries
In this section we elaborate on our main objects of study. We present the permutation model for maps, give different characterisations for monotone Hurwitz numbers, introduce dessins d'enfant and relate them to strictly monotone Hurwitz numbers.

Maps
Rather than the topological description of maps provided in Definition 1.1 1.1, we predominantly work with the permutation model for maps. The model is described in the book of Lando and Zvonkin [9 9], although we present it here in notation that is particularly well-suited for our purposes.
One can encode an unrooted map via a triple (σ 0 , σ 1 , σ 2 ) of permutations acting on the set E of oriented edges, in which σ 0 rotates each oriented edge anticlockwise around the vertex it is incident to; σ 1 is the fixed point free involution that swaps oriented edges with the same underlying edge; and σ 2 rotates each oriented edge anticlockwise around the face to its left.
It follows that σ 0 σ 1 σ 2 = id, where we adopt the convention of multiplying permutations from right to left. Thus, one obtains the following result. The data (σ 0 , σ 1 , σ 2 ; R) and ( σ 0 , σ 1 , σ 2 ; R) define equivalent maps if and only if there exists a bijection φ : E → E that sends R to R and satisfies This permutation model admits the following characterisation of fully simple maps. Suppose that a map is given by the data (σ 0 , σ 1 , σ 2 ; R). Define the set B ⊆ E to be the union of the σ 2 -orbits of the elements of R and observe that this naturally corresponds to the set of boundary edges. Then the map is fully simple if and only if the elements of B lie in different σ 0 -orbits.
Let us describe the characterisation of fully simple maps in a slightly different way, using a notation that will subsequently be useful. Denote by σ ∂ 0 ∈ S(B) the permutation obtained by expressing σ 0 ∈ S(E) as a union of disjoint cycles and deleting those elements that do not lie in B. If e ∈ B is an oriented edge incident to the vertex v, then σ ∂ 0 (e) is the next oriented edge in B incident to v that is encountered when turning anticlockwise around v. Then a map is fully simple if and only if the permutation σ ∂ 0 is the identity permutation.

Monotone Hurwitz numbers
Definition 1.4 1.4 describes strictly and weakly monotone Hurwitz numbers as the enumeration of certain factorisations in the symmetric group. Such problems are often amenable to calculation via the representation theory of the symmetric group. For a positive integer d, consider the centre ZQ[S d ] of the symmetric group algebra. As a vector space, it has a basis formed by the conjugacy classes C λ , defined to be the sum of the permutations whose cycle type is given by the partition λ of d.
The representation theory of the symmetric group may be understood through the Jucys-Murphy 10 10]. The Jucys-Murphy elements commute and it follows that any symmetric polynomial of J 2 , J 3 , . . . , J d is an element of ZQ[S d ].
The following equations demonstrate that the monotone Hurwitz numbers can be expressed in terms of the centre of the symmetric group algebra as well as in terms of characters of the symmetric group.
The notation χ ρ (λ) refers to the symmetric group character indexed by ρ evaluated on a permutation of cycle type λ. The final product in each line is over the boxes of the Young diagram of the partition ρ. The notation c( ) refers to the content of the box, which is defined to be j − i for a box in the ith row from the top and the jth column from the left.
In both equations (1 1) and (2 2 Proof of Corollary 1.6 1.6 from Theorem 1.5 1.5. Recall that Theorem 1.5 1.5 and Corollary 1.6 1.6 respectively state that These equations provide the transition matrices that convert from ordinary to fully simple map enumerations and vice versa. The equivalence of these two statements is a consequence of the fact that these transition matrices are inverses of each other. To prove this, it is sufficient to check that The check is a straightforward consequence of applying equations (1 1) and (2 2) and the orthogonality of characters.

Dessins d'enfant
A dessin d'enfant is often described in the literature as a map whose vertices are bicoloured in such a way that each edge is adjacent to one vertex of each colour [9 9]. However, we will adopt the dual picture, which aligns with Definition 1.1 1.1 and is geometrically well-suited to our purposes. One can encode a dessin d'enfant via a triple (τ r , τ b , τ v ) of permutations acting on the set E of (unoriented) edges, in which τ r rotates each edge anticlockwise around the adjacent red face; τ b rotates each edge anticlockwise around the adjacent blue face; and τ v rotates each edge anticlockwise by two edges around the vertex to which it points.
For this last point, we assign an orientation to the edges of a dessin d'enfant in which each edge is oriented to have a blue face on its left and a red face on its right.
It follows that τ r τ b τ v = id, where we adopt the convention of multiplying permutations from right to left. Thus, one obtains the following result.
and each cycle of τ b contains exactly one element of R.
Up to a simple combinatorial factor, the strictly monotone Hurwitz number H < k (λ; µ) and the dessin d'enfant enumeration D k (λ; µ) agree. The crux of the argument is the following elementary result, which connects the two proofs of Theorem 1.5 1.5 presented in the following sections. Proof. A cycle (a 1 a 2 · · · a m ) in which a m = max(a 1 , a 2 , . . . , a m ) may be expressed as the product (a 1 a 2 · · · a m−1 ) • (a m−1 a m ). Iterating the process on the smaller cycle (a 1 a 2 · · · a m−1 ) results in an expression for (a 1 a 2 · · · a m ) as a product of a strictly monotone sequence of m − 1 transpositions.
For an arbitrary permutation ρ ∈ S d of cycle type ν, one may perform the above procedure to each cycle to obtain an expression where 1 ≤ a k ≤ k. It is clear that the number of such sequences is d! and one obtains all possible strictly monotone sequences of transpositions by redacting any occurrences of (i i) for some integer i.
Consider a dessin d'enfant (τ r , τ b , τ v ; R) in which the cycle types of τ b and τ r are λ and µ, respectively. The previous proposition allows us to write τ v = τ 1 τ 2 · · · τ k for a unique strictly monotone sequence of transpositions τ 1 , τ 2 , . . . , τ k . It follows that so we obtain a tuple (τ b , τ 1 , τ 2 , . . . , τ k , τ r ) that contributes to the strictly monotone Hurwitz number H < k (λ; µ). Recall that the enumeration of dessins d'enfant required in addition a choice of the tuple of roots. The number of such choices is simply The first product accounts for the number of ways to choose a root within each cycle, while the second product accounts for the number of ways to order these so that root r j comes from a cycle of length λ j . Thus, we obtain the following relation.
In analogy with the monotone Hurwitz numbers, we collect the D k (λ; µ) for varying k together in the generating series The previous proposition can then be expressed as D(λ; µ) = z(λ) H < (λ; µ).

Proof 1: Monotone transpositions
In this section, we present an algorithm that turns an ordinary map into a fully simple map. The algorithm systematically traverses the set of boundary edges and performs a "simplification" there, if possible.

Simplification algorithm
Throughout the section, we use the following terminology.
where (i, 1) denotes the root and the remaining labels are assigned in an anticlockwise manner around the boundary face. With this convention, one can write σ 2 (i, j) = (i, j + 1), where the second entry is considered modulo λ i . These labels allow us to equip the set B of boundary edges with the lexicographical order. From M, we construct a fully simple map M s via the following algorithm.
We start at the root (1, 1) of boundary face 1 in M. Our algorithm traverses the set B of boundary edges in lexicographical order. At each step of the algorithm, the permutations σ 0 and σ 2 may change, while σ 1 remains unchanged throughout. Suppose that we are at the boundary edge (p, q) and that it is incident to vertex v. Then the following two possibilities arise.
If the vertex v is fully simple, then we leave the permutations σ 0 and σ 2 unchanged. Otherwise, there are at least two boundary edges incident to v, including (p, q). Let us write (p , q ) = σ ∂ 0 (p, q) and observe that since v is not fully simple, we must have (p , q ) = (p, q) -see Figure 5 5. We change the permutation σ 0 intoσ 0 by composing it with a transposition thus.
To preserve the relation σ 0 σ 1 σ 2 = id, we change the permutation σ 2 intoσ 2 in the following way.
This step of the algorithm splits the vertex v into two vertices v 1 and v 2 , as shown in Figure 5 5. The oriented edge (p, q) is now incident to v 1 , which is necessarily fully simple. The oriented edge (p , q ) is now incident to v 2 , which might not be fully simple. At the end of each step of the algorithm, we update σ 0 to beσ 0 and σ 2 to beσ 2 .
no other boundary v (p, q) no other boundary v 1 σ 2 (p, q) Figure 5: The diagrams depict the local structure before and after the simplification algorithm is applied to the boundary edge (p, q), which is incident to a vertex v that is not fully simple. The arrows represent oriented edges while the blue domains represent boundary faces. We turn anticlockwise around v and seek the first boundary edge (p , q ) = σ ∂ 0 (p, q). The permutation σ 0 is then updated toσ 0 = ((p, q); (p , q )) • σ 0 and the permutation σ 2 toσ 2 = σ 2 • ((p, q); (p , q )). This operation has the effect of splitting the vertex v into two vertices v 1 and v 2 .
Although we distinguished two cases here, one may consider the first to be a special case of the second; for if v is already fully simple, then one has σ ∂ 0 (p, q) = (p, q). So the "transposition" arising in equation (3 3) would be ((p, q); (p, q)), which one may interpret as the identity permutation. So composing with the identity permutation is consistent with leaving the permutations σ 0 and σ 2 unchanged in the first case.
At the end of each step, we move to the next boundary edge according to the lexicographical order defined above. Once all of the oriented edges adjacent to a boundary face have been traversed, that boundary face is then fully simple. Once all of the boundary edges in B have been traversed, then the resulting map is fully simple, although it remains to assign the roots. We do this by declaring the boundary faces to be such that B remains the set of boundary edges. We declare the tuple of roots to be lexicographically minimal, such that there is one root adjacent to each such boundary face. Thus, we conclude the algorithm with a fully simple map, which we denote by M s .

Monotonicity
Let τ 1 , τ 2 , . . . , τ k be the transpositions appearing in equation (3 3) during the simplification algorithm, in the order that they arise. The permutations representing the ordinary map M are σ 0 , σ 1 , σ 2 , and we denote the permutations representing the fully simple map M s by σ s 0 , σ s 1 , σ s 2 . The latter are obtained from the former via The algorithm implies a certain monotonicity condition on the sequence of transpositions τ 1 , τ 2 , . . . , τ k . We write τ i = ((p i , q i ); (p i , q i )) for i = 1, 2, . . . , k, where (p i , q i ) = σ ∂ 0 (p i , q i ) and we adopt the labels of boundary edges described in Section 3.1 3.1. By construction, we know that (p i , q i ) is smaller than (p i , q i ) with respect to the lexicographical order. Otherwise, the boundary edge (p i , q i ) would have been visited in a previous step of the algorithm and the vertex it is incident to would have already been made fully simple. Furthermore, we know that the sequence (p 1 , q 1 ), (p 2 , q 2 ), . . . , (p k , q k ) is strictly increasing with respect to the lexicographical order. This is because the algorithm visits the boundary edges in that order. Thus, we have deduced the following.

Lemma 3.2.
For any ordinary map M, the sequence τ 1 , τ 2 , . . . , τ k of transpositions arising from the simplification algorithm satisfies the following monotonicity property with respect to the lexicographical order: the smaller elements transposed by τ 1 , τ 2 , . . . , τ k form a strictly increasing sequence.
Note that in Definition 1.4 1.4, the definition of monotone Hurwitz numbers requires a sequence of transpositions in which the larger elements form a strictly increasing sequence. However, we claim that the enumeration of such sequences is not sensitive to whether one takes the smaller or larger elements. Indeed, one can obtain one from the other by reversing the sequence of transpositions and reversing the ordering imposed on the elements.

Conclusion
The previous discussions on the simplification algorithm and monotonicity now allow us to deduce our main result.
Proof of Theorem 1.5 1.5. To any ordinary map M described by the permutations σ 0 , σ 1 , σ 2 , the simplification algorithm above associates a fully simple map M s described by the permutations σ s 0 , σ s 1 , σ s 2 , as well as a strictly increasing sequence of transpositions τ 1 , τ 2 , . . . , τ k . All of these permutations are related by equation (4 4).
Observe that the simplification algorithm changes neither the number of internal faces nor their degrees. It also leaves the number of edges invariant but creates k new vertices, as shown in Figure 5 5. Since we calculate Euler characteristics after removing the interiors of boundary faces, we find that It follows that the weight attached to M ish k multiplied by the weight attached to M s . By inverting equation (4 4), one deduces that the correspondence between maps and fully simple maps with a strictly increasing sequence of transpositions is bijective and weight-preserving. Therefore, we have where H < k (λ; µ) is the number of strictly increasing sequences τ 1 , τ 2 , . . . , τ k of transpositions such that To compute H < k (λ; µ), we emphasise that the permutation σ 2 is a fixed element of C λ , while σ s 2 is allowed to be an arbitrary element of C µ . From the discussion in Section 2.2 2.2, we know that starting from another fixed permutationσ 2 ∈ C λ will produce the same number. After comparing with Definition 1.4 1.4, we deduce that and combining with equation (5 5) yields the desired result.

Proof 2: Dessins d'enfant
In this section we construct a bijection between ordinary maps and pairs comprising a fully simple map and a dessin d'enfant.

Intuition
In Section 2.3 2.3, we observed that strictly monotone Hurwitz numbers are naturally related to dessins d'enfant. In particular, one may invoke Proposition 2.6 2.6 to equivalently state Theorem 1. Below, this function is described by interpreting both maps and dessins d'enfant in terms of triples of permutations, as discussed in Section 2 2. However, such an algebraic proof is strongly motivated by a geometric intuition that is illustrated by the following example. By "splitting" the central vertex, one obtains the map on the right, which is indeed fully simple. In a certain sense, the dessin d'enfant below it stores the information required to recover the original map from the fully simple map, by gluing the blue faces of the dessin d'enfant into the fully simple map. So informally speaking, the fully simple map encodes the internal faces of the map while the dessin d'enfant encodes how the boundaries of the map intersect.

Forward
We now describe our construction, which takes an ordinary map To define R, we first observe that there exists a set of faces of the unrooted map F(M) whose adjacent edges precisely recover the set B. We designate these the boundary faces of F(M) and suppose that their degrees are given by µ 1 , µ 2 , . . . , µ n , in some order.
Next, consider the total order on the set B of boundary edges, described in Section 3.1 3.1. In other words, assign to a boundary edge the label (i, j) if it is adjacent to face i and it is equal to σ j−1 2 (r i ), where we choose j to be the smallest such positive integer. The total order is then simply the lexicographical order on B with respect to these labels. Now choose the tuple of roots R = (r 1 , r 2 , . . . , r n ) such that r i is adjacent to a face of degree µ i and such that (r 1 , r 2 , . . . , r n ) is lexicographically minimal.

Reverse
We now describe the reverse construction, which takes a pair (F, D) comprising a fully simple map and a dessin d'enfant whose boundary face degrees and red face degrees match and returns an ordinary map M(F, D) whose boundary face degrees match the blue face degrees of D.
Input. The fully simple map F given by the data (ρ 0 , ρ 1 , ρ 2 ; R) and the dessin d'enfant D given by the data (τ r , τ b , τ v ; R). We assume that the cycle type of ∂(ρ 2 ) equals the cycle type of τ r .
We consider ρ 0 , ρ 1 , ρ 2 ∈ S(E) and τ r , τ b , τ v ∈ S(B). Suppose that the fully simple map F has n boundary faces of respective degrees µ 1 , µ 2 , . . . , µ n . We assign to the oriented edges adjacent to boundary face i the labels (i, 1), (i, 2), (i, 3), . . . , (i, µ i ), where (i, 1) denotes the root and the remaining labels are assigned in an anticlockwise manner around the boundary face. In a similar manner, suppose that the dessin d'enfant D has blue faces of respective degrees λ 1 , λ 2 , . . . , λ . We assign to the (unoriented) edges adjacent to blue face i the labels where (i, 1) denotes the root and the remaining labels are assigned in an anticlockwise manner around the blue face.
Thus, we have total orders on the set of boundary edges of the fully simple map F and the set B of edges of the dessin d'enfant D. Consider the unique order-preserving map between these two sets, which defines an embedding B → E and hence, a natural inclusion ι : S(B) → S(E).

Proofs
We now check the various claims that were made regarding the construction of the previous section, before proving Theorem 1.5 1.5.

The map F(M) is a fully simple map.
By construction, F(M) is a map and it remains to check that it is fully simple. Using the characterisation of fully simple maps from Section 2.1 2.1, this is equivalent to the fact that the elements of B lie in different orbits of (σ ∂ 0 ) −1 σ 0 , which is a direct consequence of the following result. Proof. Suppose that σ is written in disjoint cycle notation and let us describe how precomposing with (σ ∂ ) −1 modifies its cycles. Observe that σ ∂ (c) = c, if c ∈ B. Therefore, if a cycle of σ contains no element from B, then (σ ∂ ) −1 σ contains the same cycle.
If σ(c) = b ∈ B, then we choose the smallest positive integer r such that σ −r (b) ∈ B. By construction of σ ∂ , we have that (σ ∂ ) −1 (b) = σ −r (b). Then σ q σ −r (b) ∈ B for 0 < q < r and (σ ∂ ) −1 leaves all of these elements invariant. In the cycle of (σ ∂ ) −1 σ containing σ −r (b), the latter is followed by . . , σ −1 (b) = c which is then followed by σ −r (b). Therefore, it contains a unique element of B and we have justified the claim. Note that if the initial cycle of σ already contains only one b belonging to B, then the minimum r will be such that σ −r (b) = b and the resulting cycle of (σ ∂ ) −1 σ will be the same as the initial one.

D(M) is a dessin d'enfant.
We simply need to check that . This is a direct consequence of the following lemma, under the identification a = σ 2 and b = ∂(σ 0 ). We omit the proof, since it is a straightforward computation. The result then follows from the fact that the bijective map of the previous paragraph is weight-preserving. To see this, we first note that the construction preserves the internal faces and their degrees, when constructing F(M) from M. So the powers of t 1 , t 2 , t 3 , . . . agree. It then remains to check that the exponent ofh is preserved as well. The exponent ofh associated to the map M = (σ 0 , σ 1 , So we simply need to check that the first contribution is equal to the sum of the latter two. This can be expressed by the equation where we have used the fact that the internal faces of M and F(M) agree, which implies that c(σ 2 ) − (µ) = c(σ 2 σ ∂ 0 ) − (λ). However, this equation is a consequence of the two relations The first relation is equivalent to the obvious fact that in the fully simple map F(M), the number of vertices incident to a boundary face is equal to the number of boundary edges. The second relation is equivalent to the obvious fact that the number of vertices in F(M) that are not incident to a boundary face is equal to the number of vertices in M that are not incident to a boundary face.

Generalisations
In this section, we generalise our result for two fundamental objects -namely, stuffed maps and hypermaps. They can be roughly thought of as being akin to maps, with the same notion of boundaries but endowed with a richer internal structure. The idea for both generalisations is that the previous manipulations did not affect the internal structure of maps; thus, all the arguments still apply in these settings. We would like to point out that the same idea can be applied to more general objects, as long as they have the same type of boundaries as maps and the weight factorises as a product of contributions from boundary faces and internal faces.

Stuffed maps
In the definition of a map (Definition 1.1 1.1), if one relaxes the condition that the complement of the graph is a disjoint union of topological disks, one obtains the notion of a stuffed map [1 1]. However, we also impose the following important caveat -namely, that the boundary faces must be homeomorphic to topological disks. On the other hand, the internal faces of a stuffed map may have arbitrary topology, including any non-negative genus and any positive number of boundary components. Each such boundary component then has an associated positive integer degree. The definition of fully simple (Definition 1.2 1.2) then carries over verbatim to the context of stuffed maps. The enumeration of stuffed maps that we are concerned with requires extra parameters to keep track of the possible topologies of the internal faces.
Definition 5.1. For positive integers µ 1 , µ 2 , . . . , µ n , let Map st (µ 1 , µ 2 , . . . , µ n ) denote the weighted enumeration of stuffed maps such that the degree of boundary face i is µ i for i = 1, 2, . . . , n. The weight of a stuffed map M is given byh where χ(M) is the Euler characteristic of the underlying surface with the interiors of the boundary faces removed and f g,λ (M) the number of internal faces with genus g and (λ) boundary components with degrees prescribed by the non-empty partition λ. Let FSMap st (µ 1 , µ 2 , . . . , µ n ) denote the analogous weighted enumeration restricted to the set of fully simple stuffed maps.
Our main result extends to the enumerations of stuffed maps and fully simple stuffed maps, essentially without change.
Theorem 5.2. For any partition λ = (λ 1 , λ 2 , . . . , λ ) of a positive integer d, In order to extend our proofs to stuffed maps, one can consider a mild generalisation of the permutation model for maps presented in Section 2.1 2.1. The basic idea is that a stuffed map can be encoded by a map, along with a partition of its internal faces and the assignment of a non-negative integer to each part in the partition. To recover the stuffed map from the map, for each part in the partition, we remove the corresponding internal faces and glue in a surface whose genus is specified by the associated integer.

Lemma 5.3.
A stuffed map can be encoded by a map (σ 0 , σ 1 , σ 2 ; R) as per Definition 1.1 1.1, along with an unordered partition P of the unrooted cycles of σ 2 and a function h : P → {0, 1, 2, . . .} that assigns a non-negative integer to each part of the partition.
Note that, unlike for maps, the cycles of σ 2 do not necessarily correspond to faces. The faces of the stuffed map are rather the parts of P. The Euler characteristic of a stuffed map is computed using this new notion of face.
As for maps, the boundary faces in stuffed maps must be homeomorphic to disks. Since all the manipulations in our proofs leave the internal faces unchanged and only affect boundary faces, the arguments of both Sections 3 3 and 4 4 remain valid for stuffed maps and yield Theorem 5.2 5.2.

Hypermaps
Hypermaps generalise maps analogously to the way that hypergraphs generalise graphs. Whereas graphs and maps have edges that connect two vertices, hypergraphs and hypermaps have so-called hyperedges that connect any number of vertices. We will consider our hypermaps to have faces coloured blue and hyperedges coloured red. This leads to the following definition, adapted from [9 9].

Definition 5.4.
A hypermap is a bicoloured map, in the sense that each face is coloured either blue or red so that each edge is adjacent to a blue face and a red face. We furthermore require that each root is adjacent to a blue face. In this context, we consider the blue faces with roots as boundary faces, the blue faces without roots as internal faces, and the red faces as hyperedges.
A dessin d'enfant is a particular case of a hypermap, in which there are no internal faces. As with the dessins d'enfant appearing in Section 2.3 2.3, we assign an orientation to the edges of a hypermap in which each edge is oriented to have a blue face on its left and a red face on its right. The definition of fully simple (Definition 1.2 1.2) again carries over verbatim to the context of hypermaps.
One can encode an unrooted hypermap via a triple (σ 0 , σ 1 , σ 2 ) of permutations acting on the set E of (unoriented) edges, in which σ 0 rotates each edge anticlockwise by two edges around the vertex to which it points; σ 1 rotates each edge anticlockwise around the adjacent red face; and σ 2 rotates each edge anticlockwise around the adjacent blue face.
Lemma 5.5. A hypermap can be encoded by a triple (σ 0 , σ 1 , σ 2 ) of permutations in S(E) and a tuple R ∈ E n such that σ 0 σ 1 σ 2 = id; and no two elements of R lie in the same cycle of σ 2 .
A dessin d'enfant given by the triple (τ r , τ b , τ v ) can be thought of as a hypermap given by the triple (σ 0 , σ 1 , σ 2 ) under the correspondence τ r = σ 1 , τ b = σ 2 , τ v = σ 0 . Notice that the equation τ r τ b τ v = id is then equivalent to σ 0 σ 1 σ 2 = id. Also observe that if σ 1 (or τ r ) is a fixed point free involution, then the hyperedges (or red faces) have degree 2 and can be collapsed to become edges in the usual sense. In this case, the hypermap is a map. Again, this result follows from our arguments in Sections 3 3 and 4 4, since the boundary faces in hypermaps must be homeomorphic to disks and all the manipulations in our proofs leave the internal faces unchanged and only affect boundary faces.