Puzzling the 120 cell

Size: px
Start display at page:

Download "Puzzling the 120 cell"

Transcription

1 Henry Segerman Oklahoma State University Saul Schleimer University of Warwick Puzzling the 120 cell

2 Burr puzzles The goal of a burr puzzle is to assemble a number of notched sticks into a single object. In this talk, I will describe Quintessence, a family of burr puzzles based on the 120 cell.

3 The 120-cell The 120 cell is a regular 4 dimensional polytope.

4 The 120-cell The 120 cell is a regular 4 dimensional polytope. It has 120 dodecahedral cells, 720 pentagonal faces, 1200 edges, and 600 vertices.

5 The 120-cell The 120 cell is a regular 4 dimensional polytope. It has 120 dodecahedral cells, 720 pentagonal faces, 1200 edges, and 600 vertices. We use radial projection followed by stereographic projection to help us visualise the 120 cell. R 4 {0} S 3 R 4 (w, x, y, z) (w, x, y, z) (w, x, y, z) S 3 {N} R 3 ( ) x (w, x, y, z) 1 w, y 1 w, z 1 w

6 Stereographic projection In general, stereographic projection maps from S n {N} to R n.

7 Stereographic projection In general, stereographic projection maps from S n {N} to R n. For n = 1, we define ρ: S 1 {N} R 1 by ρ(x, y) = x 1 y.

8 Stereographic projection In general, stereographic projection maps from S n {N} to R n. For n = 1, we define ρ: S 1 {N} R 1 by ρ(x, y) = x 1 y. S 1 N R 1

9 Stereographic projection In general, stereographic projection maps from S n {N} to R n. For n = 1, we define ρ: S 1 {N} R 1 by ρ(x, y) = x 1 y. S 1 N R 1 x 1{y (x,y)

10 Stereographic projection In general, stereographic projection maps from S n {N} to R n. For n = 1, we define ρ: S 1 {N} R 1 by ρ(x, y) = x 1 y. S 1 N R 1 x 1{y (x,y) This is a cross-section of stereographic projection for n > 1.

11 Example: projecting a cube into R2

12 Example: projecting a cube into R 2 Radial projection R 3 {0} S 2 (x, y, z) (x, y, z) (x, y, z)

13 Example: projecting a cube into R 2 Radial projection R 3 {0} S 2 (x, y, z) (x, y, z) (x, y, z) Stereographic projection S 2 {N} R 2 ( ) x (x, y, z) 1 z, y 1 z

14 Vertex-centered versus cell-centered projection

15 Vertex-centered versus cell-centered projection

16 Vertex-centered versus cell-centered projection

17 Vertex-centered versus cell-centered projection

18 Vertex-centered versus cell-centered projection

19 Do the same one dimension up to see a hypercube

20 This is the cell-centered projection of the 120-cell; it has dodecahedral symmetry in R 3.

21 The vertex-centered projection has tetrahedral symmetry in R 3 and so has fewer possibilities for puzzle making. Other choices have even less symmetry, and so have even fewer interesting ways to combine pieces.

22 Spherical layers in the 120 cell A first way to understand the combinatorics of the 120 cell is to look at the layers of dodecahedra at fixed distances from the central dodecahedron.

23 Spherical layers in the 120 cell A first way to understand the combinatorics of the 120 cell is to look at the layers of dodecahedra at fixed distances from the central dodecahedron. 1 central dodecahedron

24 Spherical layers in the 120 cell A first way to understand the combinatorics of the 120 cell is to look at the layers of dodecahedra at fixed distances from the central dodecahedron. 1 central dodecahedron 12 dodecahedra at distance π/5

25 Spherical layers in the 120 cell A first way to understand the combinatorics of the 120 cell is to look at the layers of dodecahedra at fixed distances from the central dodecahedron. 1 central dodecahedron 12 dodecahedra at distance π/5 20 dodecahedra at distance π/3

26 Spherical layers in the 120 cell A first way to understand the combinatorics of the 120 cell is to look at the layers of dodecahedra at fixed distances from the central dodecahedron. 1 central dodecahedron 12 dodecahedra at distance π/5 20 dodecahedra at distance π/3 12 dodecahedra at distance 2π/5

27 Spherical layers in the 120 cell A first way to understand the combinatorics of the 120 cell is to look at the layers of dodecahedra at fixed distances from the central dodecahedron. 1 central dodecahedron 12 dodecahedra at distance π/5 20 dodecahedra at distance π/3 12 dodecahedra at distance 2π/5 30 dodecahedra at distance π/2

28 Spherical layers in the 120 cell A first way to understand the combinatorics of the 120 cell is to look at the layers of dodecahedra at fixed distances from the central dodecahedron. 1 central dodecahedron 12 dodecahedra at distance π/5 20 dodecahedra at distance π/3 12 dodecahedra at distance 2π/5 30 dodecahedra at distance π/2 The pattern is mirrored in the last four layers = 120

29 Hopf fibers in the 120 cell A second way to understand the 120 cell is via a combinatorial version of the Hopf fibration.

30 Hopf fibers in the 120 cell A second way to understand the 120 cell is via a combinatorial version of the Hopf fibration. Each fiber is a ring of 10 dodecahedra.

31 Hopf fibers in the 120 cell A second way to understand the 120 cell is via a combinatorial version of the Hopf fibration. Each fiber is a ring of 10 dodecahedra. The rings wrap around each other.

32 Hopf fibers in the 120 cell A second way to understand the 120 cell is via a combinatorial version of the Hopf fibration. Each fiber is a ring of 10 dodecahedra. The rings wrap around each other.

33 Hopf fibers in the 120 cell A second way to understand the 120 cell is via a combinatorial version of the Hopf fibration. Each fiber is a ring of 10 dodecahedra. The rings wrap around each other.

34 Hopf fibers in the 120 cell A second way to understand the 120 cell is via a combinatorial version of the Hopf fibration. Each fiber is a ring of 10 dodecahedra. The rings wrap around each other. Each ring is surrounded by five others.

35 Hopf fibers in the 120 cell A second way to understand the 120 cell is via a combinatorial version of the Hopf fibration. Each fiber is a ring of 10 dodecahedra. The rings wrap around each other. Each ring is surrounded by five others.

36 Hopf fibers in the 120 cell A second way to understand the 120 cell is via a combinatorial version of the Hopf fibration. Each fiber is a ring of 10 dodecahedra. The rings wrap around each other. Each ring is surrounded by five others. These six rings make up half of the 120 cell. The other half consists of five more rings that wrap around these, and one more ring dual to the original grey one = 12 = 120/10

37 Hopf fibers in the 120 cell A second way to understand the 120 cell is via a combinatorial version of the Hopf fibration. Each fiber is a ring of 10 dodecahedra. The rings wrap around each other. Each ring is surrounded by five others. These six rings make up half of the 120 cell. The other half consists of five more rings that wrap around these, and one more ring dual to the original grey one = 12 = 120/10

38 Hopf fibers in the 120 cell A second way to understand the 120 cell is via a combinatorial version of the Hopf fibration. Each fiber is a ring of 10 dodecahedra. The rings wrap around each other. Each ring is surrounded by five others. These six rings make up half of the 120 cell. The other half consists of five more rings that wrap around these, and one more ring dual to the original grey one = 12 = 120/10

39 Hopf fibers in the 120 cell A second way to understand the 120 cell is via a combinatorial version of the Hopf fibration. Each fiber is a ring of 10 dodecahedra. The rings wrap around each other. Each ring is surrounded by five others. These six rings make up half of the 120 cell. The other half consists of five more rings that wrap around these, and one more ring dual to the original grey one = 12 = 120/10

40 Hopf fibers in the 120 cell A second way to understand the 120 cell is via a combinatorial version of the Hopf fibration. Each fiber is a ring of 10 dodecahedra. The rings wrap around each other. Each ring is surrounded by five others. These six rings make up half of the 120 cell. The other half consists of five more rings that wrap around these, and one more ring dual to the original grey one = 12 = 120/10

41 Hopf fibers in the 120 cell A second way to understand the 120 cell is via a combinatorial version of the Hopf fibration. Each fiber is a ring of 10 dodecahedra. The rings wrap around each other. Each ring is surrounded by five others. These six rings make up half of the 120 cell. The other half consists of five more rings that wrap around these, and one more ring dual to the original grey one = 12 = 120/10

42 We wanted to 3D print all six of the inner rings together; it seems this cannot be done without them touching each other. (Parts intended to move must not touch during the printing process.)

43

44

45 To print all five we use a trick...

46 To print all five we use a trick... don t print the whole ring. We call part of a ring a rib.

47 To print all five we use a trick... don t print the whole ring. We call part of a ring a rib.

48 To print all five we use a trick... don t print the whole ring. We call part of a ring a rib.

49 To print all five we use a trick... don t print the whole ring. We call part of a ring a rib.

50 To print all five we use a trick... don t print the whole ring. We call part of a ring a rib.

51 To print all five we use a trick... don t print the whole ring. We call part of a ring a rib.

52 To print all five we use a trick... don t print the whole ring. We call part of a ring a rib.

53 Dc30 Ring puzzle

54 Another decomposition, with even shorter ribs.

55 Another decomposition, with even shorter ribs.

56 Another decomposition, with even shorter ribs.

57 Another decomposition, with even shorter ribs.

58 Another decomposition, with even shorter ribs.

59 Another decomposition, with even shorter ribs.

60 Another decomposition, with even shorter ribs.

61 Another decomposition, with even shorter ribs.

62 Another decomposition, with even shorter ribs.

63 Another decomposition, with even shorter ribs.

64 Another decomposition, with even shorter ribs.

65 Dc45 Meteor puzzle

66 Six kinds of ribs spine inner 6 outer 6 inner 4 outer 4 equator

67 These make many puzzles, which we collectively call Quintessence.

68 Theorem At most six inner ribs are used in any puzzle. At most six outer ribs are used in any puzzle. At most ten inner and outer ribs are used in any puzzle.

69 Theorem At most six inner ribs are used in any puzzle. At most six outer ribs are used in any puzzle. At most ten inner and outer ribs are used in any puzzle. Proof.

70 Theorem At most six inner ribs are used in any puzzle. At most six outer ribs are used in any puzzle. At most ten inner and outer ribs are used in any puzzle. Proof.

71 Theorem At most six inner ribs are used in any puzzle. At most six outer ribs are used in any puzzle. At most ten inner and outer ribs are used in any puzzle. Proof.

72 Further possibilities: vertex centered projection Dv30 Asteroid puzzle

73 Further possibilities: other polytopes The 600-cell works, although the ribs now have handedness. Tv270 Meteor puzzle

74 Further possibilities: other polytopes The 600-cell works, although the ribs now have handedness. Tv270 Meteor puzzle The other regular polytopes seem to have too few cells to make interesting puzzles.

75 Thanks!

Puzzling the 120 Cell

Puzzling the 120 Cell Puzzling the Cell Saul Schleimer and Henry Segerman called the 6-piece burrs [5]. Another well-known burr, the star burr, is more closely related to our work. Unlike the 6-piece burrs, the six sticks of

More information

Recent 3D Printed Sculptures

Recent 3D Printed Sculptures Recent 3D Printed Sculptures Henry Segerman November 13, 2011 1 Introduction I am a mathematician and a mathematical artist, currently a research fellow in the Department of Mathematics and Statistics

More information

How to print a Hypercube

How to print a Hypercube How to print a Hypercube Henry Segerman One of the things that mathematics is about, perhaps the thing that mathematics is about, is trying to make things easier to understand. John von Neumann once said

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

Keeping it Platonic. Anna Romanova. February 2, infinity, five, six, three, three, three, three,...

Keeping it Platonic. Anna Romanova. February 2, infinity, five, six, three, three, three, three,... MFA UTAH TEACHERS MATH CIRCLE Keeping it Platonic Anna Romanova February 2, 2016 1 THE PUZZLE IN THE ABSTRACT What is the pattern in this sequence? infinity, five, six, three, three, three, three,... Our

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

Platonic Solids. Jennie Sköld. January 21, Karlstad University. Symmetries: Groups Algebras and Tensor Calculus FYAD08

Platonic Solids. Jennie Sköld. January 21, Karlstad University. Symmetries: Groups Algebras and Tensor Calculus FYAD08 Platonic Solids Jennie Sköld January 21, 2015 Symmetries: Groups Algebras and Tensor Calculus FYAD08 Karlstad University 1 Contents 1 What are Platonic Solids? 3 2 Symmetries in 3-Space 5 2.1 Isometries

More information

ACTUALLY DOING IT : an Introduction to Polyhedral Computation

ACTUALLY DOING IT : an Introduction to Polyhedral Computation ACTUALLY DOING IT : an Introduction to Polyhedral Computation Jesús A. De Loera Department of Mathematics Univ. of California, Davis http://www.math.ucdavis.edu/ deloera/ 1 What is a Convex Polytope? 2

More information

Symmetry and the Klein quartic. Saul Schleimer, University of Warwick (Joint work with Henry Segerman) , 3D Printing Workshop, Durham

Symmetry and the Klein quartic. Saul Schleimer, University of Warwick (Joint work with Henry Segerman) , 3D Printing Workshop, Durham Symmetry and the Klein quartic Saul Schleimer, University of Warwick (Joint work with Henry Segerman) 2017-06-08, 3D Printing Workshop, Durham Tilings Tilings everywhere Frieze, British Museum Tilings

More information

Hyperseeing the Regular Hendecachoron

Hyperseeing the Regular Hendecachoron Hyperseeing the Regular Hendecachoron Carlo H. Séquin EECS, UC Berkeley E-mail: sequin@cs.berkeley.edu Jaron Lanier CET, UC Berkeley E-mail: jaron@jaronlanier.com Abstract The hendecachoron is an abstract

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

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

Sculptures in S3. Saul Schleimer and Henry Segerman. Abstract

Sculptures in S3. Saul Schleimer and Henry Segerman. Abstract Sculptures in S3 Saul Schleimer and Henry Segerman Abstract We describe the construction of a number of sculptures. Each is based on a geometric design native to the threesphere: the unit sphere in four-dimensional

More information

REGULAR POLYTOPES REALIZED OVER Q

REGULAR POLYTOPES REALIZED OVER Q REGULAR POLYTOPES REALIZED OVER Q TREVOR HYDE A regular polytope is a d-dimensional generalization of a regular polygon and a Platonic solid. Roughly, they are convex geometric objects with maximal rotational

More information

Map-colouring with Polydron

Map-colouring with Polydron Map-colouring with Polydron The 4 Colour Map Theorem says that you never need more than 4 colours to colour a map so that regions with the same colour don t touch. You have to count the region round the

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

Puzzle page. Mathematical Misfits three dimensional. Dual polygons. Puzzle page

Puzzle page. Mathematical Misfits three dimensional. Dual polygons. Puzzle page 1997 2009, Millennium Mathematics Project, University of Cambridge. Permission is granted to print and copy this page on paper for non commercial use. For other uses, including electronic redistribution,

More information

Subdivision Rules, 3-Manifolds, and Circle Packings

Subdivision Rules, 3-Manifolds, and Circle Packings righam Young University YU Scholarsrchive ll Theses and Dissertations 2012-03-07 Subdivision Rules, 3-Manifolds, and Circle Packings rian Craig Rushton righam Young University - Provo Follow this and additional

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

A Study of the Rigidity of Regular Polytopes

A Study of the Rigidity of Regular Polytopes A Study of the Rigidity of Regular Polytopes A Thesis Presented in Partial Fulfillment of the Requirements for the Degree Master of Science in the Graduate School of The Ohio State University By Helene

More information

PÓLYA S THEORY OF COUNTING

PÓLYA S THEORY OF COUNTING PÓLYA S THEORY OF COUNTING MANJIL P. SAIKIA Abstract. In this report, we shall study Pólya s Theory of Counting and apply it to solve some questions related to rotations of the platonic solids. Key Words:

More information

Researches on polyhedra, Part I A.-L. Cauchy

Researches on polyhedra, Part I A.-L. Cauchy Researches on polyhedra, Part I A.-L. Cauchy Translated into English by Guy Inchbald, 2006 from the original: A.-L. Cauchy, Recherches sur les polyèdres. Première partie, Journal de l École Polytechnique,

More information

Realizing Planar Graphs as Convex Polytopes. Günter Rote Freie Universität Berlin

Realizing Planar Graphs as Convex Polytopes. Günter Rote Freie Universität Berlin Realizing Planar Graphs as Convex Polytopes Günter Rote Freie Universität Berlin General Problem Statement GIVEN: a combinatorial type of 3-dimensional polytope (a 3-connected planar graph) [ + additional

More information

Special Links. work in progress with Jason Deblois & Henry Wilton. Eric Chesebro. February 9, 2008

Special Links. work in progress with Jason Deblois & Henry Wilton. Eric Chesebro. February 9, 2008 work in progress with Jason Deblois & Henry Wilton February 9, 2008 Thanks for listening! Construction Properties A motivating question Virtually fibered: W. Thurston asked whether every hyperbolic 3-manifold

More information

Pick up some wrapping paper.

Pick up some wrapping paper. Pick up some wrapping paper. What is the area of the following Christmas Tree? There is a nice theorem that allows one to compute the area of any simply-connected (i.e. no holes) grid polygon quickly.

More information

Combinatorics: The Fine Art of Counting

Combinatorics: The Fine Art of Counting Combinatorics: The Fine Art of Counting Week Eight Problems 1. Diagrams of all the distinct non-isomorphic trees on 6 or fewer vertices are listed in the lecture notes. Extend this list by drawing all

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

Cluster algebras and infinite associahedra

Cluster algebras and infinite associahedra Cluster algebras and infinite associahedra Nathan Reading NC State University CombinaTexas 2008 Coxeter groups Associahedra and cluster algebras Sortable elements/cambrian fans Infinite type Much of the

More information

Nets and Tiling. Michael O'Keeffe. Introduction to tiling theory and its application to crystal nets

Nets and Tiling. Michael O'Keeffe. Introduction to tiling theory and its application to crystal nets Nets and Tiling Michael O'Keeffe Introduction to tiling theory and its application to crystal nets Start with tiling in two dimensions. Surface of sphere and plane Sphere is two-dimensional. We require

More information

Counting Faces of Polytopes

Counting Faces of Polytopes Counting Faces of Polytopes Carl Lee University of Kentucky James Madison University March 2015 Carl Lee (UK) Counting Faces of Polytopes James Madison University 1 / 36 Convex Polytopes A convex polytope

More information

Sculptures in S 3. Coventry CV4 7AL Parkville VIC Abstract. 1 Introduction.

Sculptures in S 3. Coventry CV4 7AL Parkville VIC Abstract. 1 Introduction. Bridges 0: Mathematics, Music, Art, Architecture, Culture Sculptures in S 3 Saul Schleimer Henry Segerman Mathematics Institute Department of Mathematics and Statistics University of Warwick University

More information

Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams

Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams Khalegh Mamakani and Frank Ruskey Dept. of Computer Science, University of Victoria, Canada. Abstract. An n-venn diagram consists

More information

Q-Gorenstein deformation families of Fano varieties or The combinatorics of Mirror Symmetry. Alexander Kasprzyk

Q-Gorenstein deformation families of Fano varieties or The combinatorics of Mirror Symmetry. Alexander Kasprzyk Q-Gorenstein deformation families of Fano varieties or The combinatorics of Mirror Symmetry Alexander Kasprzyk Fano manifolds Smooth varieties, called manifolds, come with a natural notion of curvature,

More information

MT5821 Advanced Combinatorics

MT5821 Advanced Combinatorics MT5821 Advanced Combinatorics 4 Graph colouring and symmetry There are two colourings of a 4-cycle with two colours (red and blue): one pair of opposite vertices should be red, the other pair blue. There

More information

Parallelohedra and the Voronoi Conjecture

Parallelohedra and the Voronoi Conjecture Alexey Garber Bielefeld University November 28, 2012 Parallelohedra Denition Convex d-dimensional polytope P is called a parallelohedron if R d can be (face-to-face) tiled into parallel copies of P. Parallelohedra

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

The Jitterbug Motion

The Jitterbug Motion The By 80-4 Poplar St. Rochester, NY 460 Copyright, September 00 09-9-00 Introduction We develop a set of equations which describes the motion of a triangle and a vertex of the Jitterbug. The Jitterbug

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

Patterned Triply Periodic Polyhedra

Patterned Triply Periodic Polyhedra Patterned Triply Periodic Polyhedra Douglas Dunham Department of Computer Science University of Minnesota, Duluth Duluth, MN 55812-3036, USA E-mail: ddunham@d.umn.edu Web Site: http://www.d.umn.edu/ ddunham/

More information

8.B. The result of Regiomontanus on tetrahedra

8.B. The result of Regiomontanus on tetrahedra 8.B. The result of Regiomontanus on tetrahedra We have already mentioned that Plato s theory that the five regular polyhedra represent the fundamental elements of nature, and in supplement (3.D) to the

More information

Triangulations of hyperbolic 3-manifolds admitting strict angle structures

Triangulations of hyperbolic 3-manifolds admitting strict angle structures Triangulations of hyperbolic 3-manifolds admitting strict angle structures Craig D. Hodgson, J. Hyam Rubinstein and Henry Segerman segerman@unimelb.edu.au University of Melbourne January 4 th 2012 Ideal

More information

CS70 - Lecture 6. Graphs: Coloring; Special Graphs. 1. Review of L5 2. Planar Five Color Theorem 3. Special Graphs:

CS70 - Lecture 6. Graphs: Coloring; Special Graphs. 1. Review of L5 2. Planar Five Color Theorem 3. Special Graphs: CS70 - Lecture 6 Graphs: Coloring; Special Graphs 1. Review of L5 2. Planar Five Color Theorem 3. Special Graphs: Trees: Three characterizations Hypercubes: Strongly connected! Administration You need

More information

Three-Dimensional Shapes

Three-Dimensional Shapes Lesson 11.1 Three-Dimensional Shapes Three-dimensional objects come in different shapes. sphere cone cylinder rectangular prism cube Circle the objects that match the shape name. 1. rectangular prism 2.

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

Two Connections between Combinatorial and Differential Geometry

Two Connections between Combinatorial and Differential Geometry Two Connections between Combinatorial and Differential Geometry John M. Sullivan Institut für Mathematik, Technische Universität Berlin Berlin Mathematical School DFG Research Group Polyhedral Surfaces

More information

Surprises in high dimensions. Martin Lotz Galois Group, April 22, 2015

Surprises in high dimensions. Martin Lotz Galois Group, April 22, 2015 Surprises in high dimensions Martin Lotz Galois Group, April 22, 2015 Ladd Ehlinger Jr. (dir). Flatland, 2007. Life in 2D Life in 2D Edwin A. Abbott. Flatland: A Romance of Many Dimensions, 1884. The novella

More information

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

The exotic dodecahedron M 0,5 (R) David P. Roberts University of Minnesota, Morris 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

More information

Polyhedral Transformation: Explosion-Implosion

Polyhedral Transformation: Explosion-Implosion Polyhedral Transformation: Explosion-Implosion Robert McDermott Center for High Performance Computing University of Utah Salt Lake City, Utah 84112, USA Email: mcdermott@chpc.utah.edu Abstract Polyhedral

More information

Tiling Three-Dimensional Space with Simplices. Shankar Krishnan AT&T Labs - Research

Tiling Three-Dimensional Space with Simplices. Shankar Krishnan AT&T Labs - Research Tiling Three-Dimensional Space with Simplices Shankar Krishnan AT&T Labs - Research What is a Tiling? Partition of an infinite space into pieces having a finite number of distinct shapes usually Euclidean

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

Spherical Tiling by Congruent Pentagons

Spherical Tiling by Congruent Pentagons Spherical Tiling by Congruent Pentagons Min Yan November 12, 2015 webpage for further reading: http://www.math.ust.hk/ mamyan/research/urop.shtml We consider tilings of the sphere by congruent pentagons.

More information

Veering triangulations admit strict angle structures

Veering triangulations admit strict angle structures Veering triangulations admit strict angle structures Craig Hodgson University of Melbourne Joint work with Hyam Rubinstein, Henry Segerman and Stephan Tillmann. Geometric Triangulations We want to understand

More information

Sonobe Origami for enriching understanding of geometric concepts in three dimensions. DONNA A. DIETZ American University Washington, D.C.

Sonobe Origami for enriching understanding of geometric concepts in three dimensions. DONNA A. DIETZ American University Washington, D.C. Sonobe Origami for enriching understanding of geometric concepts in three dimensions DONNA A. DIETZ American University Washington, D.C. Donna Dietz, American University Sonobe Origami for enriching understanding

More information

also can be decomposed into generalized triangles,

also can be decomposed into generalized triangles, 13. ORBIFOLDS The orbifold D 2 (;m 1,...,m l ) also can be decomposed into generalized triangles, for instance in the pattern above. One immediately sees that the orbifold has hyperbolic structures (provided

More information

Discrete minimal surfaces of Koebe type

Discrete minimal surfaces of Koebe type Discrete minimal surfaces of Koebe type Alexander I. Bobenko, Ulrike Bücking, Stefan Sechelmann March 5, 2018 1 Introduction Minimal surfaces have been studied for a long time, but still contain unsolved

More information

Mathematics As A Liberal Art

Mathematics As A Liberal Art Math 105 Fall 2015 BY: 2015 Ron Buckmire Mathematics As A Liberal Art Class 26: Friday November 13 Fowler 302 MWF 10:40am- 11:35am http://sites.oxy.edu/ron/math/105/15/ Euclid, Geometry and the Platonic

More information

Combinatorial Tilings of the Sphere by Pentagons

Combinatorial Tilings of the Sphere by Pentagons Combinatorial Tilings of the Sphere by Pentagons Min Yan Department of Mathematics Hong Kong University of Science and Technology Kowloon, Hong Kong mamyan@ust.hk Submitted: Nov 16, 2012; Accepted: Mar

More information

SHAPE AND STRUCTURE. Shape and Structure. An explanation of Mathematical terminology

SHAPE AND STRUCTURE. Shape and Structure. An explanation of Mathematical terminology Shape and Structure An explanation of Mathematical terminology 2005 1 POINT A dot Dots join to make lines LINE A line is 1 dimensional (length) A line is a series of points touching each other and extending

More information

Platonic Polyhedra and How to Construct Them

Platonic Polyhedra and How to Construct Them Platonic Polyhedra and How to Construct Them Tarun Biswas June 17, 2016 The platonic polyhedra (or platonic solids) are convex regular polyhedra that have identical regular polygons as faces They are characterized

More information

Dr. Allen Back. Nov. 21, 2014

Dr. Allen Back. Nov. 21, 2014 Dr. Allen Back of Nov. 21, 2014 The most important thing you should know (e.g. for exams and homework) is how to setup (and perhaps compute if not too hard) surface integrals, triple integrals, etc. But

More information

Worksheet 3.5: Triple Integrals in Spherical Coordinates. Warm-Up: Spherical Coordinates (ρ, φ, θ)

Worksheet 3.5: Triple Integrals in Spherical Coordinates. Warm-Up: Spherical Coordinates (ρ, φ, θ) Boise State Math 275 (Ultman) Worksheet 3.5: Triple Integrals in Spherical Coordinates From the Toolbox (what you need from previous classes) Know what the volume element dv represents. Be able to find

More information

Visualizing hyperbolic honeycombs

Visualizing hyperbolic honeycombs Journal of Mathematics and the Arts ISSN: 1751-3472 (Print) 1751-3480 (Online) Journal homepage: http://www.tandfonline.com/loi/tmaa20 Visualizing hyperbolic honeycombs Roice Nelson & Henry Segerman To

More information

Visual Techniques For Computing Polyhedral Volumes

Visual Techniques For Computing Polyhedral Volumes Visual Techniques For Computing Polyhedral Volumes T. V. Raman raman@cs.cornell.edu M. S. Krishnamoorthy moorthy@cs.rpi.edu January 1, 00 001/08/300:6:36 UTC Abstract The volume of regular polyhedra have

More information

Dimension Theory: Road to the Fourth Dimension and Beyond

Dimension Theory: Road to the Fourth Dimension and Beyond Dimension Theory: Road to the Fourth Dimension and Beyond 0-dimension Behold yon miserable creature. That Point is a Being like ourselves, but confined to the non-dimensional Gulf. He is himself his own

More information

Rigid Motions of K 5 Obtained from D 6 Action on Planar Rooted Trees

Rigid Motions of K 5 Obtained from D 6 Action on Planar Rooted Trees Rigid Motions of K 5 Obtained from D 6 Action on Planar Rooted Trees Sebastian Karlsson sebastiankarlsson29@gmail.com under the direction of Dr. Benjamin Ward Department of Mathematics Stockholm University

More information

Today. Types of graphs. Complete Graphs. Trees. Hypercubes.

Today. Types of graphs. Complete Graphs. Trees. Hypercubes. Today. Types of graphs. Complete Graphs. Trees. Hypercubes. Complete Graph. K n complete graph on n vertices. All edges are present. Everyone is my neighbor. Each vertex is adjacent to every other vertex.

More information

Obtaining the H and T Honeycomb from a Cross-Section of the 16-cell Honeycomb

Obtaining the H and T Honeycomb from a Cross-Section of the 16-cell Honeycomb Bridges 2017 Conference Proceedings Obtaining the H and T Honeycomb from a Cross-Section of the 16-cell Honeycomb Hideki Tsuiki Graduate School of Human and Environmental Studies, Kyoto University Yoshida-Nihonmatsu,

More information

Toric Cohomological Rigidity of Simple Convex Polytopes

Toric Cohomological Rigidity of Simple Convex Polytopes Toric Cohomological Rigidity of Simple Convex Polytopes Dong Youp Suh (KAIST) The Second East Asian Conference on Algebraic Topology National University of Singapore December 15-19, 2008 1/ 28 This talk

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

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

Hyperbolic Pascal Simplex

Hyperbolic Pascal Simplex INTERNATIONAL ELECTRONIC JOURNAL O GEOMETRY VOLUME 0 NO. PAGE 46 55 (07) Hyperbolic Pascal Simplex László Németh (Communicated by Cihan Özgür) ABSTRACT In this article we introduce a new geometric object

More information

MATH 200 WEEK 9 - WEDNESDAY TRIPLE INTEGRALS

MATH 200 WEEK 9 - WEDNESDAY TRIPLE INTEGRALS MATH WEEK 9 - WEDNESDAY TRIPLE INTEGRALS MATH GOALS Be able to set up and evaluate triple integrals using rectangular, cylindrical, and spherical coordinates MATH TRIPLE INTEGRALS We integrate functions

More information

Ratcliffe, Foundations of hyperbolic manifolds, Springer (elementary)

Ratcliffe, Foundations of hyperbolic manifolds, Springer (elementary) 1 Introduction About this lecture P SL(2, C) and hyperbolic 3-spaces. Subgroups of P SL(2, C) Hyperbolic manifolds and orbifolds Examples 3-manifold topology and Dehn surgery Rigidity Volumes and ideal

More information

COMBINATORIAL GEOMETRY

COMBINATORIAL GEOMETRY 4 TH CLASS STARTER 9/23/14 3 RD CLASS STARTER 9/16/14 If you re allowed to make only a single, planar (flat) cut in order to slice a cube of cheese into two pieces, what shapes can the resulting faces

More information

CS 763 F16. Moving objects in space with obstacles/constraints.

CS 763 F16. Moving objects in space with obstacles/constraints. Moving objects in space with obstacles/constraints. Objects = robots, vehicles, jointed linkages (robot arm), tools (e.g. on automated assembly line), foldable/bendable objects. Objects need not be physical

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

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

Non-euclidean Virtual Reality I: Explorations of H3

Non-euclidean Virtual Reality I: Explorations of H3 Bridges 2017 Conference Proceedings Non-euclidean Virtual Reality I: Explorations of H3 Vi Hart elevr HARC Andrea Hawksley Elisabetta A. Matsumoto elevr School of Physics HARC Georgia Institute of Technology

More information

Regular polytopes Notes for talks given at LSBU, November & December 2014 Tony Forbes

Regular polytopes Notes for talks given at LSBU, November & December 2014 Tony Forbes Regular polytopes Notes for talks given at LSBU, November & December 2014 Tony Forbes Flags A flag is a sequence (f 1, f 0,..., f n ) of faces f i of a polytope f n, each incident with the next, with precisely

More information

Jitterbug Defined Polyhedra: The Shape and Dynamics of Space

Jitterbug Defined Polyhedra: The Shape and Dynamics of Space Jitterbug Defined Polyhedra: The Shape and Dynamics of Space by Robert W. Gray rwgray@rwgrayprojects.com Oct. 25-26, 2001 This presentation may be found at: http://www.rwgrayprojects.com/oswegooct2001/presentation/prsentationweb.html

More information

,. ~ ~ Blending Polyhedra with Overlays. 1 Introduction. George W. Hart

,. ~ ~ Blending Polyhedra with Overlays. 1 Introduction. George W. Hart BRIDGES Mathematical Connections in Art, Music~ and Science. Blending Polyhedra with Overlays Douglas Zongker University of Washington Box 352350 Seattle, WA 98195 dougz@cs.washington.edu George W. Hart

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

Modular Toroids Constructed from Nonahedra

Modular Toroids Constructed from Nonahedra Modular Toroids Constructed from Nonahedra Carlo H. Séquin Yifat Amir Ruta Jawale Hong Jeon Alex Romano Rohan Taori Electrical Engineering and Computer Sciences University of California at Berkeley Technical

More information

CAT(0)-spaces. Münster, June 22, 2004

CAT(0)-spaces. Münster, June 22, 2004 CAT(0)-spaces Münster, June 22, 2004 CAT(0)-space is a term invented by Gromov. Also, called Hadamard space. Roughly, a space which is nonpositively curved and simply connected. C = Comparison or Cartan

More information

The important function we will work with is the omega map ω, which we now describe.

The important function we will work with is the omega map ω, which we now describe. 20 MARGARET A. READDY 3. Lecture III: Hyperplane arrangements & zonotopes; Inequalities: a first look 3.1. Zonotopes. Recall that a zonotope Z can be described as the Minkowski sum of line segments: Z

More information

Linear Complexity Hexahedral Mesh Generation

Linear Complexity Hexahedral Mesh Generation Linear Complexity Hexahedral Mesh Generation David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717 http://www.ics.uci.edu/ eppstein/ Tech. Report 95-51

More information

Form Evolution: From Nature to Polyhedra to Sculpture

Form Evolution: From Nature to Polyhedra to Sculpture Journal for Geometry and Graphics Volume 2 (1998), No. 2, 161 168 Form Evolution: From Nature to Polyhedra to Sculpture Robert A. Wiggs University of Southwestern Louisiana private: 128 Hugh Wallis Road,

More information

Planar Graphs with Many Perfect Matchings and Forests

Planar Graphs with Many Perfect Matchings and Forests Planar Graphs with Many Perfect Matchings and Forests Michael Biro Abstract We determine the number of perfect matchings and forests in a family T r,3 of triangulated prism graphs. These results show that

More information

The Touring Polygons Problem (TPP)

The Touring Polygons Problem (TPP) The Touring Polygons Problem (TPP) [Dror-Efrat-Lubiw-M]: Given a sequence of k polygons in the plane, a start point s, and a target point, t, we seek a shortest path that starts at s, visits in order each

More information

Geometry Vocabulary. Name Class

Geometry Vocabulary. Name Class Geometry Vocabulary Name Class Definition/Description Symbol/Sketch 1 point An exact location in space. In two dimensions, an ordered pair specifies a point in a coordinate plane: (x,y) 2 line 3a line

More information

PROBLEM SET 1 SOLUTIONS MAS341: GRAPH THEORY 1. QUESTION 1

PROBLEM SET 1 SOLUTIONS MAS341: GRAPH THEORY 1. QUESTION 1 PROBLEM SET 1 SOLUTIONS MAS341: GRAPH THEORY 1. QUESTION 1 Find a Hamiltonian cycle in the following graph: Proof. Can be done by trial an error. Here we find the path using some helpful observations.

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

For many years, geometry in the elementary schools was confined to

For many years, geometry in the elementary schools was confined to SHOW 118 PROGRAM SYNOPSIS Segment 1 (1:39) MATHMAN: RECTANGLES Mathman is told to eat only the rectangles that appear on his video game board. He notes that rectangles must have four right angles (and

More information

Some Open Problems in Graph Theory and Computational Geometry

Some Open Problems in Graph Theory and Computational Geometry Some Open Problems in Graph Theory and Computational Geometry David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science ICS 269, January 25, 2002 Two Models of Algorithms Research

More information

3 Pyramids. possible student responses shown here. 'Alternative responses are shown in quotation marks.

3 Pyramids. possible student responses shown here. 'Alternative responses are shown in quotation marks. 3 Pyramids Themes Terminology, etymology (word origin), pyramids and their 2-D base shapes. Vocabulary Base, pyramid, regular, convex, concave, vertex, vertices, side, edge. Synopsis Build pyramids with

More information

MATERIAL FOR A MASTERCLASS ON HYPERBOLIC GEOMETRY. Timeline. 10 minutes Exercise session: Introducing curved spaces

MATERIAL FOR A MASTERCLASS ON HYPERBOLIC GEOMETRY. Timeline. 10 minutes Exercise session: Introducing curved spaces MATERIAL FOR A MASTERCLASS ON HYPERBOLIC GEOMETRY Timeline 10 minutes Introduction and History 10 minutes Exercise session: Introducing curved spaces 5 minutes Talk: spherical lines and polygons 15 minutes

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

WONDERLAB: THE EQUINOR GALLERY. The science and maths behind the exhibits 30 MIN INFORMATION. Topic MATHS. Age

WONDERLAB: THE EQUINOR GALLERY. The science and maths behind the exhibits 30 MIN INFORMATION. Topic MATHS. Age WONDERLAB: THE EQUINOR GALLERY The science and maths s INFORMATION Age 7 11 11 14 Topic MATHS 30 MIN Location LEVEL 3, SCIENCE MUSEUM, LONDON What s the maths? What more will you wonder? s Wonderlab: The

More information

On the Size of Higher-Dimensional Triangulations

On the Size of Higher-Dimensional Triangulations Combinatorial and Computational Geometry MSRI Publications Volume 52, 2005 On the Size of Higher-Dimensional Triangulations PETER BRASS Abstract. I show that there are sets of n points in three dimensions,

More information

Two Characterizations of Hypercubes

Two Characterizations of Hypercubes Two Characterizations of Hypercubes Juhani Nieminen, Matti Peltola and Pasi Ruotsalainen Department of Mathematics, University of Oulu University of Oulu, Faculty of Technology, Mathematics Division, P.O.

More information