Computing presentations of Fuchsian groups via fat-graphs (Q5947328): Difference between revisions

The concept of a ``graphe rubané'' is also known under the name of map (embedded graph) on a surface or of ribbon graph. Purely combinatorially, it can be described by two bijections of a finite set (the oriented edges): an involution \(\sigma_0\) mapping each edge to its inverse, and a map \(\sigma_1\) defining the vertices by giving the cyclic order (permutation) of edges in a planar neighbourhood of each vertex (the faces of the map are then given by the cycles of \(\sigma_1\circ\sigma_0^{-1}\)). Using the theory of such graphs, it is shown in the present paper how one can derive combinatorially, from a given fundamental polyhedron and its side-pairing transformations of a finitely generated Fuchsian group (a discrete group of isometries of the hyperbolic plane), a standard geometrical presentation of this Fuchsian group (that is the usual standard presentation in terms of the genus, the number and orders of elliptic generators and the number of parabolic and hyperbolic generators corresponding to the punctures resp. holes of the quotient surface).