The hexagonal hosohedron, a regular map on the sphere with two vertices, six edges, six faces, and 24 flags.
The regular map {6,3}4,0 on the torus with 16 faces, 32 vertices and 48 edges.

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

edit

Regular maps are typically defined and studied in three ways: topologically, group-theoretically, and graph-theoretically.

Topological approach

edit

Topologically, a map is a 2-cell decomposition of a compact connected 2-manifold.[1]

The genus g, of a map M is given by Euler's relation which is equal to if the map is orientable, and 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

edit

Group-theoretically, the permutation representation of a regular map M is a transitive permutation groupย C, on a set of flags, generated by three fixed-point free involutions r0, r1, r2 satisfying (r0r2)2= I. In this definition the faces are the orbits of Fย =ย <r0,ย r1>, edges are the orbits of Eย =ย <r0,ย r2>, and vertices are the orbits of Vย =ย <r1,ย r2>. 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

edit

Graph-theoretically, a map is a cubic graph with edges coloured blue, yellow, red such that: is connected, every vertex is incident to one edge of each colour, and cycles of edges not coloured yellow have length 4. Note that is the flag graph or graph-encoded map (GEM) of the map, defined on the vertex set of flags and is not the skeleton G = (V,E) of the map. In general, || = 4|E|.

A map M is regular if 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 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

edit
The hemicube, a regular map.
  • The great dodecahedron is a regular map with pentagonal faces in the orientable surface of genus 4.
  • The hemicube is a regular map of type {4,3} in the projective plane.
  • The hemi-dodecahedron is a regular map produced by pentagonal embedding of the Petersen graph in the projective plane.
  • The p-hosohedron is a regular map of type {2,p}.
  • The Dyck map is a regular map of 12 octagons on a genus-3 surface. Its underlying graph, the Dyck graph, can also form a regular map of 16 hexagons in a torus.

The following is a complete list of regular maps in surfaces of positive Euler characteristic, ฯ‡: the sphere and the projective plane.[2]

ฯ‡gSchlรคfliVert.EdgesFacesGroupOrderGraphNotes
20{p,2}pp2C2 ร— Dihp4pCpDihedron
20{2,p}2ppC2 ร— Dihp4pp-fold K2Hosohedron
20{3,3}464S424K4Tetrahedron
20{4,3}8126C2 ร— S448K4 ร— K2Cube
20{3,4}6128C2 ร— S448K2,2,2Octahedron
20{5,3}203012C2 ร— A5120Dodecahedron
20{3,5}123020C2 ร— A5120K6 ร— K2Icosahedron
1n1{2p,2}/2pp1Dih2p4pCpHemi-dihedron[3]
1n1{2,2p}/22ppDih2p4pp-fold K2Hemi-hosohedron[3]
1n1{4,3}/2463S424K4Hemicube
1n1{3,4}/2364S4242-fold K3Hemioctahedron
1n1{5,3}/210156A560Petersen graphHemidodecahedron
1n1{3,5}/261510A560K6Hemi-icosahedron

The images below show three of the 20 regular maps in the triple torus, labelled with their Schlรคfli types.

Toroidal polyhedra

edit
Example visualized as nets

{4,4}1,0
(v:1, e:2, f:1)

{4,4}1,1
(v:2, e:4, f:2)

{4,4}2,0
(v:4, e:8, f:4)

{4,4}2,1
(v:5, e:10, f:5)

{4,4}2,2
(v:8, e:16, f:8)

{3,6}1,0
(v:1, e:3, f:2)

{3,6}1,1
(v:3, e:9, f:6)

{3,6}2,0
(v:4, e:12, f:8)

{3,6}2,1
(v:7, e:21, f:14)

{3,6}2,2
(v:12, e:36, f:24)

{6,3}1,0
(v:2, e:3, f:1)

{6,3}1,1
(v:6, e:9, f:3)

{6,3}2,0
(v:8, e:12, f:4)

{6,3}2,1
(v:14, e:21, f:7)

{6,3}2,2
(v:24, e:36, f:12)

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}.[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.[5] 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.

Regular maps with zero Euler characteristic[6]
ฯ‡gSchlรคfliVert.EdgesFacesGroupOrderNotes
01{4,4}b,0
n=b2
n2nn[4,4](b,0)8nFlat toroidal polyhedra
Same as {4,4 | b}
01{4,4}b,b
n=2b2
n2nn[4,4](b,b)8nFlat toroidal polyhedra
Same as rectified {4,4 | b}
01{4,4}b,c
n=b2+c2
n2nn[4,4]+
(b,c)
4nFlat chiral toroidal polyhedra
01{3,6}b,0
t=b2
t3t2t[3,6](b,0)12tFlat toroidal polyhedra
01{3,6}b,b
t=3b2
t3t2t[3,6](b,b)12tFlat toroidal polyhedra
01{3,6}b,c
t=b2+bc+c2
t3t2t[3,6]+
(b,c)
6tFlat chiral toroidal polyhedra
01{6,3}b,0
t=b2
2t3tt[3,6](b,0)12tFlat toroidal polyhedra
01{6,3}b,b
t=3b2
2t3tt[3,6](b,b)12tFlat toroidal polyhedra
01{6,3}b,c
t=b2+bc+c2
2t3tt[3,6]+
(b,c)
6tFlat chiral toroidal polyhedra

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 {2p,q}, the paths (b,c) can be defined as stepping face-edge-face in straight lines, while the dual {p,2q} forms will see the paths (b,c) as stepping vertex-edge-vertex in straight lines.

Hyperbolic regular maps

edit
The map {6,4}3 can be seen as {6,4}4,0. Following opposite edges will traverse all 4 hexagons in sequence. It exists in the petrial octahedron, {3,4}ฯ€ with 6 vertices, 12 edges and 4 skew hexagon faces.
Branko Grรผnbaum identified a double-covered cube {8/2,3}, with 6 octagonal faces, double wrapped, needing 24 edges, and 16 vertices. It can be seen as regular map {8,3}2,0 on a hyperbolic plane with 6 colored octagons.[7]

See also

edit

References

edit
  1. ^ Nedela (2007)
  2. ^ Coxeter & Moser (1980)
  3. ^ a b Sรฉquin (2013)
  4. ^ Coxeter 1980, 8.3 Maps of type {4,4} on a torus.
  5. ^ Coxeter 1980, 8.4 Maps of type {3,6} or {6,3} on a torus.
  6. ^ Coxeter and Moser, Generators and Relations for Discrete Groups, 1957, Chapter 8, Regular maps, 8.3 Maps of type {4,4} on a torus, 8.4 Maps of type {3,6} or {6,3} on a torus
  7. ^ "Are Your Polyhedra the Same as My Polyhedra?" (PDF). Archived from the original (PDF) on 2018-11-26.

Bibliography

edit

๐Ÿ“š Artikel Terkait di Wikipedia

Regular map

polynomial function of algebraic varieties a regular map (graph theory), a symmetric 2-cell embedding of a graph into a closed surface This disambiguation

Regular

large graphs Regular language, a formal language recognizable by a finite state automaton (related to the regular expression) Regular map (graph theory),

Distance-regular graph

In the mathematical field of graph theory, a distance-regular graph is a regular graph such that for any two vertices v and w, the number of vertices

Klein graphs

In the mathematical field of graph theory, the Klein graphs are two different but related regular graphs, each with 84 edges. Each can be embedded in

Graph theory

computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context

Petersen graph

bridgeless graph has a cycle-continuous mapping to the Petersen graph. More unsolved problems in mathematics In the mathematical field of graph theory, the

Snark (graph theory)

In the mathematical field of graph theory, a snark is an undirected graph with exactly three edges per vertex whose edges cannot be colored with only three

Heawood graph

mathematical field of graph theory, the Heawood graph is an undirected graph with 14 vertices and 21 edges, named after Percy John Heawood. The graph is cubic, and