Searcharxiv⌕ Search

arXiv subjects

Guillaume Chapuy

Publications and source records attributed to Guillaume Chapuy.

44 records · Page 3Linked to original sources

A bijection for covered maps, or a shortcut between Harer-Zagier's and Jackson's formulas

We consider maps on orientable surfaces. A map is called \emph{unicellular} if it has a single face. A \emph{covered map} is a map (of genus $g$) with a marked unicellular spanning submap (which can have any genus in $\{0,1,...,g\}$). Our main result is a bijection between covered maps with $n$ edges and genus $g$ and pairs made of a plane tree with $n$ edges and a unicellular bipartite map of genus $g$ with $n+1$ edges. In the planar case, covered maps are maps with a marked spanning tree and our bijection specializes into a construction obtained by the first author in \cite{OB:boisees}. Covered maps can also be seen as \emph{shuffles} of two unicellular maps (one representing the unicellular submap, the other representing the dual unicellular submap). Thus, our bijection gives a correspondence between shuffles of unicellular maps, and pairs made of a plane tree and a unicellular bipartite map. In terms of counting, this establishes the equivalence between a formula due to Harer and Zagier for general unicellular maps, and a formula due to Jackson for bipartite unicellular maps. We also show that the bijection of Bouttier, Di Francesco and Guitter \cite{BDFG:mobiles} (which generalizes a previous bijection by Schaeffer \cite{Schaeffer:these}) between bipartite maps and so-called well-labelled mobiles can be obtained as a special case of our bijection.

math.CO↗

Counting unicellular maps on non-orientable surfaces

A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is a topological disk. In this paper we present a bijective link between unicellular maps on a non-orientable surface and unicellular maps of a lower topological type, with distinguished vertices. From that we obtain a recurrence equation that leads to (new) explicit counting formulas for non-orientable unicellular maps of fixed topology. In particular, we give exact formulas for the precubic case (all vertices of degree 1 or 3), and asymptotic formulas for the general case, when the number of edges goes to infinity. Our strategy is inspired by recent results obtained by the second author for the orientable case, but significant novelties are introduced: in particular we construct an involution which, in some sense, "averages" the effects of non-orientability.

math.CO↗

A new combinatorial identity for unicellular maps, via a direct bijective approach

A unicellular map, or one-face map, is a graph embedded in an orientable surface such that its complement is a topological disk. In this paper, we give a new viewpoint to the structure of these objects, by describing a decomposition of any unicellular map into a unicellular map of smaller genus. This gives a new combinatorial identity for the number $ε_g(n)$ of unicellular maps of size $n$ and genus $g$. Contrarily to the Harer-Zagier recurrence formula, this identity is recursive in only one parameter (the genus). Iterating the construction gives an explicit bijection between unicellular maps and plane trees with distinguished vertices, which gives a combinatorial explanation (and proof) of the fact that $ε_g(n)$ is the product of the $n$-th Catalan number by a polynomial in $n$. The combinatorial interpretation also gives a new and simple formula for this polynomial. Variants of the problem are considered, like bipartite unicellular maps, or unicellular maps with cubic vertices only.

math.CO↗

Asymptotic enumeration and limit laws for graphs of fixed genus

It is shown that the number of labelled graphs with n vertices that can be embedded in the orientable surface S_g of genus g grows asymptotically like $c^{(g)}n^{5(g-1)/2-1}γ^n n!$ where $c^{(g)}>0$, and $γ\approx 27.23$ is the exponential growth rate of planar graphs. This generalizes the result for the planar case g=0, obtained by Gimenez and Noy. An analogous result for non-orientable surfaces is obtained. In addition, it is proved that several parameters of interest behave asymptotically as in the planar case. It follows, in particular, that a random graph embeddable in S_g has a unique 2-connected component of linear size with high probability.

math.CO↗

The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees

A unicellular map is a map which has only one face. We give a bijection between a dominant subset of rooted unicellular maps of fixed genus and a set of rooted plane trees with distinguished vertices. The bijection applies as well to the case of labelled unicellular maps, which are related to all rooted maps by Marcus and Schaeffer's bijection. This gives an immediate derivation of the asymptotic number of unicellular maps of given genus, and a simple bijective proof of a formula of Lehman and Walsh on the number of triangulations with one vertex. From the labelled case, we deduce an expression of the asymptotic number of maps of genus g with n edges involving the ISE random measure, and an explicit characterization of the limiting profile and radius of random bipartite quadrangulations of genus g in terms of the ISE.

math.CO↗

A Complete Grammar for Decomposing a Family of Graphs into 3-connected Components

Tutte has described in the book "Connectivity in graphs" a canonical decomposition of any graph into 3-connected components. In this article we translate (using the language of symbolic combinatorics) Tutte's decomposition into a general grammar expressing any family of graphs (with some stability conditions) in terms of the 3-connected subfamily. A key ingredient we use is an extension of the so-called dissymmetry theorem, which yields negative signs in the grammar. As a main application we recover in a purely combinatorial way the analytic expression found by Giménez and Noy for the series counting labelled planar graphs (such an expression is crucial to do asymptotic enumeration and to obtain limit laws of various parameters on random planar graphs). Besides the grammar, an important ingredient of our method is a recent bijective construction of planar maps by Bouttier, Di Francesco and Guitter.

math.CO↗

Asymptotic enumeration of constellations and related families of maps on orientable surfaces

We perform the asymptotic enumeration of two classes of rooted maps on orientable surfaces of genus g: m-hypermaps and m-constellations. For m=2, they correspond respectively to maps with even face degrees and bipartite maps. We obtain explicit asymptotic formulas for the number of such maps with any finite set of allowed face degrees. Our proofs rely on the generalisation to orientable surfaces of the Bouttier-Di Francesco-Guitter bijection, and on generating series methods. We show that each of the 2g fondamental cycles of the surface contributes a factor m between the numbers of m-hypermaps and m-constellations -- for example, large maps of genus g with even face degrees are bipartite with probability tending to 1/2^{2g}. A special case of our results implies former conjectures of Gao.

math.CO↗

A bijection for rooted maps on orientable surfaces

The enumeration of maps and the study of uniform random maps have been classical topics of combinatorics and statistical physics ever since the seminal work of Tutte in the sixties. Following the bijective approach initiated by Cori and Vauquelin in the eighties, we describe a bijection between rooted maps, or rooted bipartite quadrangulations, on a surface of genus g and some simpler objects that generalize plane trees. Thanks to a rerooting argument, our bijection allows to compute the generating series of rooted maps on a surface of genus g with respect to the number of edges, and to recover the asymptotic numbers of such maps. Our construction allows to keep track in a bipartite quadrangulation of the distances of all vertices to a random basepoint. This is an analog for higher genus surfaces of the basic result on which were built the recent advances in the comprehension of the intrinsec geometry of large random planar maps, hopefully opening the way to the study of a model of continuum random surfaces of genus g.

math.CO↗