Journal of Computational Physics 368 (2018) 254–276
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
On the Archimedean Or Semiregular Polyhedra
ON THE ARCHIMEDEAN OR SEMIREGULAR POLYHEDRA Mark B. Villarino Depto. de Matem´atica, Universidad de Costa Rica, 2060 San Jos´e, Costa Rica May 11, 2005 Abstract We prove that there are thirteen Archimedean/semiregular polyhedra by using Euler’s polyhedral formula. Contents 1 Introduction 2 1.1 RegularPolyhedra .............................. 2 1.2 Archimedean/semiregular polyhedra . ..... 2 2 Proof techniques 3 2.1 Euclid’s proof for regular polyhedra . ..... 3 2.2 Euler’s polyhedral formula for regular polyhedra . ......... 4 2.3 ProofsofArchimedes’theorem. .. 4 3 Three lemmas 5 3.1 Lemma1.................................... 5 3.2 Lemma2.................................... 6 3.3 Lemma3.................................... 7 4 Topological Proof of Archimedes’ theorem 8 arXiv:math/0505488v1 [math.GT] 24 May 2005 4.1 Case1: fivefacesmeetatavertex: r=5. .. 8 4.1.1 At least one face is a triangle: p1 =3................ 8 4.1.2 All faces have at least four sides: p1 > 4 .............. 9 4.2 Case2: fourfacesmeetatavertex: r=4 . .. 10 4.2.1 At least one face is a triangle: p1 =3................ 10 4.2.2 All faces have at least four sides: p1 > 4 .............. 11 4.3 Case3: threefacesmeetatavertes: r=3 . ... 11 4.3.1 At least one face is a triangle: p1 =3................ 11 4.3.2 All faces have at least four sides and one exactly four sides: p1 =4 6 p2 6 p3. 12 4.3.3 All faces have at least five sides and one exactly five sides: p1 =5 6 p2 6 p3 13 1 5 Summary of our results 13 6 Final remarks 14 1 Introduction 1.1 Regular Polyhedra A polyhedron may be intuitively conceived as a “solid figure” bounded by plane faces and straight line edges so arranged that every edge joins exactly two (no more, no less) vertices and is a common side of two faces. -
The Geometry of the Simplex Method and Applications to the Assignment Problems
The Geometry of the Simplex Method and Applications to the Assignment Problems By Rex Cheung SENIOR THESIS BACHELOR OF SCIENCE in MATHEMATICS in the COLLEGE OF LETTERS AND SCIENCE of the UNIVERSITY OF CALIFORNIA, DAVIS Approved: Jes´usA. De Loera March 13, 2011 i ii ABSTRACT. In this senior thesis, we study different applications of linear programming. We first look at different concepts in linear programming. Then we give a study on some properties of polytopes. Afterwards we investigate in the Hirsch Conjecture and explore the properties of Santos' counterexample as well as a perturbation of this prismatoid. We also give a short survey on some attempts in finding more counterexamples using different mathematical tools. Lastly we present an application of linear programming: the assignment problem. We attempt to solve this assignment problem using the Hungarian Algorithm and the Gale-Shapley Algorithm. Along with the algorithms we also give some properties of the Birkhoff Polytope. The results in this thesis are obtained collaboratively with Jonathan Gonzalez, Karla Lanzas, Irene Ramirez, Jing Lin, and Nancy Tafolla. Contents Chapter 1. Introduction to Linear Programming 1 1.1. Definitions and Motivations 1 1.2. Methods for Solving Linear Programs 2 1.3. Diameter and Pivot Bound 8 1.4. Polytopes 9 Chapter 2. Hirsch Conjecture and Santos' Prismatoid 11 2.1. Introduction 11 2.2. Prismatoid and Santos' Counterexample 13 2.3. Properties of Santos' Prismatoid 15 2.4. A Perturbed Version of Santos' Prismatoid 18 2.5. A Search for Counterexamples 22 Chapter 3. An Application of Linear Programming: The Assignment Problem 25 3.1. -
Bridges Conference Proceedings Guidelines Word
Bridges 2019 Conference Proceedings Helixation Rinus Roelofs Lansinkweg 28, Hengelo, the Netherlands; [email protected] Abstract In the list of names of the regular and semi-regular polyhedra we find many names that refer to a process. Examples are ‘truncated’ cube and ‘stellated’ dodecahedron. And Luca Pacioli named some of his polyhedral objects ‘elevations’. This kind of name-giving makes it easier to understand these polyhedra. We can imagine the model as a result of a transformation. And nowadays we are able to visualize this process by using the technique of animation. Here I will to introduce ‘helixation’ as a process to get a better understanding of the Poinsot polyhedra. In this paper I will limit myself to uniform polyhedra. Introduction Most of the Archimedean solids can be derived by cutting away parts of a Platonic solid. This operation , with which we can generate most of the semi-regular solids, is called truncation. Figure 1: Truncation of the cube. We can truncate the vertices of a polyhedron until the original faces of the polyhedron become regular again. In Figure 1 this process is shown starting with a cube. In the third object in the row, the vertices are truncated in such a way that the square faces of the cube are transformed to regular octagons. The resulting object is the Archimedean solid, the truncated cube. We can continue the process until we reach the fifth object in the row, which again is an Archimedean solid, the cuboctahedron. The whole process or can be represented as an animation. Also elevation and stellation can be described as processes. -
Section 1000.00 Omnitopology
Table of Contents ● 1000.00 OMNITOPOLOGY ● 1001.00 Inherent Rationality of Omnidirectional Epistemology ■ 1001.10 Spherical Reference ❍ 1001.20 Field of Geodesic Event Relationships ❍ 1002.10 Omnidirectional Nucleus ❍ 1003.10 Isotropic-Vector-Matrix Reference ❍ 1004.10 An Omnisynergetic Coordinate System ❍ 1005.10 Inventory of Omnidirectional Intersystem Precessional Effects ❍ 1005.15 Volume and Area Progressions ■ 1005.20 Biospherical Patterns ■ 1005.30 Poisson Effect ■ 1005.40 Genetic Intercomplexity ■ 1005.50 Truth and Love: Linear and Embracing ■ 1005.60 Generalization and Polarization ■ 1005.611 Metabolic Generalizations ❍ 1006.10 Omnitopology Defined ■ 1006.20 Omnitopological Domains ■ 1006.30 Vector Equilibrium Involvement Domain ■ 1006.40 Cosmic System Eight-dimensionality ❍ 1007.10 Omnitopology Compared with Euler's Topology ❍ 1007.20 Invalidity of Plane Geometry ❍ 1008.10 Geodesic Spheres in Closest Packing ❍ 1009.00 Critical Proximity ■ 1009.10 Interference: You Really Can t Get There from Here ■ 1009.20 Magnitude of Independent Orbiting ■ 1009.30 Symmetrical Conformation of Flying-Star Teams ■ 1009.40 Models and Divinity ■ 1009.50 Acceleration ■ 1009.60 Hammer-Thrower ■ 1009.69 Comet ■ 1009.70 Orbital Escape from Earth s Critical-Proximity Programmability ■ 1009.80 Pea-Shooter Sling-Thrower. and Gyroscope: Gravity and Mass- Attraction ● 1010.00 Prime Volumes ■ 1010.10 Domain and Quantum ■ 1010.20 Nonnuclear Prime Structural Systems ❍ 1011.00 Omnitopology of Prime Volumes ■ 1011.10 Prime Enclosure ■ 1011.20 Hierarchy of Nuclear -
Dodecahedron
Dodecahedron Figure 1 Regular Dodecahedron vertex labeling using “120 Polyhedron” vertex labels. COPYRIGHT 2007, Robert W. Gray Page 1 of 9 Encyclopedia Polyhedra: Last Revision: July 8, 2007 DODECAHEDRON Topology: Vertices = 20 Edges = 30 Faces = 12 pentagons Lengths: 15+ ϕ = 1.618 033 989 2 EL ≡ Edge length of regular Dodecahedron. 43ϕ + FA = EL 1.538 841 769 EL ≡ Face altitude. 2 ϕ DFV = EL ≅ 0.850 650 808 EL 5 15+ 20 ϕ DFE = EL ≅ 0.688 190 960 EL 10 3 DVV = ϕ EL ≅ 1.401 258 538 EL 2 1 DVE = ϕ 2 EL ≅ 1.309 016 994 EL 2 711+ ϕ DVF = EL ≅ 1.113 516 364 EL 20 COPYRIGHT 2007, Robert W. Gray Page 2 of 9 Encyclopedia Polyhedra: Last Revision: July 8, 2007 DODECAHEDRON Areas: 15+ 20 ϕ 2 2 Area of one pentagonal face = EL ≅ 1.720 477 401 EL 4 2 2 Total face area = 31520+ ϕ EL ≅ 20.645 728 807 EL Volume: 47+ ϕ 3 3 Cubic measure volume equation = EL ≅ 7.663 118 961 EL 2 38( + 14ϕ) 3 3 Synergetics' Tetra-volume equation = EL ≅ 65.023 720 585 EL 2 Angles: Face Angles: All face angles are 108°. Sum of face angles = 6480° Central Angles: ⎛⎞35− All central angles are = 2arcsin ⎜⎟ ≅ 41.810 314 896° ⎜⎟6 ⎝⎠ Dihedral Angles: ⎛⎞2 ϕ 2 All dihedral angles are = 2arcsin ⎜⎟ ≅ 116.565 051 177° ⎝⎠43ϕ + COPYRIGHT 2007, Robert W. Gray Page 3 of 9 Encyclopedia Polyhedra: Last Revision: July 8, 2007 DODECAHEDRON Additional Angle Information: Note that Central Angle(Dodecahedron) + Dihedral Angle(Icosahedron) = 180° Central Angle(Icosahedron) + Dihedral Angle(Dodecahedron) = 180° which is the case for dual polyhedra. -
Are Your Polyhedra the Same As My Polyhedra?
Are Your Polyhedra the Same as My Polyhedra? Branko Gr¨unbaum 1 Introduction “Polyhedron” means different things to different people. There is very little in common between the meaning of the word in topology and in geometry. But even if we confine attention to geometry of the 3-dimensional Euclidean space – as we shall do from now on – “polyhedron” can mean either a solid (as in “Platonic solids”, convex polyhedron, and other contexts), or a surface (such as the polyhedral models constructed from cardboard using “nets”, which were introduced by Albrecht D¨urer [17] in 1525, or, in a more mod- ern version, by Aleksandrov [1]), or the 1-dimensional complex consisting of points (“vertices”) and line-segments (“edges”) organized in a suitable way into polygons (“faces”) subject to certain restrictions (“skeletal polyhedra”, diagrams of which have been presented first by Luca Pacioli [44] in 1498 and attributed to Leonardo da Vinci). The last alternative is the least usual one – but it is close to what seems to be the most useful approach to the theory of general polyhedra. Indeed, it does not restrict faces to be planar, and it makes possible to retrieve the other characterizations in circumstances in which they reasonably apply: If the faces of a “surface” polyhedron are sim- ple polygons, in most cases the polyhedron is unambiguously determined by the boundary circuits of the faces. And if the polyhedron itself is without selfintersections, then the “solid” can be found from the faces. These reasons, as well as some others, seem to warrant the choice of our approach. -
Plane and Solid Geometry
DUKE UNIVERSITY LIBRARY vv i\\S FOUR DISCOVERERS AND FOUNDERS OF GEOMETRY (See pages 4-90-498) PLANE AND SOLID GEOMETRY BY FLETCHER DURELL, Ph.D. HEAD OP THE MATHEMATICAL DEPARTMENT, THE LAWRENCEVILLE SCHOOL NEW YORK CHARLES E. MERRILL CO, wm r DURELL’S MATHEMATICAL SERIES ARITHMETIC Two Book Series Elementary Arithmetic Teachers’ Edition Advanced Arithmetic Three Book Series Book One Book Two Book Three ALGEBRA Two Book Course Book One Book Two Book Two with Advanced Work Introductory Algebra School Algebra GEOMETRY Plane Geometry Solid Geometry Plane and Solid Geometry, TRIGONOMETRY Plane Trigonometry and Tables Plane and Spherical Trigonometry and Tables. • Plane and Spherical Trigonometry with Surveying and Tables Logarithmic and Trigonometric Tables Copyright. 1904, by Charles E. Merrill Cft It o o UV 5 / 3 .^ PREFACE One of the main purposes in writing this book has been to try to present the subject of Geometry so that the pupil shall understand it not merely as a series of correct deductions, but shall realize the value and meaning of its principles as well. This aspect of the subject has been directly presented in some places, and it is hoped that it per- vades and shapes the presentation in all places. Again, teachers of Geometry generally agree that the most difficult part of their work lies in developing in pupils the power to work original exercises. The second main purpose of the book is to aid in the solution of this difficulty by arranging original exercises in groups, each of the earlier groups to be worked by a distinct method. -
Covering Properties of Lattice Polytopes
Covering properties of lattice polytopes Dissertation zur Erlangung des Grades eines Doktors der Naturwissenschaften (Dr. rer. nat.) eingereicht am Fachbereich Mathematik und Informatik der Freien Universit¨atBerlin von Giulia Codenotti Berlin 24. Oktober 2019 Supervisor and first reviewer: Prof. Dr. Christian Haase Institut f¨urMathematik Freie Universit¨atBerlin Co-supervisor and second reviewer: Prof. Francisco Santos Departamento de Matem´aticas,Estad´ısticay Computaci´on Universidad de Cantabria Date of defense: 17.01.2020 Institut f¨urMathematik Freie Universit¨atBerlin Summary This thesis studies problems concerning the interaction between polytopes and lattices. Motivation for the study of lattice polytopes comes from two very different fields: dis- crete optimization, in particular integer linear programming, and algebraic geometry, specifically the study of toric varieties. The first topic we study is the existence of unimodular covers for certain interesting families of 3-dimensional lattice polytopes. A unimodular cover of a lattice polytope is a collection of unimodular simplices whose union equals the polytope. Admitting a unimodular cover is a weaker property than admitting a unimodular triangulation, and stronger than having the integer decomposition property (IDP). This last property is particularly interesting in the algebraic context, and there are various conjectures relating it to smoothness ([Oda97]). We show that unimodular covers exist for all 3- dimensional parallelepipeds and for all Cayley sums of polygons where one polygon is a weak Minkowski summand of the other. For both classes of polytopes only the IDP property was previously known. We then explore questions related to the so-called flatness constant, the largest width that a hollow convex body can have in a given dimension. -
Mathematical Origami: Phizz Dodecahedron
Mathematical Origami: • It follows that each interior angle of a polygon face must measure less PHiZZ Dodecahedron than 120 degrees. • The only regular polygons with interior angles measuring less than 120 degrees are the equilateral triangle, square and regular pentagon. Therefore each vertex of a Platonic solid may be composed of • 3 equilateral triangles (angle sum: 3 60 = 180 ) × ◦ ◦ • 4 equilateral triangles (angle sum: 4 60 = 240 ) × ◦ ◦ • 5 equilateral triangles (angle sum: 5 60 = 300 ) × ◦ ◦ We will describe how to make a regular dodecahedron using Tom Hull’s PHiZZ • 3 squares (angle sum: 3 90 = 270 ) modular origami units. First we need to know how many faces, edges and × ◦ ◦ vertices a dodecahedron has. Let’s begin by discussing the Platonic solids. • 3 regular pentagons (angle sum: 3 108 = 324 ) × ◦ ◦ The Platonic Solids These are the five Platonic solids. A Platonic solid is a convex polyhedron with congruent regular polygon faces and the same number of faces meeting at each vertex. There are five Platonic solids: tetrahedron, cube, octahedron, dodecahedron, and icosahedron. #Faces/ The solids are named after the ancient Greek philosopher Plato who equated Solid Face Vertex #Faces them with the four classical elements: earth with the cube, air with the octa- hedron, water with the icosahedron, and fire with the tetrahedron). The fifth tetrahedron 3 4 solid, the dodecahedron, was believed to be used to make the heavens. octahedron 4 8 Why Are There Exactly Five Platonic Solids? Let’s consider the vertex of a Platonic solid. Recall that the same number of faces meet at each vertex. icosahedron 5 20 Then the following must be true. -
A Colouring Problem for the Dodecahedral Graph
A colouring problem for the dodecahedral graph Endre Makai, Jr.,∗Tibor Tarnai† Keywords and phrases: Dodecahedral graph, graph colouring. 2010 Mathematics Subject Classification: Primary: 05C15. Sec- ondary: 51M20. We investigate an elementary colouring problem for the dodecahedral graph. We determine the number of all colourings satisfying a certain con- dition. We give a simple combinatorial proof, and also a geometrical proof. For the proofs we use the symmetry group of the regular dodecahedron, and also the compounds of five tetrahedra, inscribed in the dodecahedron. Our results put a result of W. W. Rouse Ball – H. S. M. Coxeter in the proper interpretation. CV-s. E. Makai, Jr. graduated in mathematics at L. E¨otv¨os University, Bu- dapest in 1970. He is a professor emeritus of Alfr´ed R´enyi Institute of Mathematics, Hungarian Academy of Sciences. His main interest is geom- etry. T. Tarnai graduated in civil engineering at the Technical University of Budapest in 1966, and in mathematics at L. E¨otv¨os University, Budapest in 1973. He is a professor emeritus of Budapest University of Technology and Economics. His main interests are engineering and mathematics, and in mathematics connections between engineering methods and geometry. arXiv:1812.08453v3 [math.MG] 10 Sep 2019 ∗Alfr´ed R´enyi Institute of Mathematics, Hungarian Academy of Sciences, H-1364 Bu- dapest, P.O. Box 127, Hungary; [email protected]; www.renyi.mta.hu/˜makai. †Budapest University of Technology and Economics, Department of Structural Me- chanics, H-1521 Budapest, M˝uegyetem rkp. 3, Hungary; [email protected]; www.me.bme.hu/tarnai-tibor. -
Transformations (Part 2) Composition of Isometries Solids
Study Guide 3/ Page 1 Transformations (part 2) Congruence Transformations (Isometries) 1. You should be able to list all isometries and all that is required to unambiguously determine each of them. 2. Discuss point symmetry and identity. Why do we often leave them out from the list of isometries? 3. Discuss glide reflection. Why do we want the vector to be parallel to the line of reflection? Tools of transformations 4. You should be able to solve elementary problems (see examples at https://www.geogebra.org/m/UL59oGXJ ) and provide useful instructional tips for working with typical tools such as transparency, square dot paper or technology. 5. Given a pre-image and its image, find the corresponding isometry. https://www.geogebra.org/m/jpDtBfw2 . Composition of Isometries 6. Explain why the composition of three reflections cannot yield a translation or rotation. Try to explain it without using technology, just by referring to some properties of isometries. 7. Explain why reflection has a special position among the isometries and illustrate it on a few examples. 8. Prove that the angle of rotation generated by two reflections with intersecting lines is 2x the angle between the lines. 9. Show that the vector of translation generated by two reflections with parallel lines is twice as long as the distance between the two lines. In other words, describe the translation vector that maps E onto E’. Solids Classification of solids You should be familiar with the basic terminology and names: Vertex, Edge, Face; Solid, Polyhedron, Prism (right and oblique), Antiprism, Pyramid (right and oblique), Platonic Solid, Regular Polyhedron, Archimedean Solid, Semiregular Polyhedron, Sphere, Cone, and Cylinder. -
The Width of 5-Dimensional Prismatoids, As We Do in This Paper
The width of 5-dimensional prismatoids Benjamin Matschke∗ Francisco Santos∗∗ Christophe Weibel∗∗∗ June 23, 2018 Abstract Santos’ construction of counter-examples to the Hirsch Conjecture (2012) is based on the existence of prismatoids of dimension d of width greater than d. Santos, Stephen and Thomas (2012) have shown that this cannot occur in d 4. Motivated by this we here study the width of ≤ 5-dimensional prismatoids, obtaining the following results: There are 5-prismatoids of width six with only 25 vertices, versus the • 48 vertices in Santos’ original construction. This leads to non-Hirsch polytopes of dimension 20, rather than the original dimension 43. There are 5-prismatoids with n vertices and width Ω(√n) for arbi- • trarily large n. Hence, the width of 5-prismatoids is unbounded. Mathematics Subject Classification: 52B05, 52B55, 90C05 1 Introduction The Hirsch Conjecture. In 1957, Warren Hirsch conjectured that the (com- binatorial) diameter of any d-dimensional convex polytope or polyhedron with n facets is at most n d. Here the diameter of a polytope is the diameter of its graph, that is, the maximal− number of edges that one needs to pass in order to go from one vertex to another. arXiv:1202.4701v2 [math.CO] 6 May 2013 Hirsch’s motivation was that the simplex method, devised by Dantzig ten years earlier, finds the optimal solution of a linear program by walking along the graph of the feasibility polyhedron. In particular, the maximum diame- ter among polyhedra with a given number of facets is a lower bound for the computational complexity of the simplex algorithm for any pivoting rule.