Regular map (graph theory)

In mathematics, a regular map is a symmetric tessellation of a closed surface. More precisely, a regular map is a decomposition of a two-dimensional manifold (such as a sphere, torus, or real projective plane) into topological disks such that every flag (an incident vertex-edge-face triple) can be transformed into any other flag by a symmetry of the decomposition. Regular maps are, in a sense, topological generalizations of Platonic solids. The theory of maps and their classification is related to the theory of Riemann surfaces, hyperbolic geometry, and Galois theory. Regular maps are classified according to either: the genus and orientability of the supporting surface, the underlying graph, or the automorphism group.
Overview.
Regular maps are typically defined and studied in three ways: topologically, group-theoretically, and graph-theoretically.
Topological approach.
Topologically, a map is a 2-cell decomposition of a closed compact 2-manifold.
The genus g, of a map M is given by Euler's relation formula_1 which is equal to formula_2 if the map is orientable, and formula_3 if the map is non-orientable. It is a crucial fact that there is a finite (non-zero) number of regular maps for every orientable genus except the torus.
Group-theoretical approach.
Group-theoretically, the permutation representation of a regular map "M" is a transitive permutation group "C", on a set formula_4 of flags, generated by three fixed-point free involutions "r"0, "r"1, "r"2 satisfying (r0r2)2= I. In this definition the faces are the orbits of "F" = "<"r0, "r"1>, edges are the orbits of "E" = <"r"0, "r"2>, and vertices are the orbits of "V" = <"r"1, "r"2>. More abstractly, the automorphism group of any regular map is the non-degenerate, homomorphic image of a <2,m,n>-triangle group.
Graph-theoretical approach.
Graph-theoretically, a map is a cubic graph formula_5 with edges coloured blue, yellow, red such that: formula_5 is connected, every vertex is incident to one edge of each colour, and cycles of edges not coloured yellow have length 4. Note that formula_5 is the "flag graph" or graph-encoded map (GEM) of the map, defined on the vertex set of flags formula_4 and is not the skeleton G = (V,E) of the map. In general, |formula_4| = 4|E|.
A map M is regular iff Aut(M) acts regularly on the flags. Aut("M") of a regular map is transitive on the vertices, edges, and faces of "M". A map "M" is said to be reflexible iff Aut("M") is regular and contains an automorphism formula_10 that fixes both a vertex "v" and a face "f", but reverses the order of the edges. A map which is regular but not reflexible is said to be chiral.
Examples.
The following is a complete list of regular maps in surfaces of positive Euler characteristic, χ: the sphere and the projective plane.
The images below show three of the 20 regular maps in the triple torus, labelled with their Schläfli symbols.
Toroidal polyhedra.
Regular maps exist as torohedral polyhedra as finite portions of Euclidean tilings, wrapped onto the surface of a duocylinder as a flat torus. These are labeled {4,4}"b","c" for those related to the square tiling, {4,4}. {3,6}"b","c" are related to the triangular tiling, {3,6}, and {6,3}"b","c" related to the hexagonal tiling, {6,3}. "b" and "c" are whole numbers. There are 2 special cases ("b",0) and ("b","b") with reflective symmetry, while the general cases exist in chiral pairs ("b","c") and ("c","b").
Regular maps of the form {4,4}"m",0 can be represented as the finite regular skew polyhedron {4,4 | "m"}, seen as the square faces of a "m"×"m" duoprism in 4-dimensions.
Here's an example {4,4}8,0 mapped from a plane as a chessboard to a cylinder section to a torus. The projection from a cylinder to a torus distorts the geometry in 3 dimensions, but can be done without distortion in 4-dimensions.
In generally regular toroidal polyhedra {"p","q"}"b","c" can be defined if either "p" or "q" are even, although only euclidean ones above can exist as toroidal polyhedra in 4-dimensions. In {2"p","q"}, the paths ("b","c") can be defined as stepping face-edge-face in straight lines, while the dual {"p",2"q"} forms will see the paths ("b","c") as stepping vertex-edge-vertex in straight lines.