The exotic dodecahedron M 0,5 (R) David P. Roberts University of Minnesota, Morris

Size: px
Start display at page:

Download "The exotic dodecahedron M 0,5 (R) David P. Roberts University of Minnesota, Morris"

Transcription

1 The exotic dodecahedron M 0,5 (R) David P. Roberts University of Minnesota, Morris J ai commencé a regarder M 0,5 à des moments perdus, c est un véritable joyau, d une géométrie très riche étroitement liée à celle de l icosaédre. A. Grothendieck, Esquisse d un Programme 1. The exotic dodecahedron via tiling 2. The exotic dodecahedron via crosscapping standard surfaces 3. The exotic dodecahedron via real algebraic geometry 4. Hints of deeper matters: M 0,5 (Z[ P 1 ]) and π 1 (M 0,5 (C), ). 1

2 1. M 0,5 (R) via tiling. Twelve pentagonal tiles colored with five colors satisfying obvious rules: 2

3 The group S 5 = Sym{R, O, G, B, V } acts on the twelve tiles, as in e.g., (R, O)[top left] = (R, O)[R, O, G, B, V ] = [O, R, G, B, V ] = [R, G, B, V, O] = [R, O, V, B, G] = [bottom right] 3

4 The alternating group A 5 stabilizes the two indicated subsets of six tiles. Also each tile [abcde] has an opposite tile [acebd], where neighboring colors in a given tile are non-neighboring colors in its opposite and vice versa. 4

5 To make the standard dodecahedron follow the gluing rule: (touching edges match colors and there are three colors at each of two touching vertices, as in picture). Each piece determines the other. Theorem. Continuing this process yields the standard dodecahedron with three faces meeting at each vertex. Two collections of six tiles of the same parity are used. 5

6 To make the exotic dodecahedron follow the gluing rule: (touching edges match colors, touching vertices match colors, adjacent edges don t match, as in picture). Each piece determines the other. Theorem. Continuing this process yields the exotic dodecahedron with four faces meeting at each vertex. The twelve tiles are each used once. 6

7 Eleven tiles forming pentagaman. Gluing and including a twelfth pentagon appropriately forms either dodecahedron. 7

8 Similarities and differences: Standard Exotic dodecahedron D dodecahedron M 0,5 (R) 12 pentagonal tiles 12 pentagonal tiles 30 edges 30 edges 20 vertices 15 vertices Orientable Nonorientable Euler char. is 2 Euler char. is 3 Sym. group is A 5 C 2 Sym. group is S 5 Notations finally explained: M 0,5 (R) is a disconnected surface consisting of the twelve open pentagons. M 0,5 (R) M 0,5 (R) is a graph consisting of thirty edges and fifteen vertices. It is better thought of as ten circles meeting at fifteen points. 8

9 2. M 0,5 (R) as surfaces with cross-caps. We now study only the exotic dodecahedron and switch conventions to bring out its special features. Replacing our previous tile it now would be natural to use To simplify, we use only the colored star. 9

10 Toroidal view. The drawn square has symmetry group V = (R, O), (G, B). Its compactification the torus has the larger symmetry group S 2 S 3 with orbits {R, O} and {G, B, V }. The exotic dodecahedron M 0,5 (R) is the torus blown up at the three black triple points. 10

11 Projective view. The drawn disk has D 4 = (R, G, O, B), (B, G) symmetry. Its compactification the projective plane has S 4 symmetry belonging to the partition {{R, O, G, B}, {V }}. The exotic dodecahedron is M 0,5 (R) is the torus blown up at the four black triple points. 11

12 Summary of views. For the standard dodecahedron, the group A 5 of rotational symmetries can be visually understood all at once. The rest of the symmetry group can be understood by means of reflections. For the exotic dodecahedron, our visual understanding is more abstract: Euclidean Larger Symmetry Symmetry View E E H H Pentagaman C 5 5 F 5 20 Torus with three CC V 4 S 2 S 3 12 Plane with four CC D 4 8 S 4 24 Each of our three viewpoints breaks the symmetry so that the full group S 5 of symmetries is not visually evident. Instead we have a group E S 5 of completely obvious Euclidean symmetries and a larger group H S 5 of symmetries which requires a bit more imagination to see. 12

13 3. M 0,5 (R) via real algebraic geometry. A broad context: In algebraic geometry, the schemes M g,n are very important. They have relative dimension 3g 3 + n 0 over Spec Z. The schemes M g,n determine sets M g,n (K) for any field K. The key property of these sets is that if K is algebraically closed then M g,n (K) is the set of isomorphism classes of smooth genus g curves over K with n marked points. The schemes M g,n have natural compactifications M g,n in terms of minimally singular curves called stable curves. We are concerned with the case g = 0 today. The first case outside of the g = 0 context is M 1,1 which classifies the elliptic curves. One has M 1,1 (K) = K and M 1,1 (K) = K { }. 13

14 Direct description of M 0,n and M 0,n. Cases with g = 0 can be described directly in terms of P 1 (K) = K { }. Let C 0,n (K) = { (x 1,..., x n ) P 1 (K) : the x i are all different}. Then the desired moduli sets are obtained by quotienting by fractional linear transformations: M 0,n (K) = C 0,n (K)/P GL 2 (K). The slightly larger sets M 0,n (K) have a similar direct description. Relevant for us is that M 0,5 (K) M 0,5 (K) consists of ten projective lines meeting at 15 points. While the five points are generically all different, x i = x j over L ij (K). Also x i = x j and x k = x l over the single intersection point P ij,kl (K) = L ij (K) L kl (K). More degenerate configurations, such as x i = x j = x k are not relevant because they are not stable. 14

15 Very direct description of M 0,n and M 0,n. The fact that any triple (x 1, x 2, x 3 ) of distinct points in P 1 (K) can be taken to the standard triple (0, 1, ) by a unique fractional linear transformation in P GL 2 (K) lets one be even more explicit. In the example relevant for us (x 1, x 2, x 3, x 4, x 5 ) can be uniquely normalized to (0, 1,, s, t). Accordingly M 0,5 (K) = {s, t K {0, 1} : s t}. We color the five points via 0, 1,, s, t. The very direct description is ideal in many respects, but it obscures the S 5 action which is still present. For example, there is still a line L 01 (R) at infinity, corresponding to where the points called 0 and 1 collide. The toroidal and projective views can now be revisited with everything generalized from R to K and given algebro-geometric meaning (something with no analog for the standard dodecahedron!). 15

16 Toroidal viewpoint revisited: there are five projections M 0,5 P 1 : d 0s 1s c st E F 0 1t a b C D 1 0t s e f B A 0: red lines through (1, 1), 1: orange lines through (0, 0), : green hyperbolas, s: blue horizontal lines, t: violet vertical lines. 16

17 4. Hints of deeper matters. Arithmetic. Sets M g,n (R) are defined for any ring. For example, for R a domain, M 0,5 (R) = { (s, t) R 2 : s, t, (s 1), (t 1), and (s t) are all invertible.} An interesting case is when R = Z[ P 1 ] is the ring obtained from Z by inverting all primes in a finite set P. Then Z[ P 1 ] is known to be finite and a natural arithmetic problem is to identify it. Example: P = {2, 3}. Then clearly ( 3 1, 2 3 ) and ( 1 4, 3 4 ) are both in M 1 0,5(Z[ ]). Each gives an {2,3} S 5 -orbit, which has only 60 elements because each is stabilized by the involution (s, t) (1 t, 1 s) of M 0,5. These two orbits form all of M 0,5 (Z[ as drawn above {2,3} ]),

18 Larger example: The set M 0,5 (Z[ points: 1 {2,3,5,7} ]) has 18

19 Topology. Suppose given a monic polynomial f(s, t, x) C[s, t, x] where s and t are viewed as a parameters and x as a variable. Suppose its discriminant has the special form D(s, t) = Cs (s 1) t (t 1) (t s). Then a standard and important question is how the root sets X s,t C vary as (s, t) varies over M 0,5 (C) C 2. For visualization, define C 1.5 = {(s, t) C 2 : Im(s) = Im(t)} Let parameters vary in M 0,5 (C) C 1.5, with Re(s) and Re(t) as horizontal variables and h = Im(s) as a vertical variable. Then M 0,5 (C) C 1.5 consists of an upper half space h > 0 and a lower half space h < 0 connected by the twelve components of M 0,5 (R) at h = 0 viewed as windows. Work with base point = (i, i). Then the issue is how roots permute themselves as one leaves the upper half space through a window and comes back through a different window. 19

20 If f(s, t, x) R[s, t, x], one has 12 complex conjugation operators σ L on X, indexed by faces. Carefully making choices, use them to define 10 monodromy operators, e.g. m s0 = σ d σ E (= σ C σ a, σ B σ f ) m 1 = σ C σ f ( other choices) m st = σ a σ D ( other choices) Have these monodromy operators even when f(s, t, x) R[s, t, x]. s 0 1 The diagram organizes many properties and non-properties of the m ij, e.g. t m ij1 m ij2 m ij3, m ij4 = 1 is only guaranteed when j 1, j 2, j 3, j 4 circle i in a counterclockwise order. 20

A simple problem that has a solution that is far deeper than expected!

A simple problem that has a solution that is far deeper than expected! The Water, Gas, Electricity Problem A simple problem that has a solution that is far deeper than expected! Consider the diagram below of three houses and three utilities: water, gas, and electricity. Each

More information

Combinatorial Maps. University of Ljubljana and University of Primorska and Worcester Polytechnic Institute. Maps. Home Page. Title Page.

Combinatorial Maps. University of Ljubljana and University of Primorska and Worcester Polytechnic Institute. Maps. Home Page. Title Page. Combinatorial Maps Tomaz Pisanski Brigitte Servatius University of Ljubljana and University of Primorska and Worcester Polytechnic Institute Page 1 of 30 1. Maps Page 2 of 30 1.1. Flags. Given a connected

More information

Arboreal Dessins D enfants David P. Roberts University of Minnesota, Morris. 2. Rational functions and moduli algebras

Arboreal Dessins D enfants David P. Roberts University of Minnesota, Morris. 2. Rational functions and moduli algebras Arboreal Dessins D enfants David P. Roberts University of Minnesota, Morris 1. Warm-up activity: a tree game 2. Rational functions and moduli algebras 3. Dessins d enfants 4. The arboreal case 5. The discriminant

More information

Toric Varieties and Lattice Polytopes

Toric Varieties and Lattice Polytopes Toric Varieties and Lattice Polytopes Ursula Whitcher April 1, 006 1 Introduction We will show how to construct spaces called toric varieties from lattice polytopes. Toric fibrations correspond to slices

More information

6.2 Classification of Closed Surfaces

6.2 Classification of Closed Surfaces Table 6.1: A polygon diagram 6.1.2 Second Proof: Compactifying Teichmuller Space 6.2 Classification of Closed Surfaces We saw that each surface has a triangulation. Compact surfaces have finite triangulations.

More information

CS 177 Homework 1. Julian Panetta. October 22, We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F:

CS 177 Homework 1. Julian Panetta. October 22, We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F: CS 177 Homework 1 Julian Panetta October, 009 1 Euler Characteristic 1.1 Polyhedral Formula We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F: V E + F = 1 First,

More information

Discrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London

Discrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London Discrete Mathematics SECOND EDITION Norman L. Biggs Professor of Mathematics London School of Economics University of London OXFORD UNIVERSITY PRESS Contents PART I FOUNDATIONS Statements and proofs. 1

More information

DIHEDRAL GROUPS KEITH CONRAD

DIHEDRAL GROUPS KEITH CONRAD DIHEDRAL GROUPS KEITH CONRAD 1. Introduction For n 3, the dihedral group D n is defined as the rigid motions 1 of the plane preserving a regular n-gon, with the operation being composition. These polygons

More information

Planar Graphs and Surfaces. Graphs 2 1/58

Planar Graphs and Surfaces. Graphs 2 1/58 Planar Graphs and Surfaces Graphs 2 1/58 Last time we discussed the Four Color Theorem, which says that any map can be colored with at most 4 colors and not have two regions that share a border having

More information

274 Curves on Surfaces, Lecture 5

274 Curves on Surfaces, Lecture 5 274 Curves on Surfaces, Lecture 5 Dylan Thurston Notes by Qiaochu Yuan Fall 2012 5 Ideal polygons Previously we discussed three models of the hyperbolic plane: the Poincaré disk, the upper half-plane,

More information

SETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets.

SETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets. SETS A set is a file of objects which have at least one property in common. The objects of the set are called elements. Sets are notated with capital letters K, Z, N, etc., the elements are a, b, c, d,

More information

Math 462: Review questions

Math 462: Review questions Math 462: Review questions Paul Hacking 4/22/10 (1) What is the angle between two interior diagonals of a cube joining opposite vertices? [Hint: It is probably quickest to use a description of the cube

More information

Planar Graphs, Solids, and Surfaces. Planar Graphs 1/28

Planar Graphs, Solids, and Surfaces. Planar Graphs 1/28 Planar Graphs, Solids, and Surfaces Planar Graphs 1/28 Last time we discussed the Four Color Theorem, which says that any map can be colored with at most 4 colors and not have two regions that share a

More information

6.3 Poincare's Theorem

6.3 Poincare's Theorem Figure 6.5: The second cut. for some g 0. 6.3 Poincare's Theorem Theorem 6.3.1 (Poincare). Let D be a polygon diagram drawn in the hyperbolic plane such that the lengths of its edges and the interior angles

More information

Assignment 8; Due Friday, March 10

Assignment 8; Due Friday, March 10 Assignment 8; Due Friday, March 10 The previous two exercise sets covered lots of material. We ll end the course with two short assignments. This one asks you to visualize an important family of three

More information

An Investigation of Closed Geodesics on Regular Polyhedra

An Investigation of Closed Geodesics on Regular Polyhedra An Investigation of Closed Geodesics on Regular Polyhedra Tony Scoles Southern Illinois University Edwardsville May 13, 2008 1 Introduction This paper was undertaken to examine, in detail, results from

More information

Portraits of Groups on Bordered Surfaces

Portraits of Groups on Bordered Surfaces Bridges Finland Conference Proceedings Portraits of Groups on Bordered Surfaces Jay Zimmerman Mathematics Department Towson University 8000 York Road Towson, MD 21252, USA E-mail: jzimmerman@towson.edu

More information

The Graphs of Triangulations of Polygons

The Graphs of Triangulations of Polygons The Graphs of Triangulations of Polygons Matthew O Meara Research Experience for Undergraduates Summer 006 Basic Considerations Let Γ(n) be the graph with vertices being the labeled planar triangulation

More information

BAR-MAGNET POLYHEDRA AND NS-ORIENTATIONS OF MAPS

BAR-MAGNET POLYHEDRA AND NS-ORIENTATIONS OF MAPS University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Jadranska 19, 1111 Ljubljana, Slovenia Preprint series, Vol. 42 (2004), 940 BAR-MAGNET POLYHEDRA AND NS-ORIENTATIONS

More information

INTRODUCTION TO 3-MANIFOLDS

INTRODUCTION TO 3-MANIFOLDS INTRODUCTION TO 3-MANIFOLDS NIK AKSAMIT As we know, a topological n-manifold X is a Hausdorff space such that every point contained in it has a neighborhood (is contained in an open set) homeomorphic to

More information

DIHEDRAL GROUPS KEITH CONRAD

DIHEDRAL GROUPS KEITH CONRAD DIHEDRAL GROUPS KEITH CONRAD 1. Introduction For n 3, the dihedral group D n is defined as the rigid motions 1 taking a regular n-gon back to itself, with the operation being composition. These polygons

More information

TILING RECTANGLES SIMON RUBINSTEIN-SALZEDO

TILING RECTANGLES SIMON RUBINSTEIN-SALZEDO TILING RECTANGLES SIMON RUBINSTEIN-SALZEDO. A classic tiling problem Question.. Suppose we tile a (large) rectangle with small rectangles, so that each small rectangle has at least one pair of sides with

More information

Given four lines in space, how many lines meet all four?: The geometry, topology, and combinatorics of the Grassmannian

Given four lines in space, how many lines meet all four?: The geometry, topology, and combinatorics of the Grassmannian Atlanta January 5, 2005 Given four lines in space, how many lines meet all four?: The geometry, topology, and combinatorics of the Grassmannian Ravi Vakil, Stanford University http://math.stanford.edu/

More information

Technische Universität München Zentrum Mathematik

Technische Universität München Zentrum Mathematik Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 208 https://www-m0.ma.tum.de/bin/view/lehre/ss8/pgss8/webhome Solutions for

More information

Lecture 5 CLASSIFICATION OF SURFACES

Lecture 5 CLASSIFICATION OF SURFACES Lecture 5 CLASSIFICATION OF SURFACES In this lecture, we present the topological classification of surfaces. This will be done by a combinatorial argument imitating Morse theory and will make use of the

More information

Structure in Quaternions Corresponding to the 4-Dimensional Tetrahedron

Structure in Quaternions Corresponding to the 4-Dimensional Tetrahedron Structure in Quaternions Corresponding to the 4-Dimensional Tetrahedron AJ Friend School of Mathematics Georgia Institute of Technology Atlanta, GA Advised by: Adrian Ocneanu Department of Mathematics

More information

The Cyclic Cycle Complex of a Surface

The Cyclic Cycle Complex of a Surface The Cyclic Cycle Complex of a Surface Allen Hatcher A recent paper [BBM] by Bestvina, Bux, and Margalit contains a construction of a cell complex that gives a combinatorial model for the collection of

More information

CS3621 Midterm Solution (Fall 2005) 150 points

CS3621 Midterm Solution (Fall 2005) 150 points CS362 Midterm Solution Fall 25. Geometric Transformation CS362 Midterm Solution (Fall 25) 5 points (a) [5 points] Find the 2D transformation matrix for the reflection about the y-axis transformation (i.e.,

More information

or else take their intersection. Now define

or else take their intersection. Now define Samuel Lee Algebraic Topology Homework #5 May 10, 2016 Problem 1: ( 1.3: #3). Let p : X X be a covering space with p 1 (x) finite and nonempty for all x X. Show that X is compact Hausdorff if and only

More information

The University of Sydney MATH2008 Introduction to Modern Algebra

The University of Sydney MATH2008 Introduction to Modern Algebra 2 Semester 2, 2003 The University of Sydney MATH2008 Introduction to Modern Algebra (http://www.maths.usyd.edu.au/u/ug/im/math2008/) Lecturer: R. Howlett Computer Tutorial 2 This tutorial explores the

More information

Geometric structures on manifolds

Geometric structures on manifolds CHAPTER 3 Geometric structures on manifolds In this chapter, we give our first examples of hyperbolic manifolds, combining ideas from the previous two chapters. 3.1. Geometric structures 3.1.1. Introductory

More information

Combinatorics: The Fine Art of Counting

Combinatorics: The Fine Art of Counting Week Three Solutions Note: in these notes multiplication is assumed to take precedence over division, so 4!/2!2! = 4!/(2!*2!), and binomial coefficients are written horizontally: (4 2) denotes 4 choose

More information

Technische Universität München Zentrum Mathematik

Technische Universität München Zentrum Mathematik Question 1. Incidence matrix with gaps Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 2016 www-m10.ma.tum.de/projektivegeometriess16

More information

Geometric Constructions

Geometric Constructions HISTORY OF MATHEMATICS Spring 2005 Geometric Constructions Notes, activities, assignment; #3 in a series. Note: I m not giving a specific due date for this somewhat vague assignment. The idea is that it

More information

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter

More information

Chapter 3. Quadric hypersurfaces. 3.1 Quadric hypersurfaces Denition.

Chapter 3. Quadric hypersurfaces. 3.1 Quadric hypersurfaces Denition. Chapter 3 Quadric hypersurfaces 3.1 Quadric hypersurfaces. 3.1.1 Denition. Denition 1. In an n-dimensional ane space A; given an ane frame fo;! e i g: A quadric hypersurface in A is a set S consisting

More information

Notes for Lecture 10

Notes for Lecture 10 COS 533: Advanced Cryptography Lecture 10 (October 16, 2017) Lecturer: Mark Zhandry Princeton University Scribe: Dylan Altschuler Notes for Lecture 10 1 Motivation for Elliptic Curves Diffie-Hellman For

More information

Intersection of an Oriented Box and a Cone

Intersection of an Oriented Box and a Cone Intersection of an Oriented Box and a Cone David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International

More information

TWO CONTRIBUTIONS OF EULER

TWO CONTRIBUTIONS OF EULER TWO CONTRIBUTIONS OF EULER SIEMION FAJTLOWICZ. MATH 4315 Eulerian Tours. Although some mathematical problems which now can be thought of as graph-theoretical, go back to the times of Euclid, the invention

More information

Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 24 Solid Modelling

Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 24 Solid Modelling Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 24 Solid Modelling Welcome to the lectures on computer graphics. We have

More information

3.7. Vertex and tangent

3.7. Vertex and tangent 3.7. Vertex and tangent Example 1. At the right we have drawn the graph of the cubic polynomial f(x) = x 2 (3 x). Notice how the structure of the graph matches the form of the algebraic expression. The

More information

GENERALIZED CPR-GRAPHS AND APPLICATIONS

GENERALIZED CPR-GRAPHS AND APPLICATIONS Volume 5, Number 2, Pages 76 105 ISSN 1715-0868 GENERALIZED CPR-GRAPHS AND APPLICATIONS DANIEL PELLICER AND ASIA IVIĆ WEISS Abstract. We give conditions for oriented labeled graphs that must be satisfied

More information

SECTION 1.3: BASIC GRAPHS and SYMMETRY

SECTION 1.3: BASIC GRAPHS and SYMMETRY (Section.3: Basic Graphs and Symmetry).3. SECTION.3: BASIC GRAPHS and SYMMETRY LEARNING OBJECTIVES Know how to graph basic functions. Organize categories of basic graphs and recognize common properties,

More information

Chapter 5. Transforming Shapes

Chapter 5. Transforming Shapes Chapter 5 Transforming Shapes It is difficult to walk through daily life without being able to see geometric transformations in your surroundings. Notice how the leaves of plants, for example, are almost

More information

Math 443/543 Graph Theory Notes 5: Planar graphs and coloring

Math 443/543 Graph Theory Notes 5: Planar graphs and coloring Math 443/543 Graph Theory Notes 5: Planar graphs and coloring David Glickenstein October 10, 2014 1 Planar graphs The Three Houses and Three Utilities Problem: Given three houses and three utilities, can

More information

Basic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions

Basic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions Basic Combinatorics Math 40210, Section 01 Fall 2012 Homework 4 Solutions 1.4.2 2: One possible implementation: Start with abcgfjiea From edge cd build, using previously unmarked edges: cdhlponminjkghc

More information

A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3

A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 ANDREW J. HANSON AND JI-PING SHA In this paper we present a systematic and explicit algorithm for tessellating the algebraic surfaces (real 4-manifolds) F

More information

Honors Precalculus: Solving equations and inequalities graphically and algebraically. Page 1

Honors Precalculus: Solving equations and inequalities graphically and algebraically. Page 1 Solving equations and inequalities graphically and algebraically 1. Plot points on the Cartesian coordinate plane. P.1 2. Represent data graphically using scatter plots, bar graphs, & line graphs. P.1

More information

CS195H Homework 5. Due:March 12th, 2015

CS195H Homework 5. Due:March 12th, 2015 CS195H Homework 5 Due:March 12th, 2015 As usual, please work in pairs. Math Stuff For us, a surface is a finite collection of triangles (or other polygons, but let s stick with triangles for now) with

More information

arxiv: v1 [math.co] 4 Sep 2017

arxiv: v1 [math.co] 4 Sep 2017 Abstract Maximal chord diagrams up to all isomorphisms are enumerated. The enumerating formula is based on a bijection between rooted one-vertex one-face maps on locally orientable surfaces andacertain

More information

Generalized Cell Decompositions of Nested Lorenz Links

Generalized Cell Decompositions of Nested Lorenz Links Generalized Cell Decompositions of Nested Lorenz Links illiam Coenen August 20, 2018 Abstract This paper focuses on generalizing the cell decompositions of various nested Lorenz links to determine types

More information

Tilings of the Euclidean plane

Tilings of the Euclidean plane Tilings of the Euclidean plane Yan Der, Robin, Cécile January 9, 2017 Abstract This document gives a quick overview of a eld of mathematics which lies in the intersection of geometry and algebra : tilings.

More information

Flat Surfaces, Teichmueller Discs, Veech Groups, and the Veech Tessellation

Flat Surfaces, Teichmueller Discs, Veech Groups, and the Veech Tessellation Flat Surfaces, Teichmueller Discs, Veech Groups, and the Veech Tessellation S. Allen Broughton - Rose-Hulman Institute of Technology Chris Judge - Indiana University AMS Regional Meeting at Pennsylvania

More information

4. Simplicial Complexes and Simplicial Homology

4. Simplicial Complexes and Simplicial Homology MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n

More information

Miquel dynamics for circle patterns

Miquel dynamics for circle patterns Miquel dynamics for circle patterns Sanjay Ramassamy ENS Lyon Partly joint work with Alexey Glutsyuk (ENS Lyon & HSE) Seminar of the Center for Advanced Studies Skoltech March 12 2018 Circle patterns form

More information

Product constructions for transitive decompositions of graphs

Product constructions for transitive decompositions of graphs 116 Product constructions for transitive decompositions of graphs Geoffrey Pearce Abstract A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition

More information

pα i + q, where (n, m, p and q depend on i). 6. GROMOV S INVARIANT AND THE VOLUME OF A HYPERBOLIC MANIFOLD

pα i + q, where (n, m, p and q depend on i). 6. GROMOV S INVARIANT AND THE VOLUME OF A HYPERBOLIC MANIFOLD 6. GROMOV S INVARIANT AND THE VOLUME OF A HYPERBOLIC MANIFOLD of π 1 (M 2 )onπ 1 (M 4 ) by conjugation. π 1 (M 4 ) has a trivial center, so in other words the action of π 1 (M 4 ) on itself is effective.

More information

The orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P.

The orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P. Title Author(s) The orientability of small covers and coloring simple polytopes Nishimura, Yasuzo; Nakayama, Hisashi Citation Osaka Journal of Mathematics. 42(1) P.243-P.256 Issue Date 2005-03 Text Version

More information

Topology of Surfaces

Topology of Surfaces EM225 Topology of Surfaces Geometry and Topology In Euclidean geometry, the allowed transformations are the so-called rigid motions which allow no distortion of the plane (or 3-space in 3 dimensional geometry).

More information

Introduction to Transformations. In Geometry

Introduction to Transformations. In Geometry + Introduction to Transformations In Geometry + What is a transformation? A transformation is a copy of a geometric figure, where the copy holds certain properties. Example: copy/paste a picture on your

More information

1 Introduction To construct a branched covering of a 3-manifold M, we start with a tamely embedded knot or link L ρ M (the branch set) and a represent

1 Introduction To construct a branched covering of a 3-manifold M, we start with a tamely embedded knot or link L ρ M (the branch set) and a represent Kirby diagrams from branched-covering presentations Frank J. Swenton Department of Mathematics Middlebury College Middlebury, VT 05753 Email: fswenton@alumni.princeton.edu Abstract We present an algorithm

More information

CLASSIFICATION OF SURFACES

CLASSIFICATION OF SURFACES CLASSIFICATION OF SURFACES JUSTIN HUANG Abstract. We will classify compact, connected surfaces into three classes: the sphere, the connected sum of tori, and the connected sum of projective planes. Contents

More information

Topological Data Analysis - I. Afra Zomorodian Department of Computer Science Dartmouth College

Topological Data Analysis - I. Afra Zomorodian Department of Computer Science Dartmouth College Topological Data Analysis - I Afra Zomorodian Department of Computer Science Dartmouth College September 3, 2007 1 Acquisition Vision: Images (2D) GIS: Terrains (3D) Graphics: Surfaces (3D) Medicine: MRI

More information

The Construction of a Hyperbolic 4-Manifold with a Single Cusp, Following Kolpakov and Martelli. Christopher Abram

The Construction of a Hyperbolic 4-Manifold with a Single Cusp, Following Kolpakov and Martelli. Christopher Abram The Construction of a Hyperbolic 4-Manifold with a Single Cusp, Following Kolpakov and Martelli by Christopher Abram A Thesis Presented in Partial Fulfillment of the Requirement for the Degree Master of

More information

Geometric structures on manifolds

Geometric structures on manifolds CHAPTER 3 Geometric structures on manifolds In this chapter, we give our first examples of hyperbolic manifolds, combining ideas from the previous two chapters. 3.1. Geometric structures 3.1.1. Introductory

More information

Hyperbolic Geometry. Thomas Prince. Imperial College London. 21 January 2017

Hyperbolic Geometry. Thomas Prince. Imperial College London. 21 January 2017 Hyperbolic Geometry Thomas Prince Imperial College London 21 January 2017 Thomas Prince (Imperial College London) Hyperbolic Planes 21 January 2017 1 / 31 Introducing Geometry What does the word geometry

More information

Computing the Symmetry Groups of the Platonic Solids with the Help of Maple

Computing the Symmetry Groups of the Platonic Solids with the Help of Maple Computing the Symmetry Groups of the Platonic Solids with the Help of Maple In this note we will determine the symmetry groups of the Platonic solids. We will use Maple to help us do this. The five Platonic

More information

Punctured Torus Groups

Punctured Torus Groups Punctured Torus Groups Talk by Yair Minsky August, 7 One of the simplest classes of examples of Kleinian surface groups is given by punctured torus groups. We define a punctured torus group to be a discrete

More information

Geometric Modeling Mortenson Chapter 11. Complex Model Construction

Geometric Modeling Mortenson Chapter 11. Complex Model Construction Geometric Modeling 91.580.201 Mortenson Chapter 11 Complex Model Construction Topics Topology of Models Connectivity and other intrinsic properties Graph-Based Models Emphasize topological structure Boolean

More information

1 The Platonic Solids

1 The Platonic Solids 1 The We take the celebration of Dodecahedron Day as an opportunity embark on a discussion of perhaps the best-known and most celebrated of all polyhedra the Platonic solids. Before doing so, however,

More information

Topological Issues in Hexahedral Meshing

Topological Issues in Hexahedral Meshing Topological Issues in Hexahedral Meshing David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science Outline I. What is meshing? Problem statement Types of mesh Quality issues

More information

Introduction to Riemann surfaces, moduli spaces and its applications

Introduction to Riemann surfaces, moduli spaces and its applications Introduction to Riemann surfaces, moduli spaces and its applications Oscar Brauer M2, Mathematical Physics Outline 1. Introduction to Moduli Spaces 1.1 Moduli of Lines 1.2 Line Bundles 2. Moduli space

More information

Generating Functions for Hyperbolic Plane Tessellations

Generating Functions for Hyperbolic Plane Tessellations Generating Functions for Hyperbolic Plane Tessellations by Jiale Xie A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in

More information

THE CLASSIFICATION OF FOOTBALL PATTERNS

THE CLASSIFICATION OF FOOTBALL PATTERNS THE CLASSIFICATION OF FOOTBALL PATTERNS V. BRAUNGARDT AND D. KOTSCHICK ABSTRACT. We prove that every spherical football is a branched cover, branched only in the vertices, of the standard football made

More information

CTI, November 19, 2015

CTI, November 19, 2015 Consider a large cube made from unit cubes 1 Suppose our cube is n n n Look at the cube from a corner so that you can see three faces How many unit cubes are in your line of vision? Build a table that

More information

Calculus on the complex plane C

Calculus on the complex plane C Calculus on the complex plane C Let z = x + iy be the complex variable on the complex plane C == R ir where i = 1. Definition A function f : C C is holomorphic if it is complex differentiable, i.e., for

More information

Discrete Math: Selected Homework Problems

Discrete Math: Selected Homework Problems Discrete Math: Selected Homework Problems 2006 2.1 Prove: if d is a common divisor of a and b and d is also a linear combination of a and b then d is a greatest common divisor of a and b. (5 3.1 Prove:

More information

K-5 Mathematics Missouri Learning Standards: Grade-Level Expectations

K-5 Mathematics Missouri Learning Standards: Grade-Level Expectations K-5 Mathematics Missouri Learning Standards: Grade-Level Expectations Missouri Department of Elementary and Secondary Education Spring 06 Number Sense NS Kindergarten Grade Grade Grade 3 Grade 4 Grade

More information

Glossary of dictionary terms in the AP geometry units

Glossary of dictionary terms in the AP geometry units Glossary of dictionary terms in the AP geometry units affine linear equation: an equation in which both sides are sums of terms that are either a number times y or a number times x or just a number [SlL2-D5]

More information

Math 210 Manifold III, Spring 2018 Euler Characteristics of Surfaces Hirotaka Tamanoi

Math 210 Manifold III, Spring 2018 Euler Characteristics of Surfaces Hirotaka Tamanoi Math 210 Manifold III, Spring 2018 Euler Characteristics of Surfaces Hirotaka Tamanoi 1. Euler Characteristic of Surfaces Leonhard Euler noticed that the number v of vertices, the number e of edges and

More information

Geometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation

Geometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation Geometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation and the type of an object. Even simple scaling turns a

More information

The Game of Criss-Cross

The Game of Criss-Cross Chapter 5 The Game of Criss-Cross Euler Characteristic ( ) Overview. The regions on a map and the faces of a cube both illustrate a very natural sort of situation: they are each examples of regions that

More information

7. The Gauss-Bonnet theorem

7. The Gauss-Bonnet theorem 7. The Gauss-Bonnet theorem 7.1 Hyperbolic polygons In Euclidean geometry, an n-sided polygon is a subset of the Euclidean plane bounded by n straight lines. Thus the edges of a Euclidean polygon are formed

More information

Heegaard splittings and virtual fibers

Heegaard splittings and virtual fibers Heegaard splittings and virtual fibers Joseph Maher maher@math.okstate.edu Oklahoma State University May 2008 Theorem: Let M be a closed hyperbolic 3-manifold, with a sequence of finite covers of bounded

More information

1 Introduction. Counting with Cubes. Barringer Winter MathCamp, 2016

1 Introduction. Counting with Cubes. Barringer Winter MathCamp, 2016 1 Introduction Consider a large cube made from unit cubes 1 Suppose our cube is n n n Look at the cube from a corner so that you can see three faces How many unit cubes are in your line of vision? Build

More information

The following is a summary, hand-waving certain things which actually should be proven.

The following is a summary, hand-waving certain things which actually should be proven. 1 Basics of Planar Graphs The following is a summary, hand-waving certain things which actually should be proven. 1.1 Plane Graphs A plane graph is a graph embedded in the plane such that no pair of lines

More information

Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS

Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Definition 1.1. Let X be a set and T a subset of the power set P(X) of X. Then T is a topology on X if and only if all of the following

More information

MATRIX INTEGRALS AND MAP ENUMERATION 1

MATRIX INTEGRALS AND MAP ENUMERATION 1 MATRIX INTEGRALS AND MAP ENUMERATION 1 IVAN CORWIN Abstract. We explore the connection between integration with respect to the GUE and enumeration of maps. This connection is faciliated by the Wick Formula.

More information

Geometry: Semester 2 Practice Final Unofficial Worked Out Solutions by Earl Whitney

Geometry: Semester 2 Practice Final Unofficial Worked Out Solutions by Earl Whitney Geometry: Semester 2 Practice Final Unofficial Worked Out Solutions by Earl Whitney 1. Wrapping a string around a trash can measures the circumference of the trash can. Assuming the trash can is circular,

More information

ON LEIGHTON S GRAPH COVERING THEOREM. Theorem (Leighton [5]). Two finite graphs which have a common covering have a common finite covering.

ON LEIGHTON S GRAPH COVERING THEOREM. Theorem (Leighton [5]). Two finite graphs which have a common covering have a common finite covering. ON LEIGHTON S GRAPH COVERING THEOREM WALTER D. NEUMANN Abstract. We give short expositions of both Leighton s proof and the Bass- Kulkarni proof of Leighton s graph covering theorem, in the context of

More information

Twist knots and augmented links

Twist knots and augmented links CHAPTER 7 Twist knots and augmented links In this chapter, we study a class of hyperbolic knots that have some of the simplest geometry, namely twist knots. This class includes the figure-8 knot, the 5

More information

Aspects of Geometry. Finite models of the projective plane and coordinates

Aspects of Geometry. Finite models of the projective plane and coordinates Review Sheet There will be an exam on Thursday, February 14. The exam will cover topics up through material from projective geometry through Day 3 of the DIY Hyperbolic geometry packet. Below are some

More information

15. PARAMETRIZED CURVES AND GEOMETRY

15. PARAMETRIZED CURVES AND GEOMETRY 15. PARAMETRIZED CURVES AND GEOMETRY Parametric or parametrized curves are based on introducing a parameter which increases as we imagine travelling along the curve. Any graph can be recast as a parametrized

More information

Curriki Geometry Glossary

Curriki Geometry Glossary Curriki Geometry Glossary The following terms are used throughout the Curriki Geometry projects and represent the core vocabulary and concepts that students should know to meet Common Core State Standards.

More information

1 Appendix to notes 2, on Hyperbolic geometry:

1 Appendix to notes 2, on Hyperbolic geometry: 1230, notes 3 1 Appendix to notes 2, on Hyperbolic geometry: The axioms of hyperbolic geometry are axioms 1-4 of Euclid, plus an alternative to axiom 5: Axiom 5-h: Given a line l and a point p not on l,

More information

Euler-Cayley Formula for Unusual Polyhedra

Euler-Cayley Formula for Unusual Polyhedra Bridges Finland Conference Proceedings Euler-Cayley Formula for Unusual Polyhedra Dirk Huylebrouck Faculty for Architecture, KU Leuven Hoogstraat 51 9000 Gent, Belgium E-mail: dirk.huylebrouck@kuleuven.be

More information

Unit 1, Lesson 1: Moving in the Plane

Unit 1, Lesson 1: Moving in the Plane Unit 1, Lesson 1: Moving in the Plane Let s describe ways figures can move in the plane. 1.1: Which One Doesn t Belong: Diagrams Which one doesn t belong? 1.2: Triangle Square Dance m.openup.org/1/8-1-1-2

More information

Combining Isometries- The Symmetry Group of a Square

Combining Isometries- The Symmetry Group of a Square Combining Isometries- The Symmetry Group of a Square L.A. Romero August 22, 2017 1 The Symmetry Group of a Square We begin with a definition. Definition 1.1. The symmetry group of a figure is the collection

More information

The Farey Tessellation

The Farey Tessellation The Farey Tessellation Seminar: Geometric Structures on manifolds Mareike Pfeil supervised by Dr. Gye-Seon Lee 15.12.2015 Introduction In this paper, we are going to introduce the Farey tessellation. Since

More information

Classification of Surfaces

Classification of Surfaces Classification of Surfaces 16 April 2014 Classification of Surfaces 16 April 2014 1/29 Last Time On Monday we saw some examples of surfaces and how we can build some by starting with a rectangle and gluing

More information