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

Size: px
Start display at page:

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

Transcription

1 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 the number f of faces of Platonic solids have a curious property that we always have v e+f = 2, as shown in the next table. As we will see, this observation can be generalized to general convex polyhedra for which v e + f = 2 is always valid. For arbitrary triangulation of any given surface (these are general polyhedra not necessarily convex) the identity v e + f = 2 is no longer valid, but v e + f is still independent of the triangulation. This phenomenon is valid in the general context of cell complexes. Before defining cell complexes, we discuss one example. Example 1.1. (Soccer Ball) Soccer balls are made with hexagonal faces and pentagonal faces, with three faces meeting at each vertex. This can be thought of as a convex polyhedron so that v e + f = 2 is valid. Suppose here are H hexagonal faces and P pentagonal faces. Then there are v = (5P + 6H)/3 vertices, e = (5P + 6H)/2 edges, and f = P + H faces. Then 5P + 6H 5P + 6H 2 = v e + f = + (P + H) = P Hence P = 12 and such a soccer ball always has 12 pentagonal faces. The number of hexagonal faces can vary. For example, the regular dodecahedron has no hexagonal faces, but truncated regular icosahedron (this polyhedron is obtained by chopping off 12 vertices of the icosahedron, at each vertex of which two hexagonal faces and one pentagonal face meet) has 20 hexagonal faces. Unfortunately, there does not exist a polyhedron whose faces are regular pentagons and regular hexagons such that at each vertex, two pentagons and one hexagon meet. In fact, only convex polyhedron whose faces consist of regular pentagons and regular hexagons are the above two. See a table of 13 Archimedean solids at the end of this section. These are semi regular solids. More general solids are called Johnson solids whose only requirement is that every face is a regular polygon. There are exactly 92 Johnson solids. 1

2 If you relax the condition that every face must be a regular polygon, then it is possible to have a cell decomposition of S 2 whose 2-cells have 5 or 6 edges around their boundary, and at each 0-cell, (the closure of) three 2-cells meet. By definiton, an n-cell is a topological space homeomorphic to an open n-ball for n 1, and a 0-cell is a point. The following statement is not quite precise definition of a cell complex. But it will give you a good idea of it. For a precise definition, wee Hatcher Chaopter 0 on cell complexes. Definition 1.2. A cell complex is a topological space X which is a disjoint union of cells of various dimensions satisfying the following conditions. (C) For any cell, its boundary in X is a union of finitely many lower dimensional cells. (W) A subset A X is open (closed) in X if and only if for every cell e k, the intersection A e k with the closure of e k in X is open (closed) inside the closure e k of that cell e k. The condition (C) is called closure finiteness and the condition (W) says that X has the weak topology with respect to the cell structure. These conditions (C) and (W) are irrelevant if X has only finitely many cells. But for cells with infinitely many cells, these conditions eliminates pathological cases. Example 1.3. (1) Consider a family of circles in the plane R 2 all touching each other at the origin, and converging to the origin. Namely, let ( C n = {(x, y) R 2 x 1 ) 2 + y 2 = 1 }. n n 2 and Let Y = n 1 C n with induced topology from R 2. Y has a natural cell structure by decomposing each circle C n as C n = e 0 e 1 n, the origin and the rest of the circle. In Y, the condition (C) is satisfied but the condition (W) is not satisfied. For example, let y n = (2/n, 0) C n be the point in C n opposite to the origin. The the set A = {y n n 1} is not closed in Y since the origin is a limit point of A but the origin is not in A. However, A e 1 n is closed in the n-th 1-cell e 1 n in C n for all n 1. Thus, Y with this cell structure is not a cell complex in the above sense. (2) On the other hand, for each n 1, let S n be the standard unit circle with usual base point x n at (1, 0). Let ( X = S n )/{x 1, x 2,..., x n,... } n 1 be the quotient space obtained from the topological disjoint union of infinitely many circles by identifying them at one point. The space X again has a canonical cell decomposition as before, but this time, X is a cell complex. Definition 1.4. Let X be a finite cell complex and let a n be the number of n-cells in X. Then the Euler characteristic of X is defined by χ(x) = n 0( 1) n a n.. For surfaces with finitely many cells, the above definition becomes the following. 2

3 Definition 1.5. Given a cell decomposition of a surface M, let ν, e, and f be the number of 0-cells, 1-cells, and 2-cells. The Euler characteristic of the cell complex M is defined by χ(m) = ν e + f. Example 1.6. Some examples of cell decompositions and their Euler characteristic. Here S 2 denotes the sphere, P denotes the projective plane, and T denotes the torus. (1) The 2-dimensional sphere S 2 can be decomposed as one point and the rest of the sphere. This gives S 2 = e 0 e 2. So ν = 1, e = 0, f = 1 and χ(s 2 ) = 2. Another decomposition will be decompose the equator as one point and the rest of the equator, together with strictly upper hemisphere and strictly lower hemisphere. This gives S 2 = e 0 e 1 e 2 e 2. So again χ(s 2 ) = = 2. (2) The five Platonic solidsgive cell decompositions of a sphere. At the beginning of this section, we saw that in all cases, we have ν e + f = 2. (3) We use the standard construction of the projective plane P as 2-dimensional disc D 2 with antipodal boundary points identified. If we decompose the boundary circle as two antipodal points and two semi arcs without end points, these cells, after identification, give rise to one 0-cell and one 1-cell. The interior of the disc gives a 2-cell. So we have P = e 0 e 1 e 2. So ν = 1, e = 1, f = 1 and χ(p ) = 1. Another cell decomposition, which is actually a triangulation, is given below with 10 triangles. In this cell decomposition, there are six 0-cells, fifteen 1-cells, and ten 2-cells. So again we have χ(p ) = = 1. (4) Among the cell decompositions on the sphere S 2 coming from Platonic solids, all but the tetrahedon cell decomposition descend to cell decompositions of the projective plane. In these cell decompositions, the numbers ν, e, f are half of the original numbers and we get χ(p ) = χ(s 2 )/2 = 1. (5) T = e 0 e 1 a e 1 b e2. So ν = 1, e = 2, f = 1 and χ(t ) = 0. (6) Here is another cell decomposition of a torus in which all faces are squares. See the picture below. This is actually a polyhedron homeomorphic to a torus. We have ν = 24, e = 48, f = 24 and so χ = ν e + f = 0. Example 1.7. A triangulation of a compact surface M is a finite collection of triangles T = {T 1, t 2,..., T n } in M such that (1) these triangles cover M, that is n i=1 T i = M, and (2) if two distinct triangles intersect, they do so along a single common vertex or along a single commom edge. Each triangle does not intersect with itself. A triangulation naturally gives rise to a finite cell complex structure on the surface. But in general, one needs many triangles. For example, one can show that on a compact surface 3

4 without boundary with Euler characteristic χ, every triangulation on M must satisfy 2e = 3f, e = 3(ν χ), ν 1 2 ( χ). The last inequality is obtained by using e ( ν 2). For the projective plane P = RP 2 with χ = 1, in every triangulation of P, there must exist at least 10 triangles. Such a triangulation of P is given below Here, along the circle, opposite arcs are identified in the same direction. 0 A basic property of the Euler characteristic is that it is a topolological invariant of the surface, and independent of the cell decomposition used to compute it. This is true for any cell complex, but here we give a proof for surfaces. Theorem 1.8. The Euler characteristic is independent of the cell complex structure on a compact surface M, and depends only on the homeomorphism type of M. Proof. First we observe that the Euler characteristic is invariant under the following three processes. (1) Subdivide an edge. This increases the number of vertices by 1 and the number of edges by 1. Or erasing a degree 2 vertex, combining two edges into one edge. (2) Subdivide a face into two by inserting an edge connecting two boundary vertices. Or combining two adjacent faces by removing a common edge. (3) Introduce a new dangling edge in the interior of a face, where the new edge has one vertex incident to a boundary vertex of the face. Or removing a dangling edge. Given two cell decomposition D 1 and D 2 of M, we can use the above processes to convert these cell decompositions into a finer common cell decomposition D 3 obtained by combining edges of these two cell decompositions and possibly adding additional edges to subdivide resulting regions into contractible cells using the above three processes. (The argument here is delicate, since an edge from D 1 may intersect with an edge from D 2 at infinitely many points, like the graph of y = sin(1/x) intersects with x-axis. If this happens, we cal always move edges a little to avoid this situation.) Then χ(d 1 ) = χ(d 3 ) = χ(d 2 ). Hence χ only depends on the topological type. Thus in particular, the Euler characteristic of a surface is independent of its cell decomposition. Note that the Euler characteristic does not change under circulation rules. To see this, we observe that under Circulation Rules (I) and (II), the cell structure remains the 4

5 same. Rule (III), sphere rule, corresponds to introducing or eliminating a dangling edge corresponding to (3) above. The Cylinder Rule (V) and the Möbius Rule (VI) involve introducing an edge which bisects a face corresponding to (2) above. Hence χ(c) is the same as χ(c standard ). Since all surfaces are generated by taking connected sum with the torus T or the projective plane P, to compute Euler characteristic of general surface, we first study its behavior under connected sums. The following theorem can be proved using convenient cell decomposition of surfaces M 1 and M 2 in which interiors of discs removed are 2-cells. Theorem 1.9. Let M 1, M 2 be surfaces. Then χ(m 1 #M 2 ) = χ(m 1 ) + χ(m 2 ) 2. Proof. Let M i, i = 1, 2, be a surface obtained by removing an open disc from M i. Introduce the same cell decomposition along the boundary circles of M i, say with p 0-cells and p 1- cells. Then extend this cell decomposition to the rest of surfaces with boundary. We have χ(m i ) = χ(m i ) + 1 for i = 1, 2. Now by counting cells in M 1 #M 2, let v i, e i, f i be the number of 0-cells, 1-cells, and 2-cells in M i for i = 1, 2. Since vertices and edges along the boundary circles are identified, we have χ(m 1 #M 2 ) = (v 1 +v 2 p) (e 1 +e 2 p)+(f 1 +f 2 ) = χ(m 1 ) + χ(m 2 ) = χ(m 1 ) 1 + χ(m 2 ) 1. This proves the formula. By classification theorem of surfaces, a compact surface without boundary is homeomorphic to either an orientable surface Σ g = gt of genus g 0, or a nonorientable surface N h of genus h 1. By convention, N 0 = Σ 0 = S 2 is the sphere. Proposition The Euler characteristic of a compact surfaces without boundary are given as follows. χ(σ g ) = 2 2g, χ(n h ) = 2 h. Proof. Since χ(t ) = 0 and χ(p ) = 1, the formula above for connected sum gives χ(m#t ) = χ(m) + χ(t ) 2 = χ(m) 2, χ(m#p ) = χ(m) + χ(p ) 2 = χ(m) 1. Thus, each time we take a connected sum with a torus, the Euler characteristic decreases by 2, and every time we take a connected sum with the projective plane, the Euler characteristic decreases by 1. By induction starting with the sphere with χ(s 2 ) = 2, we get the above formula. In the above formula, the number 2 on the right hand sides is the Euler characteristic of the sphere. We can also use standard plane models for the above surfaces to compute the Euler characteristic. For example, in the standard plane model of genus g orientable surface on 4g-gon with the word a 1 b 1 a 1 1 b 1 1 a g b g a 1 g b 1 g, the induced cell structure on the surface has one 0-cell, 2g 1-cells, and pne 2-cells. Hence χ(σ g ) = 1 2g + 1 = 2 2g. Similar computation works for the genus h nonorientable surface N h. Corollary Homeomorphism type of closed surface is classified by its orientability and its Euler characteristic. More precisely, let X be a closed surface. (1) If X is orientable and χ(x) = 2 2g, then X is an orientable surface Σ g of genus g 0. Here, genus 0 surface is a sphere. 5

6 (2) If X is nonorientable and χ(x) = 2 h, then X is a nonorientable surface N h of genus h 1. Note that due to Dyck s identity, we have P #Σ g = (2g + 1)P, K#Σg = (2g + 2)P for g 0. Thus, all closed surfaces are generated from a sphere S 2, a torus T, a projective plane P, and a Klein bottle K by connected sum, where P or K only have to be used at most once. 2. Applications of Euler Characteristics: Identification of surfaces Surfaces can be classified by orientability and the Euler characteristic. So, we can use Euler characteristic to identify surfaces. We illustrate the method by examples Application 1. Plane models. Euler characteristic provides a quick way to identify the surface presented by a plane model. What we use is a fact that a closed surface is determined, up to a homeomorphism, by orientability and the Euler characteristic. As an example, let M be a surface whose plane model has a word dac 1 bca 1 b 1 d 1. Since each label appears exactly twice with opposite exponent, this word represents an orientable surface. Plane model induces a cell decomposition on the surface M with one big 2 cell coming from the interior of the plane model, so f = 1. The number of 1-cells is equal to the number of labels. By examining vertex identification induced by edge identification (draw a vertex identification graph), we have ν = 3, e = 4, f = 1. Since the word is orientable and χ(m) = = 0, the surface M must be a torus. To draw a vertex identification diagram, label all vertices of the plane model as 1, 2,..., n (if there are n vertices), and arrange all vertices in a circular fashion. Suppose edge labels are a, b, c,.... When we glue two edges carrying the label a in the same direction, the two head vertices are identified, and two tail vertices are identified. Draw an edge in the vertex diagram between two vertices which are identified. Do this for all edges. The number of connected components of the resulting graph is the number ν of distinct vertices on the glued surface M. Let M be a surface having a plane model with a word ca 1 b 1 cdab 1 d. This is a nonorientable surface word with ν = 1 after examining the vertex identification diagram. So, χ(m) = = 2. Hence M = 4P = N Application 2. Surfaces spanning knots and links. Given a knot (or a link) in R 3, we can find a surface whose boundary is the given knot (or a link), called a spanning surface. To identify this surface, follow the following procedure. (1) Decide orientability of a given surface. If there exists a loop on the surface which goes through odd number of crossings in the knot s plane drawing, then it is an orientation reversing loop, and the surface is non-orientable. If you cannot find any orientation reversing loops, then your spanning surface is orientable. (2) Count the number of boundary circles. This is the number of components of a link. If we start with a knot, then the number is 1. (3) Introduce a cell decomposition of a surface and compute the Euler characteristic of M. Basically we introduce new edges and vertices on the surface to cut the surface into contractible regions, and the interiors of contractible regions are 2-cells, 6

7 and the cuts used are part of 1-cells and 0-cells of the new cell decomposition. For example, if the knot (or link) diagram has c crossings, we can introduce one cut for each crossing. This is an edge close to the crossing which you can use to cut your surface. Introduction of this edge uses one 1-cell and two 0-cells (end vertices). We introduce a cut for each crossing. Then, we have 2c vertices (=0-cells), and c short 1-cells (cuts) and the original knot (or link) is divided by the above 2c vertices into 2c arcs, which are 1-cells. Hence altogether, we have ν = 2c many 0-cells and e = c + 2c = 3c many 1-cells. You notice that each region of the surface separated by cuts is a contractible region, so its interior is a 2-cell. Suppose there are f regions. Then χ(m) = ν e + f = f c. This gives a quick way to compute the Euler characteristic of the spanning surface simply by counting the number c of knot crosings and the number of regions from knot diagram. Of course we can use a smaller cell decomposition without using as many cells as above. We just have to make sure that after cuts are made, each region is contractible. (4) For a spanning surface M, let M be the closed surface obtained by capping boundaries, that is, by gluing a disc along each boundary component. If there are k boundaries, this capping process adds k 2-cells to the cell decomposition of M, so we have χ( M) = χ(m) + k. If M is a spanning surface of a knot, then k = 1. If M is a spanning surface of a link, then k is the number of components of a link. Use the orientability and the Euler chracteristic to identify the closed surface M as gt or hp. (5) The original surface M can be described as M with k open discs removed. We can span a surface for the following knots, and apply the above method to identify the surfaces. In general, given a knot, there are several possible spanning surfaces. The easiest one is to imagine a soap film spanning the wire in the shape of a knot. Less obvious one is a surface which extends outward and curls up to close. These spanning surfaces of the same knot (or link) may not be homeomorphic. Soem of them may be orientable, and some of them are not. However, one can always find an orientable spanning surface called Seifert surface. This is the one which extends out and curls up to close. The Euler characteristic is characterized by the following property. This often gives quick computation. Proposition 2.1. For compact topological spaces posessing a cell decomposition, the Euler characteristic is characterized by the following properties. (1) χ(x) is a topological invariant of X. (2) χ(x) = 0 is X is empty. (3) χ(x) = 1 is X is contractible. 7

8 (4) Let X 1 and X 2 be subcomplexes of X. Then χ(x 1 X 2 ) = χ(x 1 ) + χ(x 2 ) χ(x 1 X 2 ). The proof is basically the Inclusion-Exclusion Principle in set theory. That is, for two finite sets A, B, the number of elements of sets behave as follows. A B = A + B A B. For the proof of the above formula of the Euler characteristic, consider the set of k-dimensional cells for k = 0, 1, 2,. For each dimension, write down the above Inclusion-Exclusion Principle, then take alternating sum. 3. Regular Complexes on Surfaces Definition 3.1. A regular complex on a surface M is a cell decomposition on M such that (1) each face has the same number of edges a 3, (2) each vertex has the same valency b 3, (3) two faecs meet along a single edge, at a single vertex, or none at all, (4) no two faces meet with itself. A regular complex above on M is denoted by (a, b)m. Example 3.2. Platonic solids are regular complexes on the sphere S. (1) Tetrahedron = (3, 3)S with ν = 4, e = 6, f = 4. (2) Cube = (4, 3)S with ν = 8, e = 12, f = 6. (3) Octahedron = (3, 4)S with ν = 6, e = 12, f = 8. (4) Dedecahedron = (5, 3)S with ν = 20, e = 30, f = 12. (5) Icosahedron = (3, 5)S with ν = 12, e = 30, f = 20. Lemma 3.3. Consider a regular complex of type (a, b) on a surface M. Then The Euler characteristic of M is given by af = 2e, νb = 2e. χ(m) = 2e ( 1 a + 1 b 1 ). 2 Proposition 3.4. Platonic solids are the only regular convex polytopes. Proof. Since χ(s 2 ) = 2, we have e( ) = 1. From this, only possibilities are (a, b) = a b 2 (3, 3), (3, 4), (3, 5), (4, 3), (5, 3). The numbers ν, e, f can be computed from a, b, and these are Platonic solids. Definition 3.5. Given a cell complex C on a surface M, its dual cell complex C can be constructed as follows. Place a veretx in the middle of each face of C. There is an edge between two new vertices if and only if the corresponding faces of C share a common edge. These new vertices and edges divide the surface M into 2-cells which are the faces of C. Suppose cell complex is an (a, b)m. In the dualization process, an a-gon face in C becomes a vertex of valence b in the dual complex C. A vertex of valence b in C becomes a b-gon face. Thus, C = (b, a)m. 8

9 4. Regular complex structure on P, T, K Proposition 4.1. (1) On the projective plane P, all the possible regular complexes are of type (3, 5) and (5, 3). (2) On the torus T, all the possible regular complexes are of type (3, 6), (4, 4), (6, 3). The number of edges, vertices and faces are not fixed, and there are infinitely many for each type. (3) On the Klein bottle K, all the possible regular complexes are of type (3, 6), (4, 4), (6, 3). The number of edges, vertices and faces are not fixed, and there are infinitely many for each type. 5. b-valent complexes A b-valent complex is a cell complex defined by the requirement of the regular coimplex without the condition that all faces have the same number of edges. Lemma 5.1. Let f n be the number of faces with n edges. on a trivalent (b = 3) complex on S 2, we have 12 = 3f 3 + 2f 4 + f 5 f 7 2f 8. In particular, there must be a face with fewer than 6 sides. By chopping off corners of regular solids, we get trivalent complexes on S 2. Example 5.2. A convex polyhedron with only triangle faces and square faces has a property that at each vertex, 2 triangles and 2 squares meet. Compute the number of vertices, edges, triangle faces, and square faces. (This solid is called cuboctahedron. See the table at the end of this section.) Solution Being a convex polyhedron means that the polyhedron is homeomorphic to a sphere. So v e + f = χ(s) = 2. Let f 3 and f 4 be the number of triangles and the number of squares. By counting the number of pairs (edge, vertex on the edge) in two different ways, we get 4v = 2e. By counting the number of pairs (triangle, a vertex on the triangle) in two ways, we get 3f 3 = 2v. This is because at each vertex there are two triangles, so there are 2v such pairs. On the other hand, for each triangle, there are three possible vertices we can pair the triangle with. So the number of such pairs are 3f 3. Hence we have 3f 3 = 2v. Similarly, we get 4f 4 = 2v. Using these identities, we get v = 12, e = 24, f 3 = 8, f 4 = 6. We can obtain this convex polyhedron by cutting off vertices from a cube by cuts through middle of edges. The above solid is an example of an Archimedean solid. Definition 5.3. (Archimedean solids) An Archimedean solid is a convex polyhedron whose faces consist of two or more types of regular polygons and whose vertices are identical. That is, for any choice of two vertices, there is an isometry of the polygon sending one vertex to the other. Here are some examples of Archimedian solids. There are 13 Archimedean solids, and they are listed below. 9

10 10

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

1 Euler characteristics

1 Euler characteristics Tutorials: MA342: Tutorial Problems 2014-15 Tuesday, 1-2pm, Venue = AC214 Wednesday, 2-3pm, Venue = AC201 Tutor: Adib Makroon 1 Euler characteristics 1. Draw a graph on a sphere S 2 PROBLEMS in such a

More information

CLASSIFICATION OF SURFACES

CLASSIFICATION OF SURFACES CLASSIFICATION OF SURFACES YUJIE ZHANG Abstract. The sphere, Möbius strip, torus, real projective plane and Klein bottle are all important examples of surfaces (topological 2-manifolds). In fact, via the

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

Euler Characteristic

Euler Characteristic Euler Characteristic Rebecca Robinson May 15, 2007 Euler Characteristic Rebecca Robinson 1 PLANAR GRAPHS 1 Planar graphs v = 5, e = 4, f = 1 v e + f = 2 v = 6, e = 7, f = 3 v = 4, e = 6, f = 4 v e + f

More information

1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D.

1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. 1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third

More information

Topic: Orientation, Surfaces, and Euler characteristic

Topic: Orientation, Surfaces, and Euler characteristic Topic: Orientation, Surfaces, and Euler characteristic The material in these notes is motivated by Chapter 2 of Cromwell. A source I used for smooth manifolds is do Carmo s Riemannian Geometry. Ideas of

More information

) for all p. This means however, that the map ϕ 0 descends to the quotient

) for all p. This means however, that the map ϕ 0 descends to the quotient Solutions to sheet 6 Solution to exercise 1: (a) Let M be the Möbius strip obtained by a suitable identification of two opposite sides of the unit square [0, 1] 2. We can identify the boundary M with S

More information

Week 7 Convex Hulls in 3D

Week 7 Convex Hulls in 3D 1 Week 7 Convex Hulls in 3D 2 Polyhedra A polyhedron is the natural generalization of a 2D polygon to 3D 3 Closed Polyhedral Surface A closed polyhedral surface is a finite set of interior disjoint polygons

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

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

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 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings

Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 12: Planar Graphs Math 184A / Fall 2017 1 / 45 12.1 12.2. Planar graphs Definition

More information

Euler Characteristic

Euler Characteristic Euler Characteristic Sudesh Kalyanswamy 1 Introduction Euler characteristic is a very important topological property which started out as nothing more than a simple formula involving polyhedra. Euler observed

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

Question. Why is the third shape not convex?

Question. Why is the third shape not convex? 1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third

More information

One simple example is that of a cube. Each face is a square (=regular quadrilateral) and each vertex is connected to exactly three squares.

One simple example is that of a cube. Each face is a square (=regular quadrilateral) and each vertex is connected to exactly three squares. Berkeley Math Circle Intermediate I, 1/23, 1/20, 2/6 Presenter: Elysée Wilson-Egolf Topic: Polygons, Polyhedra, Polytope Series Part 1 Polygon Angle Formula Let s start simple. How do we find the sum of

More information

INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES

INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES RACHEL CARANDANG Abstract. This paper provides an overview of the homology groups of a 2- dimensional complex. It then demonstrates a proof of the Invariance

More information

Non-extendible finite polycycles

Non-extendible finite polycycles Izvestiya: Mathematics 70:3 1 18 Izvestiya RAN : Ser. Mat. 70:3 3 22 c 2006 RAS(DoM) and LMS DOI 10.1070/IM2006v170n01ABEH002301 Non-extendible finite polycycles M. Deza, S. V. Shpectorov, M. I. Shtogrin

More information

We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance.

We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance. Solid geometry We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance. First, note that everything we have proven for the

More information

SMMG September 16 th, 2006 featuring Dr. Jessica Purcell Geometry out of the Paper: An Introduction to Manifolds

SMMG September 16 th, 2006 featuring Dr. Jessica Purcell Geometry out of the Paper: An Introduction to Manifolds 1. Explore a Cylinder SMMG September 16 th, 2006 featuring Dr. Jessica Purcell Geometry out of the Paper: An Introduction to Manifolds Take a strip of paper. Bring the two ends of the strip together to

More information

arxiv: v1 [math.co] 15 Apr 2018

arxiv: v1 [math.co] 15 Apr 2018 REGULAR POLYGON SURFACES IAN M. ALEVY arxiv:1804.05452v1 [math.co] 15 Apr 2018 Abstract. A regular polygon surface M is a surface graph (Σ, Γ) together with a continuous map ψ from Σ into Euclidean 3-space

More information

Lecture IV - Further preliminaries from general topology:

Lecture IV - Further preliminaries from general topology: Lecture IV - Further preliminaries from general topology: We now begin with some preliminaries from general topology that is usually not covered or else is often perfunctorily treated in elementary courses

More information

4.2 Simplicial Homology Groups

4.2 Simplicial Homology Groups 4.2. SIMPLICIAL HOMOLOGY GROUPS 93 4.2 Simplicial Homology Groups 4.2.1 Simplicial Complexes Let p 0, p 1,... p k be k + 1 points in R n, with k n. We identify points in R n with the vectors that point

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

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

Math 170, Section 002 Spring 2012 Practice Exam 2 with Solutions

Math 170, Section 002 Spring 2012 Practice Exam 2 with Solutions Math 170, Section 002 Spring 2012 Practice Exam 2 with Solutions Contents 1 Problems 2 2 Solution key 10 3 Solutions 11 1 1 Problems Question 1: A right triangle has hypothenuse of length 25 in and an

More information

INTRODUCTION TO GRAPH THEORY. 1. Definitions

INTRODUCTION TO GRAPH THEORY. 1. Definitions INTRODUCTION TO GRAPH THEORY D. JAKOBSON 1. Definitions A graph G consists of vertices {v 1, v 2,..., v n } and edges {e 1, e 2,..., e m } connecting pairs of vertices. An edge e = (uv) is incident with

More information

Zipper Unfoldings of Polyhedral Complexes

Zipper Unfoldings of Polyhedral Complexes Zipper Unfoldings of Polyhedral Complexes Erik D. Demaine Martin L. Demaine Anna Lubiw Arlo Shallit Jonah L. Shallit Abstract We explore which polyhedra and polyhedral complexes can be formed by folding

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

Three applications of Euler s formula. Chapter 10

Three applications of Euler s formula. Chapter 10 Three applications of Euler s formula Chapter 10 A graph is planar if it can be drawn in the plane R without crossing edges (or, equivalently, on the -dimensional sphere S ). We talk of a plane graph if

More information

Manifolds. Chapter X. 44. Locally Euclidean Spaces

Manifolds. Chapter X. 44. Locally Euclidean Spaces Chapter X Manifolds 44. Locally Euclidean Spaces 44 1. Definition of Locally Euclidean Space Let n be a non-negative integer. A topological space X is called a locally Euclidean space of dimension n if

More information

751 Problem Set I JWR. Due Sep 28, 2004

751 Problem Set I JWR. Due Sep 28, 2004 751 Problem Set I JWR Due Sep 28, 2004 Exercise 1. For any space X define an equivalence relation by x y iff here is a path γ : I X with γ(0) = x and γ(1) = y. The equivalence classes are called the path

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

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

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

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

Ma/CS 6b Class 9: Euler s Formula

Ma/CS 6b Class 9: Euler s Formula Ma/CS 6b Class 9: Euler s Formula By Adam Sheffer Recall: Plane Graphs A plane graph is a drawing of a graph in the plane such that the edges are noncrossing curves. 1 Recall: Planar Graphs The drawing

More information

Surfaces Beyond Classification

Surfaces Beyond Classification Chapter XII Surfaces Beyond Classification In most of the textbooks which present topological classification of compact surfaces the classification is the top result. However the topology of 2- manifolds

More information

Basics of Combinatorial Topology

Basics of Combinatorial Topology Chapter 7 Basics of Combinatorial Topology 7.1 Simplicial and Polyhedral Complexes In order to study and manipulate complex shapes it is convenient to discretize these shapes and to view them as the union

More information

Jordan Curves. A curve is a subset of IR 2 of the form

Jordan Curves. A curve is a subset of IR 2 of the form Jordan Curves A curve is a subset of IR 2 of the form α = {γ(x) : x [0,1]}, where γ : [0,1] IR 2 is a continuous mapping from the closed interval [0,1] to the plane. γ(0) and γ(1) are called the endpoints

More information

Solutions to the Second Midterm Exam, Math 170, Section 002 Spring 2012

Solutions to the Second Midterm Exam, Math 170, Section 002 Spring 2012 Solutions to the Second Midterm Exam, Math 170, Section 002 Spring 2012 Multiple choice questions. Question 1. Suppose we have a rectangle with one side of length 5 and a diagonal of length 13. What is

More information

Dominating Sets in Triangulations on Surfaces

Dominating Sets in Triangulations on Surfaces Dominating Sets in Triangulations on Surfaces Hong Liu Department of Mathematics University of Illinois This is a joint work with Michael Pelsmajer May 14, 2011 Introduction A dominating set D V of a graph

More information

11.4 Three-Dimensional Figures

11.4 Three-Dimensional Figures 11. Three-Dimensional Figures Essential Question What is the relationship between the numbers of vertices V, edges E, and faces F of a polyhedron? A polyhedron is a solid that is bounded by polygons, called

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

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

Euler s Theorem. Brett Chenoweth. February 26, 2013

Euler s Theorem. Brett Chenoweth. February 26, 2013 Euler s Theorem Brett Chenoweth February 26, 2013 1 Introduction This summer I have spent six weeks of my holidays working on a research project funded by the AMSI. The title of my project was Euler s

More information

Lecture 19: Introduction To Topology

Lecture 19: Introduction To Topology Chris Tralie, Duke University 3/24/2016 Announcements Group Assignment 2 Due Wednesday 3/30 First project milestone Friday 4/8/2016 Welcome to unit 3! Table of Contents The Euler Characteristic Spherical

More information

Hyperbolic Structures from Ideal Triangulations

Hyperbolic Structures from Ideal Triangulations Hyperbolic Structures from Ideal Triangulations Craig Hodgson University of Melbourne Geometric structures on 3-manifolds Thurston s idea: We would like to find geometric structures (or metrics) on 3-manifolds

More information

THE CROSSING NUMBER OF SATELLITE KNOTS

THE CROSSING NUMBER OF SATELLITE KNOTS THE CROSSING NUMBER OF SATELLITE KNOTS MARC LACKENBY 1. Introduction One of the most basic invariants of a knot K is its crossing number c(k), which is the minimal number of crossings in any of its diagrams.

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

Decomposition of the figure-8 knot

Decomposition of the figure-8 knot CHAPTER 1 Decomposition of the figure-8 knot This book is an introduction to knots, links, and their geometry. Before we begin, we need to define carefully exactly what we mean by knots and links, and

More information

Topological Graph Theory and Graphs of Positive Combinatorial Curvature. Marissa L. Childs

Topological Graph Theory and Graphs of Positive Combinatorial Curvature. Marissa L. Childs Topological Graph Theory and Graphs of Positive Combinatorial Curvature by Marissa L. Childs A thesis submitted in partial fulfillment of the requirements for graduation with Honors in Mathematics. Whitman

More information

GEOMETRY OF SURFACES. b3 course Nigel Hitchin

GEOMETRY OF SURFACES. b3 course Nigel Hitchin GEOMETRY OF SURFACES b3 course 2004 Nigel Hitchin hitchin@maths.ox.ac.uk 1 1 Introduction This is a course on surfaces. Your mental image of a surface should be something like this: or this However we

More information

Jordan Curves. A curve is a subset of IR 2 of the form

Jordan Curves. A curve is a subset of IR 2 of the form Jordan Curves A curve is a subset of IR 2 of the form α = {γ(x) : x [0, 1]}, where γ : [0, 1] IR 2 is a continuous mapping from the closed interval [0, 1] to the plane. γ(0) and γ(1) are called the endpoints

More information

Lectures on topology. S. K. Lando

Lectures on topology. S. K. Lando Lectures on topology S. K. Lando Contents 1 Reminder 2 1.1 Topological spaces and continuous mappings.......... 3 1.2 Examples............................. 4 1.3 Properties of topological spaces.................

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

Pebble Sets in Convex Polygons

Pebble Sets in Convex Polygons 2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon

More information

HW Graph Theory Name (andrewid) - X. 1: Draw K 7 on a torus with no edge crossings.

HW Graph Theory Name (andrewid) - X. 1: Draw K 7 on a torus with no edge crossings. 1: Draw K 7 on a torus with no edge crossings. A quick calculation reveals that an embedding of K 7 on the torus is a -cell embedding. At that point, it is hard to go wrong if you start drawing C 3 faces,

More information

Pacific Journal of Mathematics

Pacific Journal of Mathematics Pacific Journal of Mathematics SIMPLIFYING TRIANGULATIONS OF S 3 Aleksandar Mijatović Volume 208 No. 2 February 2003 PACIFIC JOURNAL OF MATHEMATICS Vol. 208, No. 2, 2003 SIMPLIFYING TRIANGULATIONS OF S

More information

Face Width and Graph Embeddings of face-width 2 and 3

Face Width and Graph Embeddings of face-width 2 and 3 Face Width and Graph Embeddings of face-width 2 and 3 Instructor: Robin Thomas Scribe: Amanda Pascoe 3/12/07 and 3/14/07 1 Representativity Recall the following: Definition 2. Let Σ be a surface, G a graph,

More information

Combinatorial constructions of hyperbolic and Einstein four-manifolds

Combinatorial constructions of hyperbolic and Einstein four-manifolds Combinatorial constructions of hyperbolic and Einstein four-manifolds Bruno Martelli (joint with Alexander Kolpakov) February 28, 2014 Bruno Martelli Constructions of hyperbolic four-manifolds February

More information

Answer Key: Three-Dimensional Cross Sections

Answer Key: Three-Dimensional Cross Sections Geometry A Unit Answer Key: Three-Dimensional Cross Sections Name Date Objectives In this lesson, you will: visualize three-dimensional objects from different perspectives be able to create a projection

More information

The Geodesic Integral on Medial Graphs

The Geodesic Integral on Medial Graphs The Geodesic Integral on Medial Graphs Kolya Malkin August 013 We define the geodesic integral defined on paths in the duals of medial graphs on surfaces and use it to study lens elimination and connection

More information

Example: The following is an example of a polyhedron. Fill the blanks with the appropriate answer. Vertices:

Example: The following is an example of a polyhedron. Fill the blanks with the appropriate answer. Vertices: 11.1: Space Figures and Cross Sections Polyhedron: solid that is bounded by polygons Faces: polygons that enclose a polyhedron Edge: line segment that faces meet and form Vertex: point or corner where

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

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

Polygons and Convexity

Polygons and Convexity Geometry Week 4 Sec 2.5 to ch. 2 test Polygons and Convexity section 2.5 convex set has the property that any two of its points determine a segment contained in the set concave set a set that is not convex

More information

Five Platonic Solids: Three Proofs

Five Platonic Solids: Three Proofs Five Platonic Solids: Three Proofs Vincent J. Matsko IMSA, Dodecahedron Day Workshop 18 November 2011 Convex Polygons convex polygons nonconvex polygons Euler s Formula If V denotes the number of vertices

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

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

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

Triangles and Squares David Eppstein, ICS Theory Group, April 20, 2001

Triangles and Squares David Eppstein, ICS Theory Group, April 20, 2001 Triangles and Squares David Eppstein, ICS Theory Group, April 20, 2001 Which unit-side-length convex polygons can be formed by packing together unit squares and unit equilateral triangles? For instance

More information

7th Bay Area Mathematical Olympiad

7th Bay Area Mathematical Olympiad 7th Bay Area Mathematical Olympiad February 22, 2005 Problems and Solutions 1 An integer is called formidable if it can be written as a sum of distinct powers of 4, and successful if it can be written

More information

by Troy Parkinson Color

by Troy Parkinson Color GOLDEN ROOTS OF CHROMATIC POLYNOMIALS by Troy Parkinson Color WHO, WHERE & WHEN Ruth Bari - Johns Hopkins Univ., 1966 William Tutte - Univ. of Waterloo, Canada, 1968 Saaty & Kainen - The Four- Color Problem,

More information

Simplicial Complexes: Second Lecture

Simplicial Complexes: Second Lecture Simplicial Complexes: Second Lecture 4 Nov, 2010 1 Overview Today we have two main goals: Prove that every continuous map between triangulable spaces can be approximated by a simplicial map. To do this,

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

THE CANONICAL DECOMPOSITION OF ONCE-PUNCTURED TORUS BUNDLES

THE CANONICAL DECOMPOSITION OF ONCE-PUNCTURED TORUS BUNDLES THE CANONICAL DECOMPOSITION OF ONCE-PUNCTURED TORUS BUNDLES MARC LACKENBY 1. Introduction Epstein and Penner proved that any complete, non-compact, finite volume hyperbolic manifold admits a canonical

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

Convex Hulls (3D) O Rourke, Chapter 4

Convex Hulls (3D) O Rourke, Chapter 4 Convex Hulls (3D) O Rourke, Chapter 4 Outline Polyhedra Polytopes Euler Characteristic (Oriented) Mesh Representation Polyhedra Definition: A polyhedron is a solid region in 3D space whose boundary is

More information

REGULAR POLYGON SURFACES

REGULAR POLYGON SURFACES REGULAR POLYGON SURFACES IAN ALEVY Abstract. A regular polygon surface M is a surface graph (Σ, Γ) together with a continuous map ψ from Σ into Euclidean 3-space which maps faces to regular polygons. When

More information

Math 366 Lecture Notes Section 11.4 Geometry in Three Dimensions

Math 366 Lecture Notes Section 11.4 Geometry in Three Dimensions Math 366 Lecture Notes Section 11.4 Geometry in Three Dimensions Simple Closed Surfaces A simple closed surface has exactly one interior, no holes, and is hollow. A sphere is the set of all points at a

More information

Chapter 4 Concepts from Geometry

Chapter 4 Concepts from Geometry Chapter 4 Concepts from Geometry An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Line Segments The line segment between two points and in R n is the set of points on the straight line joining

More information

Tiling of Sphere by Congruent Pentagons

Tiling of Sphere by Congruent Pentagons Tiling of Sphere by Congruent Pentagons Min Yan September 9, 2017 webpage for further reading: http://www.math.ust.hk/ mamyan/research/urop.shtml We consider tilings of the sphere by congruent pentagons.

More information

Embedded graphs. Sasha Patotski. Cornell University November 24, 2014

Embedded graphs. Sasha Patotski. Cornell University November 24, 2014 Embedded graphs Sasha Patotski Cornell University ap744@cornell.edu November 24, 2014 Sasha Patotski (Cornell University) Embedded graphs November 24, 2014 1 / 11 Exercise Embed K 6 and K 7 into a torus.

More information

Curvature Berkeley Math Circle January 08, 2013

Curvature Berkeley Math Circle January 08, 2013 Curvature Berkeley Math Circle January 08, 2013 Linda Green linda@marinmathcircle.org Parts of this handout are taken from Geometry and the Imagination by John Conway, Peter Doyle, Jane Gilman, and Bill

More information

A Characterization of Alternating Link Exteriors

A Characterization of Alternating Link Exteriors A Characterization of Alternating Link Exteriors Shunsuke Sakai Hiroshima University 2017/12/25 S. Sakai (Hiroshima Univ.) A Characterization of Alt. Link Exteriors 2017/12/25 1 / 32 Introduction Motivation

More information

Classifications in Low Dimensions

Classifications in Low Dimensions Chapter XI Classifications in Low Dimensions In different geometric subjects there are different ideas which dimensions are low and which high. In topology of manifolds low dimension means at most 4. However,

More information

What would you see if you live on a flat torus? What is the relationship between it and a room with 2 mirrors?

What would you see if you live on a flat torus? What is the relationship between it and a room with 2 mirrors? DAY I Activity I: What is the sum of the angles of a triangle? How can you show it? How about a quadrilateral (a shape with 4 sides)? A pentagon (a shape with 5 sides)? Can you find the sum of their angles

More information

arxiv: v1 [math.co] 3 Nov 2017

arxiv: v1 [math.co] 3 Nov 2017 DEGREE-REGULAR TRIANGULATIONS OF SURFACES BASUDEB DATTA AND SUBHOJOY GUPTA arxiv:1711.01247v1 [math.co] 3 Nov 2017 Abstract. A degree-regular triangulation is one in which each vertex has identical degree.

More information

1 What is a Manifold?

1 What is a Manifold? Three-Dimensional Geometry and Topology Alvin Jin These are the notes that accompany an independent study on three-dimensional geometry and topology that closely follows Thurston s volume 1 book of the

More information

Flavor of Computational Geometry. Convex Hull in 2D. Shireen Y. Elhabian Aly A. Farag University of Louisville

Flavor of Computational Geometry. Convex Hull in 2D. Shireen Y. Elhabian Aly A. Farag University of Louisville Flavor of Computational Geometry Convex Hull in 2D Shireen Y. Elhabian Aly A. Farag University of Louisville February 2010 Agenda Introduction Definitions of Convexity and Convex Hulls Naïve Algorithms

More information

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

Hyperbolic Geometry on the Figure-Eight Knot Complement

Hyperbolic Geometry on the Figure-Eight Knot Complement Hyperbolic Geometry on the Figure-Eight Knot Complement Alex Gutierrez Arizona State University December 10, 2012 Hyperbolic Space Hyperbolic Space Hyperbolic space H n is the unique complete simply-connected

More information

ON THE FUNDAMENTAL GROUP OF SURFACES

ON THE FUNDAMENTAL GROUP OF SURFACES ON THE FUNDAMENTAL GROUP OF SURFACES MATTHEW ACTIPES Abstract. This paper begins by reviewing the idea of homotopy while motivating the idea of the fundamental group. We then define free groups and the

More information

Tomaz Pisanski, University of Ljubljana, Slovenia. Thomas W. Tucker, Colgate University. Arjana Zitnik, University of Ljubljana, Slovenia

Tomaz Pisanski, University of Ljubljana, Slovenia. Thomas W. Tucker, Colgate University. Arjana Zitnik, University of Ljubljana, Slovenia Eulerian Embeddings of Graphs Tomaz Pisanski, University of Ljubljana, Slovenia Thomas W. Tucker, Colgate University Arjana Zitnik, University of Ljubljana, Slovenia Abstract A straight-ahead walk in an

More information

4. Definition: topological space, open set, topology, trivial topology, discrete topology.

4. Definition: topological space, open set, topology, trivial topology, discrete topology. Topology Summary Note to the reader. If a statement is marked with [Not proved in the lecture], then the statement was stated but not proved in the lecture. Of course, you don t need to know the proof.

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

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

COMMENSURABILITY FOR CERTAIN RIGHT-ANGLED COXETER GROUPS AND GEOMETRIC AMALGAMS OF FREE GROUPS

COMMENSURABILITY FOR CERTAIN RIGHT-ANGLED COXETER GROUPS AND GEOMETRIC AMALGAMS OF FREE GROUPS COMMENSURABILITY FOR CERTAIN RIGHT-ANGLED COXETER GROUPS AND GEOMETRIC AMALGAMS OF FREE GROUPS PALLAVI DANI, EMILY STARK AND ANNE THOMAS Abstract. We give explicit necessary and sufficient conditions for

More information