DOCSLIB.ORG

Geometry and Arithmetic of Crystallographic Sphere Packings

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Geometry and Arithmetic of Crystallographic Sphere Packings Geometry and arithmetic of crystallographic sphere packings Alex Kontorovicha,b,1 and Kei Nakamuraa aDepartment of Mathematics, Rutgers University, New Brunswick, NJ 08854; and bSchool of Mathematics, Institute for Advanced Study, Princeton, NJ 08540 Edited by Kenneth A. Ribet, University of California, Berkeley, CA, and approved November 21, 2018 (received for review December 12, 2017) We introduce the notion of a “crystallographic sphere packing,” argument leading to Theorem 3 comes from constructing circle defined to be one whose limit set is that of a geometrically packings “modeled on” combinatorial types of convex polyhedra, finite hyperbolic reflection group in one higher dimension. We as follows. exhibit an infinite family of conformally inequivalent crystallo- graphic packings with all radii being reciprocals of integers. We (~): Polyhedral Packings then prove a result in the opposite direction: the “superintegral” Let Π be the combinatorial type of a convex polyhedron. Equiv- ones exist only in finitely many “commensurability classes,” all in, alently, Π is a 3-connectedz planar graph. A version of the at most, 20 dimensions. Koebe–Andreev–Thurston Theorem§ says that there exists a 3 geometrization of Π (that is, a realization of its vertices in R with sphere packings j crystallographic j arithmetic j polyhedra j straight lines as edges and faces contained in Euclidean planes) Coxeter diagrams having a midsphere (meaning, a sphere tangent to all edges). This midsphere is then also simultaneously a midsphere for the he goal of this program is to understand the basic “nature” of dual polyhedron Πb. Fig. 2A shows the case of a cuboctahedron Tthe classical Apollonian gasket. Why does its integral struc- and its dual, the rhombic dodecahedron. ture exist? (Of course, it follows here from Descartes’ Kissing 2 Stereographically projecting to Rc, we obtain a cluster (just Circles Theorem, but is there a more fundamental, intrinsic meaning, a finite collection) C of circles, whose nerve (that is, explanation?) Are there more like it? (Around a half-dozen tangency graph) is isomorphic to Π, and a cocluster, C, with similarly integral circle and sphere packings were previously b known, each given by an ad hoc description.) If so, how many nerve Πb, which meets C orthogonally. Again, the example of the more? Can they be classified? We develop a basic unified frame- cuboctahedron is shown in Fig. 2B. Definition 4: The orbit P = P(Π) = Γ ·C of the cluster C work for addressing these questions, and find two surprising D E phenomena: under the group Γ = Cb generated by reflections through the (~) there is indeed a whole infinite zoo of integral sphere cocluster Cbis said to be modeled on the polyhedron Π. packings, and (♠) up to “commensurability,” there are only finitely many Lemma 5. An orbit modeled on a polyhedron is a crystallographic Apollonian-like objects, over all dimensions. packing. n−1 See Fig. 3 for a packing modeled on the cuboctahedron. Such Definition 1: By an S -packing (or just packing) P of packings are unique up to conformal/anticonformal maps by n Rcn := R [ f1g, we mean an infinite collection of oriented Mostow rigidity, but Mobius¨ transformations do not generally (n − 1)-spheres (or co-dim-1 planes) so that: (i) The interiors preserve arithmetic. of spheres are disjoint, and (ii) The union of the interiors of the Definition 6: We call a polyhedron Π integral if there exists spheres is dense in space. The bend of a sphere is the recipro- some packing modeled on Π, which is integral. ∗ cal of its (signed) radius. To be dense but disjoint, the spheres It is not hard to see that the cuboctahedron is indeed inte- in the packing P must have arbitrarily small radii, so arbitrarily gral, as is the tetrahedron, which corresponds to the classical large bends. If every sphere in P has integer bend, then we call the packing integral. Without more structure, one can make completely arbitrary Significance constructions of integral packings. A key property enjoyed by the classical Apollonian circle packing and connecting it to the This paper studies generalizations of the classical Apollonian theory of “thin groups” (see refs. 1–3) is that it arises as the limit circle packing, a beautiful geometric fractal that has a surpris- set of a geometrically finite reflection group in hyperbolic space ing underlying integral structure. On the one hand, infinitely of one higher dimension. many such generalized objects exist, but on the other, they Definition 2: We call a packing P crystallographic if its limit may, in principle, be completely classified, as they fall into, set is that of some geometrically finite reflection group Γ < only finitely, many “families,” all in bounded dimensions. n+1 Isom(H ). This definition is sufficiently general to encompass all previ- Author contributions: A.K. and K.N. wrote the paper.y ously proposed generalizations of Apollonian gaskets found in The authors declare no conflict of interest.y the literature, including refs. 4–10. With these two basic and This article is a PNAS Direct Submission.y general definitions in place, we may already state our first main Published under the PNAS license.y result, confirming (~). 1 To whom correspondence should be addressed. Email: [email protected] Published online December 26, 2018. Theorem 3. There exist infinitely many conformally inequivalent *In dimensions n = 2, that is, for circle packings, the bend is just the curvature. integral crystallographic packings. However, in higher dimensions n ≥ 3, the various “curvatures” of an (n − 1)-sphere are We show in Fig. 1 but one illustrative example, whose only proportional to 1=radius2, not 1=radius; so, we instead use the term “bend.” “obvious” symmetry is a vertical mirror image. It turns out (but ‡Recall that a graph is k-connected if it remains connected whenever fewer than k may be hard to tell just from the picture) that this packing does vertices are removed. indeed arise as the limit set of a Kleinian reflection group. The §See, e.g., ref. 11 for an exposition of a proof. 436–441 j PNAS j January 8, 2019 j vol. 116 j no. 2 www.pnas.org/cgi/doi/10.1073/pnas.1721104116 Downloaded by guest on September 28, 2021 9 162 169 162 169 162 169 162 169 162 169 162 169 162 169 162169 162 169 169 162 196 288 289 242 200 242289 200 288 225 289 288 200 196 242 289200 242 288 225 289 242 288 200 196 242 225 289 289 225242 196 200 288 242 289 225 288 242 200 289 242 196 200 288 289 225 288 200 289 242 200 242 289 288 196 242 288 289 200 242 225 289 121 128 98 274 100 292 128 290 121 81 128 121 98 218 128 81 98 100 178128 121 298 292 98 128 128 98 292 298 121128178 100 98 81 128 218 98 121 128 81 121 290128 292 100 274 98 128 121 98 128 81 121 98 128 260 148 212 72 164 244 226 170 72 260 146 250 148 194 212 72 72 212 194 148 250 146 260 72 170 226 244 164 72 212 148 260 170 260 260 72 164 268 292 296 296 278 278 296 296 292 268 268 292 50 244 222 49 228 254 196 50 49 248 196 244 50 50 244 196 248 49 50 196 254 228 49 222 244 50 49 50 228 292 182 172 292 182 293 168 295 294 294 295 168 293 182 292 172 182 292 294 172 295 168 106156 269 152 122 262 262 148 152 156 158 271 148130 130148 271 158 156 152 148 262 262 122 152 269 156 106 130 299 220 100 220 116 36 236 223 220 231 116 214 245 245 214 116 231 220 223 236 36 116 220 100 220 299 220 237 245214 100 231 299 199 206 196 206 199 82 259 197 173 175 259 196 259 175 173 197 259 82 196 175 174 166 159 158 166 165 251 165 165 251 165 166 158 159 166 74 235 272 32 272 150 150 32 211 151 32 32 151 211 32 150 150 272 32 272 149 32 134 124 256 140 248 248 140 256 124 248 124 140 25 104 68 68 68 68 104 25 25 179 104 240 296 296 58 296 296 58 296 296 296 86 277 192 192 277 86 298 84 52 298 184 132 132 184 298 52 84 298 132 84 52 184 124 125 256 256 139 124 124 139 256 256 125 124 127 50 253 118 118 253 50 118 281 78 253 232 232 160 110 116 76 76 232 232 76 76 116 110 160 232 232 232 110 152 257 103 282 224 18 101 250 250 18 224 282 103 257 152 224 18 152 250 100 100 101 100 100 234 234 234 234 233 232 233 234 234 234 234 232 131 286 258 93 252 252 252 232225 225 252 252 252 93 258 286 225 252 197 184 208 208 184 184 208 208 184 184 208 208 184 184 208 87 204 176 176 204 115 287 202 284 176 176 284 202 287 115 204 176 176 204 202 284 176 287 84 256 276 276 254 79 136 62 277 277 62 136 79 254 276 276 256 136 77 185 56 185 128 128 185 56 185 77 77 210 56 253 254 254 253 254 224120 224 224 120 224 149 52 91 237 214 214 237 91 52 52 34 91 70 70 70 70 70 70 70 231 212 212 156 156 212 212 156 153 205 205 205 144 144162 162 144 144 176 96 62 60 284 284 60 60 284 191 188 128 128 188 191 166262 188 128 266 26 26 294 276 137 137 276 55 53 136 136 53 55 136 55 276 280 280 165 80 280 280 248 112 112 244 244 112 112 244 159 38 109 158 158 158264 138 9 252 252 252 252 252 9 252 252 234 234 113 234 59 20 143 238 106 106 238 143 20 106 20 238 44 8 88 88 8 88 88 8 88 88 8 88 264 Definition 10: 108 108 108 64 superintegral 184 273 204 We call a packing if every bend 28 266 28 268 288 28 186 90 90 266 90 90 186 266 89 89 170217 P 268 266 266 268 268 190 299 266 299 278 77 188 188 188 284 248 184 119 248 248 119 184 248 279 119 180 180 180 244 271 283 283 271 241 208 268 268 268 268 208 241 254 90 90 254 261 110 242 110 109 109 110 242 110 261 162 246 228 236 168 168 236 228 246 236 148 224 224 148 148 224 224 148 166 24 218 217 218 218 217 218 192 280 280 206 206 280 280 238 281 238 48 283 283 48 238 281 238 72 64 64 72 296 296 72 64 64 72 31 30 150 86 201 201 86 150 256 256 29 221 256 256 256 256 221 29 256 256
Load more

Recommended publications
  • Steinitz's Theorem Project Report §1 Introduction §2 Basic Definitions
    Steinitz's Theorem Project Report Jon Hillery May 17, 2019 §1 Introduction Looking at the vertices and edges of polyhedra gives a family of graphs that we might expect has nice properties. It turns out that there is actually a very nice characterization of these graphs! We can use this characterization to find useful representations of certain graphs. §2 Basic Definitions We define a space to be convex if the line segment connecting any two points in the space remains entirely inside the space. This works for two-dimensional sets: and three-dimensional sets: Given a polyhedron, we define its 1-skeleton to be the graph formed from the vertices and edges of the polyhedron. For example, the 1-skeleton of a tetrahedron is K4: 1 Jon Hillery (May 17, 2019) Steinitz's Theorem Project Report Here are some further examples of the 1-skeleton of an icosahedron and a dodecahedron: §3 Properties of 1-Skeletons What properties do we know the 1-skeleton of a convex polyhedron must have? First, it must be planar. To see this, imagine moving your eye towards one of the faces until you are close enough that all of the other faces appear \inside" the face you are looking through, as shown here: This is always possible because the polyedron is convex, meaning intuitively it doesn't have any parts that \jut out". The graph formed from viewing in this way will have no intersections because the polyhedron is convex, so the straight-line rays our eyes see are not allowed to leave via an edge on the boundary of the polyhedron and then go back inside.
    [Show full text]
  • Geometry and Arithmetic of Crystallographic Sphere Packings
    Geometry and arithmetic of crystallographic sphere packings Alex Kontorovicha,b,1 and Kei Nakamuraa aDepartment of Mathematics, Rutgers University, New Brunswick, NJ 08854; and bSchool of Mathematics, Institute for Advanced Study, Princeton, NJ 08540 Edited by Kenneth A. Ribet, University of California, Berkeley, CA, and approved November 21, 2018 (received for review December 12, 2017) We introduce the notion of a “crystallographic sphere packing,” argument leading to Theorem 3 comes from constructing circle defined to be one whose limit set is that of a geometrically packings “modeled on” combinatorial types of convex polyhedra, finite hyperbolic reflection group in one higher dimension. We as follows. exhibit an infinite family of conformally inequivalent crystallo- graphic packings with all radii being reciprocals of integers. We (~): Polyhedral Packings then prove a result in the opposite direction: the “superintegral” Let Π be the combinatorial type of a convex polyhedron. Equiv- ones exist only in finitely many “commensurability classes,” all in, alently, Π is a 3-connectedz planar graph. A version of the at most, 20 dimensions. Koebe–Andreev–Thurston Theorem§ says that there exists a 3 geometrization of Π (that is, a realization of its vertices in R with sphere packings j crystallographic j arithmetic j polyhedra j straight lines as edges and faces contained in Euclidean planes) Coxeter diagrams having a midsphere (meaning, a sphere tangent to all edges). This midsphere is then also simultaneously a midsphere for the he goal of this program is to understand the basic “nature” of dual polyhedron Πb. Fig. 2A shows the case of a cuboctahedron Tthe classical Apollonian gasket.
    [Show full text]
  • DIMACS REU 2018 Project: Sphere Packings and Number Theory
    DIMACS REU 2018 Project: Sphere Packings and Number Theory Alisa Cui, Devora Chait, Zachary Stier Mentor: Prof. Alex Kontorovich July 13, 2018 Apollonian Circle Packing This is an Apollonian circle packing: I Draw two more circles, each of which is tangent to the original three Apollonian Circle Packing Here's how we construct it: I Start with three mutually tangent circles I Draw two more circles, each of which is tangent to the original three Apollonian Circle Packing Here's how we construct it: I Start with three mutually tangent circles Apollonian Circle Packing Here's how we construct it: I Start with three mutually tangent circles I Draw two more circles, each of which is tangent to the original three Apollonian Circle Packing I Start with three mutually tangent circles I Draw two more circles, each of which is tangent to the original three Apollonian Circle Packing I Start with three mutually tangent circles I Draw two more circles, each of which is tangent to the original three I Continue drawing tangent circles, densely filling space These two images actually represent the same circle packing! We can go from one realization to the other using circle inversions. Apollonian Circle Packing Apollonian Circle Packing These two images actually represent the same circle packing! We can go from one realization to the other using circle inversions. Circle Inversions Circle inversion sends points at a distance of rd from the center of the mirror circle to a distance of r=d from the center of the mirror circle. Circle Inversions Circle inversion sends points at a distance of rd from the center of the mirror circle to a distance of r=d from the center of the mirror circle.
    [Show full text]
  • Mathematical Constants and Sequences
    Mathematical Constants and Sequences a selection compiled by Stanislav Sýkora, Extra Byte, Castano Primo, Italy. Stan's Library, ISSN 2421-1230, Vol.II. First release March 31, 2008. Permalink via DOI: 10.3247/SL2Math08.001 This page is dedicated to my late math teacher Jaroslav Bayer who, back in 1955-8, kindled my passion for Mathematics. Math BOOKS | SI Units | SI Dimensions PHYSICS Constants (on a separate page) Mathematics LINKS | Stan's Library | Stan's HUB This is a constant-at-a-glance list. You can also download a PDF version for off-line use. But keep coming back, the list is growing! When a value is followed by #t, it should be a proven transcendental number (but I only did my best to find out, which need not suffice). Bold dots after a value are a link to the ••• OEIS ••• database. This website does not use any cookies, nor does it collect any information about its visitors (not even anonymous statistics). However, we decline any legal liability for typos, editing errors, and for the content of linked-to external web pages. Basic math constants Binary sequences Constants of number-theory functions More constants useful in Sciences Derived from the basic ones Combinatorial numbers, including Riemann zeta ζ(s) Planck's radiation law ... from 0 and 1 Binomial coefficients Dirichlet eta η(s) Functions sinc(z) and hsinc(z) ... from i Lah numbers Dedekind eta η(τ) Functions sinc(n,x) ... from 1 and i Stirling numbers Constants related to functions in C Ideal gas statistics ... from π Enumerations on sets Exponential exp Peak functions (spectral) ..
    [Show full text]
  • Stacked 4-Polytopes with Ball Packable Graphs
    STACKED 4-POLYTOPES WITH BALL PACKABLE GRAPHS HAO CHEN Abstract. After investigating the ball-packability of some small graphs, we give a full characterisation, in terms of forbidden induced subgraphs, for the stacked 4-polytopes whose 1-skeletons can be realised by the tangency relations of a ball packing. 1. Introduction A ball packing is a collection of balls with disjoint interiors. A graph is said to be ball packable if it can be realized by the tangency relations of a ball packing. Formal definitions will be given later. The combinatorics of disk packings (2-dimensional ball packings) is well un- derstood thanks to the Koebe{Andreev{Thurston's disk packing theorem, which says that every planar graph is disk packable. However, we know little about the combinatorics of ball packings in higher dimensions. In this paper we study the relation between Apollonian ball packings and stacked polytopes: An Apollonian ball packing is formed by repeatedly filling new balls into holes in a ball packing. A stacked polytope is formed, starting from a simplex, by repeatedly gluing new simplices onto facets. Detailed and formal introductions can be found respectively in Section 2.3 and in Section 2.4. There is a 1-to-1 correspondence between 2-dimensional Apollonian ball packings and 3-dimensional stacked polytopes: a graph can be realised by the tangency relations of an Apollonian disk packing if and only if it is the 1-skeleton of a stacked 3-polytope. As we will see, this relation does not hold in higher dimensions: On one hand, the 1-skeleton of a stacked polytope may not be realizable by the tangency relations of any Apollonian ball packing.
    [Show full text]
  • Platonic and Archimedean Solids
    PLATONIC AND ARCHIMEDEAN SOLIDS Author: Daud Sutton Number of Pages: 64 pages Published Date: 25 Oct 2005 Publisher: Wooden Books Publication Country: Powys, United Kingdom Language: English ISBN: 9781904263395 DOWNLOAD: PLATONIC AND ARCHIMEDEAN SOLIDS Streaming and Download help. Report this track or account. For example, a vertex configuration of 4,6,8 means that a square , hexagon , and octagon meet at a vertex with the order taken to be clockwise around the vertex. Some definitions of semiregular polyhedron include one more figure, the elongated square gyrobicupola or "pseudo-rhombicuboctahedron". The cuboctahedron and icosidodecahedron are edge-uniform and are called quasi-regular. The duals of the Archimedean solids are called the Catalan solids. Together with the bipyramids and trapezohedra , these are the face-uniform solids with regular vertices. The snub cube and snub dodecahedron are known as chiral , as they come in a left-handed form Latin: levomorph or laevomorph and right-handed form Latin: dextromorph. When something comes in multiple forms which are each other's three-dimensional mirror image , these forms may be called enantiomorphs. This nomenclature is also used for the forms of certain chemical compounds. The different Archimedean and Platonic solids can be related to each other using a handful of general constructions. Get All Access Pass. Ancient Fonts Collection. The usual way of enumerating the semiregular polyhedra is to eliminate solutions of conditions 1 and 2 using several classes of arguments and then prove that the solutions left are, in fact, semiregular Kepler , pp. The following table gives all possible regular and semiregular polyhedra and tessellations.
    [Show full text]
  • A Comparative Study of Platonic Solid Loudspeakers As Directivity Controlled Sound Sources
    Proc. of the 2nd International Symposium on Ambisonics and Spherical Acoustics May 6-7, 2010, Paris, France A COMPARATIVE STUDY OF PLATONIC SOLID LOUDSPEAKERS AS DIRECTIVITY CONTROLLED SOUND SOURCES Alexander Mattioli Pasqual Philippe Herzog Jose´ Roberto de Franc¸a Arruda Faculty of Mechanical Engineering Laboratory of Mechanics and Acoustics State University of Campinas National Center for Scientific Research Rua Mendeleiev 200 31 chemin Joseph-Aiguier 13083-970, Campinas – SP, Brazil 13402 Marseille cedex 20 France [pasqual,arruda]@fem.unicamp.br [email protected] ABSTRACT ARMs are real orthogonal functions (or vectors, if the vibrating body possesses a finite number of degrees of freedom) describ- Compact spherical loudspeaker arrays in the shape of Platonic ing velocity patterns over the surface of a vibrating body. As far solids have been used as directivity controlled sound sources. as compact loudspeaker arrays are concerned, one of the main Such devices are commonly used to synthesize spherical har- advantages of the ARMs over the SHs is that they span a fi- monic (SH) radiation patterns, which might be later combined nite dimension subspace (the subspace dimension is the number to produce different directivities. The SH synthesis presents of drivers in the array) on which any radiation pattern the loud- two main difficulties whose extent depends on the Platonic solid speaker array is able to produce can be projected with no approx- used: large synthesis error at high frequencies due to spatial imation error, whereas SHs span an infinite dimension subspace aliasing and huge membrane velocities at low frequencies due so that truncation error generally arises.
    [Show full text]
  • Arxiv:1712.00147V1 [Math.MG] 1 Dec 2017 the Bend of a Sphere Is the Reciprocal of Its (Signed) Radius
    GEOMETRY AND ARITHMETIC OF CRYSTALLOGRAPHIC SPHERE PACKINGS ALEX KONTOROVICH AND KEI NAKAMURA Abstract. We introduce the notion of a \crystallographic sphere packing," defined to be one whose limit set is that of a geometrically finite hyperbolic reflection group in one higher dimension. We exhibit for the first time an infinite family of conformally-inequivalent such with all radii being reciprocals of integers. We then prove a result in the opposite direction: the \superintegral" ones exist only in finitely many \commensurability classes," all in dimensions below 30. The goal of this program, the details of which will appear elsewhere, is to under- stand the basic \nature" of the classical Apollonian gasket. Why does its integral structure exist? (Of course it follows here from Descartes' Kissing Circles Theorem, but is there a more fundamental, intrinsic explanation?) Are there more like it? (Around a half-dozen similarly integral circle and sphere packings were previously known, each given by an ad hoc description.) If so, how many more? Can they be classified? We develop a basic unified framework for addressing these questions, and find two surprising (and opposing) phenomena: (I) there is indeed a whole infinite zoo of integral sphere packings, and (II) up to \commensurability," there are only finitely-many Apollonian-like objects, over all dimensions! Definition 1. By an Sn−1-packing (or just packing) P of Rcn := Rn [ f1g, we mean an infinite collection of oriented (n − 1)-spheres (or co-dim-1 planes) so that: • the interiors of spheres are disjoint, and • the spheres densely fill up space; that is, we require that any ball in Rcn intersects the interior of some sphere in P.
    [Show full text]
  • Apollonian Ball Packings and Stacked Polytopes
    APOLLONIAN BALL PACKINGS AND STACKED POLYTOPES HAO CHEN Abstract. We investigate in this paper the relation between Apollonian d-ball packings and stacked (d + 1)-polytopes for dimension d ≥ 3. For d = 3, the relation is fully described: we prove that the 1-skeleton of a stacked 4-polytope is the tangency graph of an Apollonian 3-ball packing if and only if no six 4-cliques share a 3-clique. For higher dimension, we have some partial results. 1. Introduction A ball packing is a collection of balls with disjoint interiors. A graph is said to be ball packable if it can be realized by the tangency relations of a ball packing. The combinatorics of disk packings (2-dimensional ball packings) is well understood thanks to the Koebe{Andreev{Thurston's disk packing theorem, which asserts that every planar graph is disk packable. However, few is known about the combinatorics of ball packings in higher dimensions. In this paper we study the relation between Apollonian ball packings and stacked polytopes. An Apollonian ball packing is constructed from a Descartes configuration by repeatedly filling new balls into \holes". A stacked polytope is constructed from a simplex by repeatedly gluing new simplices onto facets. See Section 2.3 and 2.4 respectively for formal descriptions. There is a 1-to-1 correspondence between 2-dimensional Apollonian ball packings and 3-dimensional stacked polytopes. Namely, a graph can be realised by the tangency relations of an Apollonian disk packing if and only if it is the 1-skeleton of a stacked 3-polytope.
    [Show full text]
  • Graph Colorings, Flows and Perfect Matchings Louis Esperet
    Graph colorings, flows and perfect matchings Louis Esperet To cite this version: Louis Esperet. Graph colorings, flows and perfect matchings. Combinatorics [math.CO]. Université Grenoble Alpes, 2017. tel-01850463 HAL Id: tel-01850463 https://tel.archives-ouvertes.fr/tel-01850463 Submitted on 27 Jul 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. HABILITATION A` DIRIGER DES RECHERCHES Specialit´ e´ : Informatique et Mathematiques´ Appliquees´ Present´ ee´ par Louis Esperet prepar´ ee´ au sein du Laboratoire G-SCOP (UMR5272) Graph colorings, flows and perfect matchings Soutenue le 19 Octobre 2017, devant le jury compose´ de : Victor Chepoi Professeur, Aix-Marseille Universite,´ Examinateur Toma´sˇ Kaiser Professeur, University of West Bohemia, Rapporteur Myriam Preissmann Directrice de recherche CNRS, Grenoble, Examinatrice Bruce Reed Directeur de recherche CNRS, Sophia-Antipolis, Rapporteur Gautier Stauffer Professeur, Grenoble-INP, Examinateur Stephan´ Thomasse´ Professeur, ENS de Lyon, Examinateur Cun-Quan Zhang Professeur, West Virginia University,
    [Show full text]
  • Apollonian Ball Packings and Stacked Polytopes
    Discrete Comput Geom DOI 10.1007/s00454-016-9777-3 Apollonian Ball Packings and Stacked Polytopes Hao Chen1 Received: 28 December 2013 / Revised: 4 March 2016 / Accepted: 9 March 2016 © The Author(s) 2016. This article is published with open access at Springerlink.com Abstract We investigate in this paper the relation between Apollonian d-ball packings and stacked (d + 1)-polytopes for dimension d ≥ 3. For d = 3, the relation is fully described: we prove that the 1-skeleton of a stacked 4-polytope is the tangency graph of an Apollonian 3-ball packing if and only if there is no six 4-cliques sharing a 3-clique. For higher dimension, we have some partial results. Keywords Apollonian ball packing · Stacked polytope · k-Tree · Forbidden subgraph Mathematics Subject Classification 52C17 · 52B11 · 20F55 1 Introduction A ball packing is a collection of balls with disjoint interiors. A graph is said to be ball packable if it can be realized by the tangency relations of a ball packing. The combi- natorics of disk packings (2-dimensional ball packings) is well understood thanks to the Koebe–Andreev–Thurston’s disk packing theorem, which asserts that every pla- Editor in Charge: János Pach The work was done when the author was a PhD candidate at Institut für Mathematik of Freie Universität Berlin. An alternative version of the manuscript appeared in the PhD thesis of the author. Hao Chen [email protected] 1 Departement of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands 123 Discrete Comput Geom nar graph is disk packable.
    [Show full text]
  • Ball Packings and Lorentzian Discrete Geometry by 陈 浩 CHEN, Hao
    Ball Packings and Lorentzian Discrete Geometry by H i CHEN, Hao A thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Mathematics in the Institut f¨urMathematik Fachbereich Mathematik und Informatik Freie Universit¨atBerlin Berlin July 28, 2014 Supervisor and first reviewer: Prof. G¨unter M. Ziegler Second reviewer: Prof. Christophe Hohlweg Date of defense: June 11, 2014 Institut f¨urMathematik Freie Universit¨atBerlin To my wife. Summary While the tangency graphs of disk packings are completely characterised by Koebe{ Andreev{Thurston's disk packing theorem, not so much is known about the combina- torics of ball packings in higher dimensions. This thesis tries to make a contribution by investigating some higher dimensional ball packings. The key idea throughout this thesis is a correspondence between balls in Euclidean space and space-like directions in Lorentz space. This allows us to interpret a ball packing as a set of points in the projective Lorentz space. Our investigation starts with Descartes' configuration, the simplest ball packing studied in this thesis. It serves as the basic element for further constructions. Then we explicitly construct some small packings whose tangency graph can be expressed as graph joins, and identify some graph joins that are not the tangency graph of any ball packing. With the help of these examples, we characterise the tangency graphs of Apollonian ball packings in dimension 3 in terms of the 1-skeletons of stacked polytopes. Partial results are obtained for higher dimensions. Boyd{Maxwell packings form a large class of ball packings that are generated by inversions, generalising Apollonian packings.
    [Show full text]