nLab
child's drawing

Children’s drawings (Dessins d’enfants)

Idea and prehistory

It is an old result that any (finite) graph can be embedded in an orientable surface. (The result can be found, for instance in White 1984, in which he give an algorithm, calling it the Edmonds algorithm and giving a date of 1960, (see Edmonds 1960).)

In 1879 Felix Klein (see Klein’s dessins d’enfants) in his paper “Über die Transformationen elfter Ordnung der elliptischen Funktionen” (“On the transformations of order eleven of elliptic functions” ) classified some Riemann surfaces of a certain ramification type by associating to covers of the surface with certain monodromy group their “dessins d’enfants” which he called “Linienzüge”.

The modern perception of dessins d’enfants begins with Grothendieck, who showed how to describe, categorically, the geometric structure corresponding to such embedded graphs, namely by the action of a certain ‘cartographic group’ on sets. His motivation was the way in which this shed light on the structure of Riemann surfaces, and through that to the absolute Galois group GG of the rational numbers. The technical vehicle explicating this relation is Belyi’s theorem from which follows that GG has a faithful action on Grothendieck’s dessins d’enfants.

A dessin d’enfant (French for a “child’s drawing”, plural “dessins d’enfants”, ‘’children’s drawings“) is a type of graph drawing used to study Riemann surfaces and to provide combinatorial invariants? for the action of the absolute Galois group of the rational numbers.

“Intuitively, a dessin d’enfant is simply a graph, with its vertices colored alternating black and white, embedded? onto an oriented surface? that, in many cases, is simply a plane. For the coloring to exist, the graph must be bipartite?. The faces of the embedding must be topological disks. The surface and the embedding may be described combinatorially using a rotation system?, a cyclic order of the edges surrounding each vertex of the graph that describes the order in which the edges would be crossed by a path that travels clockwise on the surface in a small loop around the vertex. Any dessin can provide the surface it is embedded on with a structure as a Riemann surface. It natural to ask which Riemann surfaces arise in this way. The answer is provided by Belyi's theorem?, which states that these are precisely those that can be defined over the field of algebraic numbers (when considered as algebraic curves). The absolute Galois group transforms these particular curves into each other, and thereby also transforms the underlying dessins.” (wikipedia)

The original development does not, however, explicitly use bipartite graphs, rather it used a form of 1-complex, embedded in a surface (see below). The use of bipartite graphs simplifies the exposition.

Definition

A (topological) map is an embedding of a connected graph GG (loops and multiple edges allowed) into a compact oriented surface XX, such that it fills the surface, i.e. XGX \setminus G is a disjoint union of open cells (referred to as the faces of the map). Two maps (X 1,G 1)(X_1 , G_1 ) and (X 2,G 2)(X_2 , G_2 ) are called equivalent if there exists a homeomorphism f:X 1X 2f : X_1 \to X_2 such that f(G 1)=G 2f (G_1 ) = G_2 .

A hypermap is a map together with a coloring of the vertices in black and white such that any two adjacent vertices have different colors. Observe that any map (with vertices all colored in black) gives rise to a hypermap by placing a white vertex in the middle of every edge—so, hypermaps can be seen as maps with extra information, but also conversely as a generalization of maps (which is how they were originally conceived).

Finally, a dessin d’enfant can be defined simply as a hypermap, but typically it refers to a hypermap seen as the representation of a Belyi function, i.e., a meromorphic function f:X¯f : X \to \bar{\mathbb{C} } unramified outside {0,1,}\{0,1,\infty\}. Any such function determines a hypermap on the Riemann surface XX by considering the inverse image of the unit interval, H=f 1([0,1])H = f^{-1}([0,1]). Black vertices of HH correspond to the preimages of 0, white vertices to the preimages of 1, and moreover, each face of HH contains exactly one pole (i.e., a preimage of \infty).

Examples

  • Any polynomial f:¯¯f : \bar{\mathbb{C}} \to \bar{\mathbb{C}} with no critical values other than 0 or 1 (and more generally, after normalization, any polynomial with at most two critical values) may be associated with a dessin d’enfant which is a one-face hypermap, i.e., a plane tree. (This is because any polynomial has a unique pole, at \infty.) For example, the dessin d’enfant representing f(x)=x nf(x) = x^n is the “star-tree”, containing one black vertex surrounded by nn white vertices.

  • It is well known that the bipartite graph K 3,3K_{3,3} is non-planar, so does not embed in the 2-sphere, but will embed in the torus, in such a way that its complement is a disjoint union of discs.

Remark

The original work was stated in terms of objects called cellular maps?, and the category of these cellular maps and isotopy classes of morphisms between them was shown to correspond to a category of finite 𝔾\mathbb{G}-sets where 𝔾\mathbb{G} is a group called the cartographic group?, which has a simple presentation in terms of operations of a geometric / combinatorial nature.

A translated extract

(from the Esquisse d'un programme describing the idea as seen by Grothendieck:)

“My interest in topological surfaces began to appear in 1974, when I proposed to Yves Ladegaillerie the theme of the isotopic study of embeddings of a topological 1-complex into a compact surface. Over the two following years, this study led him to a remarkable isotopy theorem, giving a complete algebraic description of the isotopy classes of embeddings of such 1-complexes, or compact surfaces with boundary, in a compact oriented surface, in terms of certain very simple combinatorial invariants, and the fundamental groups of the protagonists. This theorem, which should be easily generalisable to embeddings of any compact space (triangulable to simplify) in a compact oriented surface, gives as easy corollaries several deep classical results in the theory of surfaces, and in particular Baer’s isotopy theorem.

In the work of Ladegaillerie there is also a purely algebraic description, in terms of fundamental groups, of the “isotopic” category of compact surfaces X , equipped with a topological 1-complex K embedded in X . This description, which had the misfortune to run counter to ‘’today’s taste’‘ and because of this appears to be unpublishable, nevertheless served (and still serves) as a precious guide in my later reflections, particularly in the context of absolute algebraic geometry in characteristic zero.“

References

The Wikipedia page on this is:

Fairly elementary sources for background material include:

  • Arthur T. White: 1984 Graphs, groups and surfaces

This gives the Edmonds algorithm for the embedding. the original source for that is:

  • J. Edmonds (1960), A combinatorial representation for polyhedral surfaces, Notices Amer. Math. Soc. 7, 646.

References on the deeper theory as developed by Grothendieck and his students, and including summaries of subsequent work, include:

  • L. Schneps, ed., 1994, The Grothendieck theory of dessins d’enfants, volume 200 of London Mathematical Society Lecture Note Series , Cambridge University Press, Cambridge, papers from the Conference on Dessins d’Enfant held in Luminy, April 19–24, 1993

  • Marco Robalo, Galois Theory towards Dessins d’Enfants (pdf)

  • F. Herrlich, G. Schmithüsen: Dessins d’enfants and Origami curves

The original work on the elementary theory was contained in

  • Christine Voisin?, Jean Malgoire?, Cartes cellulaires, Cahiers Mathématiques, 12, Montpellier, 1977.

  • Christine Voisin?, Jean Malgoire?, Factorisation de Stein topologique, découpe, Cahiers Mathématiques, 15, Montpellier, 1979.

  • Christine Voisin?, Jean Malgoire?, Cartes topologiques infinies et revêtements ramifiés de la sphère, Cahiers Mathématiques, 19, Montpellier, 1980.

Other modern textbook accounts include:

  • Sergei K. Lando, Alexander K. Zvonkin, Graphs on Surfaces and Their Applications, Springer, 2004.

  • E. Girondo, G. González-Diez, Introduction to compact Riemann surfaces and dessins d’enfants, London Mat. Soc. Student Texts 79, Cambridge Univ. Press 2012. xii+298 pp.

References on the history of dessins d’enfants

  • Lieven Le Bruyn, Klein’s dessins d’enfant and the buckyball, 2008. web

Connection to matrix model?s and integrable hierarchies is discussed in

  • Jan Ambjørn, Leonid Chekhov, The matrix model for dessins d’enfants, arxiv/1404.4240

Revised on September 28, 2014 14:10:13 by Noam Zeilberger (176.189.43.179)