1 / 27

Operations on Maps

Operations on Maps. Maps and Flags. There are three fixed point free involutions defined on F M: t 0 , t 1 , t 2 . Axioms for maps: A1: < t 0 , t 1 , t 2 > acts transitivley. A2: t 0 t 2 = t 2 t 0 is fixedpoint free involution.

zilya
Télécharger la présentation

Operations on Maps

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Operations on Maps

  2. Maps and Flags • There are three fixed point free involutions defined on F M: t0,t1,t2. • Axioms for maps: • A1: < t0,t1,t2> acts transitivley. • A2: t0t2 = t2t0 is fixedpoint free involution. • There are four flags per edge: f, t0(f), t2(f), t2( t0(f)) = t0( t2(f)). t2(f) t2t0(f) f t0(f) t1(f)

  3. Flag Systems are General • One may use flag systems to describe nonorientable surfaces such as Möbius bands or even complexes that are not surfaces, such as books!

  4. f v e Du f v e Dual Du • Dual Du interchanges the role of vertices and faces and keeps the role of edges. • For instance the dual of a cube is octahedron.

  5. f v e Du f v e Dual Du - continued • Only the labelings on the flags are changed. • The exact definition is given by the matrix on the left.

  6. Tru f f v v e e Truncation Tru • Truncation Tru chops away each vertex and replaces it by a polygon. • For instance the eitght corners of a cube are replaced by triangles. Former 4-gons transform into 8-gons.

  7. Tru f f v v e e Truncation Tru - continued • Each flag is replaced by three flags. • The exact definition is given by the three matrices on the left.

  8. Me f f v v e e Medial Me • Medial Me chops away each vertex and replaces it by a polygon but it does it in such a way that no original edges are left. • The resulting map is fourvalent and has bipartite dual.

  9. Me f f v v e e Medial Me - continued • Each flag is replaced by two flags. • The exact definition is given by the two matrices on the left.

  10. Composite Transformations • Obviously we may combine two or more transformations into a composite transformation. If S and T are two transformations then S o T (F) = S(T(F)). • Here are some examples:

  11. Rules for Composite Operations • Rule:Let M1, M2, ...be matrices defining transformation T and let N1, N2, ... be matrices that define S. Then the composite transformation T o S is defined by the set of all pairwise matrix products M1N1, M1N2, ..., M2N1, M2N2, ...

  12. Twodimensional subdivision Su2 • As we defined earlier Su2 = Du o Tru o Du • It is interesting that many early gothic blueprints of churches contain transformation Su2 on the infinite square grid.

  13. The Gothic Transformation • Go = Du o Me o Tru • The resulting graph is bipartite with quadrilateral faces. • This transformation can be found on the ceilings of various late gothic churches in Slovenia. • Note that there are 6 matrices needed in order to define Go.

  14. Two Examples

  15. Slika 20. Operacija Go nad šestkotniki na stropu neke angleške hiše iz 18. stoletja. Strawberry Fields Gothic transformation over hexagons on a ceiling of an 18 century mansion in England.

  16. The Gothic Cube • The results of Go on the cube are visible on the left. • We can apply it to any tiling or polyhedron.

  17. Su1 f f v v e e Onedimensional subdivision Su1 • Onedimensional subdivision Su1 inserts a vertex in the midpoint of each edge. • The resulting map is bipartite.

  18. More Composite Transformations • We extend our table of composite operations

  19. Representations of flag systems • Let F be a flag system and let r:VF! V be a vertex representation. We can extend the representation in the following way. • For each element e from E or (F) • r(e) = apex{r(v)| v ~ e}.

  20. A Local Example • The pattern on the left can be obtained from a usual hexagonal tiling:

  21. The Seattle Transformation MetaSeattle = { {Metaef,Metavf2,Metaf}, {Metaef,Metae2f,Metavf}, {Metae,Metave,Metavf}, {Metav,Metave,Metavf}, {Metae,Metae2f,Metavf}, {Metaef,Metavf2,Metavf} }; Seattle[m_SurfaceMap] := TransformS[MetaSeattle,m];

  22. Seattle on Penrose Tiles

  23. Matrices and representations • Let F be a flag system with representation r and let T be a transformation (defined by some set of matrices). • R can be extended to a representation of T(F) as follows: • The interpretation r on T(F) is determined in three steps: • Using matrices we get the first representation. • We keep only the vertex part • We extend it by the apex construction to the final representation.

  24. The Möbius-Kantor graph • Here is the generalized Petersen graph G(8,3), also known as the Möbius-Kantor graph. It is the Levi graph of the Möbius-Kantor configuration, the only (83) configuration.

  25. The Möbius-Kantor graph, Map M on the surface of genus 2. • The Möbius-Kantor graph gives rise to the only cubic regular map M of genus 2 (of type {3,8}) . The faces are octagons. • We are showing the Figure 3.6c of Coxeter and Moser. • The fundamental polygon is abcda-1 b-1 c-1 d-1

  26. Co(M) = Du(BS(M)) = Du(Su2(Su1(M))). • The skeleton of Co(M) is a trivalent graph on 96 vertices. It is the Cayley graph for the group • <x,y,z| x2 = y2 = z2 = (xz)2 = (yz)3= (xz)4=1> • This is Tucker’s group, the ONLY group of genus 2.

  27. My Project at Colgate • I am working with a sculptor, two arts students and math students to build a model of this Cayley graph on a double torus.

More Related