Rotation system

In combinatorial mathematics, rotation systems (also called combinatorial embeddings) encode embeddings of graphs onto orientable surfaces by describing the circular ordering of a graph's edges around each vertex. A more formal definition of a rotation system involves pairs of permutations; such a pair is sufficient to determine a multigraph, a surface, and a 2-cell embedding of the multigraph onto the surface.

Every rotation scheme defines a unique 2-cell embedding of a connected multigraph on a closed oriented surface (up to orientation-preserving topological equivalence). Conversely, any embedding of a connected multigraph G on an oriented closed surface defines a unique rotation system having G as its underlying multigraph. This fundamental equivalence between rotation systems and 2-cell-embeddings was first settled in a dual form by Lothar Heffter in the 1890s^[1] and extensively used by Ringel during the 1950s.^[2] Independently, Edmonds gave the primal form of the theorem^[3] and the details of his study have been popularized by Youngs.^[4] The generalization to multigraphs was presented by Gross and Alpert.^[5]

Rotation systems are related to, but not the same as, the rotation maps used by Reingold et al. (2002) to define the zig-zag product of graphs. A rotation system specifies a circular ordering of the edges around each vertex, while a rotation map specifies a (non-circular) permutation of the edges at each vertex. In addition, rotation systems can be defined for any graph, while as Reingold et al. define them rotation maps are restricted to regular graphs.

Formal definition[]

Formally, a rotation system is defined as a pair (σ,θ) where σ and θ are permutations acting on the same ground set B, θ is a fixed-point-free involution, and the group <σ,θ> generated by σ and θ acts transitively on B.

To derive a rotation system from a 2-cell embedding of a connected multigraph G on an oriented surface, let B consist of the darts (or flags, or half-edges) of G; that is, for each edge of G we form two elements of B, one for each endpoint of the edge. Even when an edge has the same vertex as both of its endpoints, we create two darts for that edge. We let θ(b) be the other dart formed from the same edge as b; this is clearly an involution with no fixed points. We let σ(b) be the dart in the clockwise position from b in the cyclic order of edges incident to the same vertex, where "clockwise" is defined by the orientation of the surface.

If a multigraph is embedded on an orientable but not oriented surface, it generally corresponds to two rotation systems, one for each of the two orientations of the surface. These two rotation systems have the same involution θ, but the permutation σ for one rotation system is the inverse of the corresponding permutation for the other rotation system.

Recovering the embedding from the rotation system[]

To recover a multigraph from a rotation system, we form a vertex for each orbit of σ, and an edge for each orbit of θ. A vertex is incident with an edge if these two orbits have a nonempty intersection. Thus, the number of incidences per vertex is the size of the orbit, and the number of incidences per edge is exactly two. If a rotation system is derived from a 2-cell embedding of a connected multigraph G, the graph derived from the rotation system is isomorphic to G.

To embed the graph derived from a rotation system onto a surface, form a disk for each orbit of σθ, and glue two disks together along an edge e whenever the two darts corresponding to e belong to the two orbits corresponding to these disks. The result is a 2-cell embedding of the derived multigraph, the two-cells of which are the disks corresponding to the orbits of σθ. The surface of this embedding can be oriented in such a way that the clockwise ordering of the edges around each vertex is the same as the clockwise ordering given by σ.

Characterizing the surface of the embedding[]

According to the Euler formula we can deduce the genus g of the closed orientable surface defined by the rotation system ${\displaystyle (\sigma ,\theta )}$ (that is, the surface on which the underlying multigraph is 2-cell embedded).^[6] Notice that ${\displaystyle V=|Z(\sigma )|}$, ${\displaystyle E=|Z(\theta )|}$ and ${\displaystyle F=|Z(\sigma \theta )|}$. We find that

${\displaystyle g=1-{\frac {1}{2}}(V-E+F)=1-{\frac {1}{2}}(|Z(\sigma )|-|Z(\theta )|+|Z(\sigma \theta )|)}$

where ${\displaystyle Z(\phi )}$ denotes the set of the orbits of permutation ${\displaystyle \phi }$.

See also[]

• Combinatorial map

Notes[]

References[]

• R. Cori & A. Machì (1992). "Maps, hypermaps and their automorphisms: a survey". Expositiones Mathematicae. 10: 403–467. MR 1190182.
• J. Edmonds (1960). "A combinatorial representation for polyhedral surfaces". Notices of the American Mathematical Society. 7: 646.
• Edmonds, John Robert (1960). A combinatorial representation for oriented polyhedral surfaces (PDF) (Masters). University of Maryland.
• J. L. Gross & S. R. Alpert (1974). "The topological theory of current graphs". Journal of Combinatorial Theory, Series B. 17 (3): 218–233. doi:10.1016/0095-8956(74)90028-8. MR 0363971.
• L. Heffter (1891). "Über das Problem der Nachbargebiete". Mathematische Annalen. 38 (4): 477–508. doi:10.1007/BF01203357. S2CID 121206491.
• L. Heffter (1898). "Über metacyklische Gruppen und Nachbarcontigurationen". Mathematische Annalen. 50 (2–3): 261–268. doi:10.1007/BF01448067. S2CID 120691296.
• Lando, Sergei K.; Zvonkin, Alexander K. (2004). Graphs on Surfaces and Their Applications. Encyclopaedia of Mathematical Sciences: Lower-Dimensional Topology II. 141. Berlin, New York: Springer-Verlag. ISBN 978-3-540-00203-1..
• Bojan Mohar and Carsten Thomassen (2001). Graphs on Surfaces. The Johns Hopkins University Press. ISBN 0-8018-6689-8.
• O. Reingold; S. Vadhan & A. Wigderson (2002). "Entropy waves, the zig-zag graph product, and new constant-degree expanders". Annals of Mathematics. 155 (1): 157–187. arXiv:math/0406038. doi:10.2307/3062153. JSTOR 3062153. MR 1888797. S2CID 120739405.
• G. Ringel (1965). "Das Geschlecht des vollständigen paaren Graphen". Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg. 28 (3–4): 139–150. doi:10.1007/BF02993245. MR 0189012. S2CID 120414651.
• J. W. T. Youngs (1963). "Minimal imbeddings and the genus of a graph". Journal of Mathematics and Mechanics. 12 (2): 303–315. doi:10.1512/iumj.1963.12.12021. MR 0145512.