DISCRETE GEOMETRY In Honor of W. Kuperberg's 60th Birthday
edited
by
Andras Bezdek Auburn University Auburn, Alabama, U.S.A. Alfred Renyi Institute of Mathematics Hungarian Academy of Sciences Budapest, Hungary
MARCEL DEKKER, INC.
NEW YORK • BASEL
Library of Congress Cataloging-in-Publication Data A catalog record for this book is available from the Library of Congress ISBN: 0-8247-0968-3 This book is printed on acid-free paper Headquarters Marcel Dekker, Inc 270 Madison Avenue, New York, NY 10016 tel 212-696-9000, fax 212-685-4540 Eastern Hemisphere Distribution Marcel Dekker AG Hutgasse 4, Postfach 812, CH-4001 Basel, Switzerland tel 41-61-260-6300, fax 41-61-260-6333 World Wide Web http //www dekker com The publisher offers discounts on this book when ordered in bulk quantities For more information, write to Special Sales/Professional Marketing at the headquarters address above
Copyright © 2003 by Marcel Dekker, Inc. All Rights Reserved. Neither this book nor any part may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, microfilming, and recording, or by any information storage and retrieval system, without permission in writing from the publisher Current printing (last digit) 10 9 8 7 6 5 4 3 2 1 PRINTED IN THE UNITED STATES OF AMERICA
MONOGRAPHS AND TEXTBOOKS IN PURE AND APPLIED MATHEMATICS 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55
K Yano, Integral Formulas in Riemannian Geometry (1970) S Kobayashi, Hyperbolic Manifolds and Holomorphic Mappings (1970) V S Vladimirov, Equations of Mathematical Physics (A Jeffrey, ed , A Littlewood, trans) (1970) B N Pshemchnyi, Necessary Conditions for an Extremum (L Neustadt, translation ed , K Makowski, trans ) (1971) L Nanci et al, Functional Analysis and Valuation Theory (1971) S S Passman, Infinite Group Rings (1971) L Domhoff, Group Representation Theory Part A Ordinary Representation Theory Part B Modular Representation Theory (1971, 1972) W Boothbyand G L Weiss, eds, Symmetric Spaces (1972) V Matsushima, Differentiable Manifolds (E T Kobayashi, trans ) (1972) L E Ward, Jr, Topology (1972) A Babakhanian, Cohomological Methods in Group Theory (1972) R Gilmer, Multiplicative Ideal Theory (1972) J Yeh, Stochastic Processes and the Wiener Integral (1973) J Barros-Neto, Introduction to the Theory of Distributions (1973) R Larsen, Functional Analysis (1973) K Yano and S Ishihara, Tangent and Cotangent Bundles (1973) C Procesi, Rings with Polynomial Identities (1973) R Hermann, Geometry, Physics, and Systems (1973) N R Wallach, Harmonic Analysis on Homogeneous Spaces (1973) J Dieudonne, Introduction to the Theory of Formal Groups (1973) / Vaisman, Cohomology and Differential Forms (1973) B -Y Chen, Geometry of Submamfolds (1973) M Marcus, Finite Dimensional Multilinear Algebra (in two parts) (1973, 1975) R Larsen, Banach Algebras (1973) R O Kujala and A L Vitter, eds, Value Distnbution Theory Part A, Part B Deficit and Bezout Estimates by Wilhelm Stoll (1973) K B Stolarsky, Algebraic Numbers and Diophantme Approximation (1974) A R Magid, The Separable Galois Theory of Commutative Rings (1974) B R McDonald, Finite Rings with Identity (1974) J Satake, Linear Algebra (S Koh et al, trans ) (1975) J S Golan, Localization of Noncommutative Rings (1975) G K/ambauer, Mathematical Analysis (1975) M K Agoston, Algebraic Topology (1976) K R Goodeart, Ring Theory (1976) L £ Mansfield, Linear Algebra with Geometric Applications (1976) N J Pullman, Matrix Theory and Its Applications (1976) B R McDonald, Geometric Algebra Over Local Rings (1976) C W Groetsch, Generalized Inverses of Linear Operators (1977) J £ Kuczkowski and J L Gersting, Abstract Algebra (1977) C O Chnstenson and W L Voxman, Aspects of Topology (1977) M Negate, Field Theory (1977) R L Long, Algebraic Number Theory (1977) W F Pfeffer, Integrals and Measures (1977) R L WheedenandA Zygmund, Measure and Integral (1977) J H Curtiss, Introduction to Functions of a Complex Variable (1978) K Hrbacek and T Jech, Introduction to Set Theory (1978) W S Massey, Homology and Cohomology Theory (1978) M Marcus, Introduction to Modern Algebra (1978) E C Young, Vector and Tensor Analysis (1978) S B Nad/er, Jr,Hyperspaces of Sets (1978) S K Segal, Topics in Group Kings (1978) ACM van ROOIJ, Non-Archimedean Functional Analysis (1978) L Command R Szczarba, Calculus in Vector Spaces (1979) C Sadosky, Interpolation of Operators and Singular Integrals (1979) J Cronm, Differential Equations (1980) C W Groetsch, Elements of Applicable Functional Analysis (1980)
56 / Vaisman, Foundations of Three-Dimensional Euclidean Geometry (1980) 57 H I Freedan, Deterministic Mathematical Models in Population Ecology (1980) 58 S B Chae, Lebesgue Integration (1980) 59 C S Reesef a/, Theory and Applications of Fourier Analysis (1981) 60 L Nachbin, Introduction to Functional Analysis (R M Aron, trans ) (1981) 61 G OrzechandM Orzech, Plane Algebraic Curves (1981) 62 R Johnsonbaugh and W E Pfaffenberger, Foundations of Mathematical Analysis (1981) 63 W L VoxmanandR H Goetschel, Advanced Calculus (1981) 64 L J Corw/nandR H Szczarba, Multivariable Calculus (1982) 65 VI Istratescu, Introduction to Linear Operator Theory (1981) 66 R D Jarvmen, Finite and Infinite Dimensional Linear Spaces (1981) 67 J K Beem and P E Ehrlich, Global Lorentzian Geometry (1981) 68 D L Armacost, The Structure of Locally Compact Abelian Groups (1981) 69 J W Brewer and M K Smith, eds, Emmy Noether A Tribute (1981) 70 K H Kim, Boolean Matrix Theory and Applications (1982) 71 T W Wiet/ng, The Mathematical Theory of Chromatic Plane Ornaments (1982) 72 D B Gauld, Differential Topology (1982) 73 R L Faber, Foundations of Euclidean and Non-Euclidean Geometry (1983) 74 M Carmeli, Statistical Theory and Random Matrices (1983) 75 J H Carruth et al, The Theory of Topological Semigroups (1983) 76 R L Faber. Differential Geometry and Relativity Theory (1983) 77 S Bamett, Polynomials and Linear Control Systems (1983) 78 G Karpilovsky, Commutative Group Algebras (1983) 79 F Van Oystaeyen and A Verschoren, Relative Invariants of Rings (1983) 80 / Vaisman, A First Course in Differential Geometry (1984) 81 G W Swan, Applications of Optimal Control Theory in Biomedicme (1984) 82 T Petne andJ D Randall, Transformation Groups on Manifolds (1984) 83 K Goebel and S Reich, Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings (1984) 84 T AlbuandC Nastasescu, Relative Fmiteness in Module Theory (1984) 85 K Hrbacek and T Jech, Introduction to Set Theory Second Edition (1984) 86 F Van Oystaeyen and A Verschoren, Relative Invariants of Rings (1984) 87 8 R McDonald, Linear Algebra Over Commutative Rings (1984) 88 M Namba, Geometry of Projective Algebraic Curves (1984) 89 G F Webb, Theory of Nonlinear Age-Dependent Population Dynamics (1985) 90 M R Bremner et al, Tables of Dominant Weight Multiplicities for Representations of Simple Lie Algebras (1985) 91 A E Fekete, Real Linear Algebra (1985) 92 S B Chae, Holomorphy and Calculus in Normed Spaces (1985) 93 A J Jem, Introduction to Integral Equations with Applications (1985) 94 G Karpilovsky, Projective Representations of Finite Groups (1985) 95 L NanciandE Beckenstein, Topological Vector Spaces (1985) 96 J Weeks, The Shape of Space (1985) 97 P R GnbikandK O Kortanek, Extremal Methods of Operations Research (1985) 98 J -A Chao and W A Woyczynski, eds, Probability Theory and Harmonic Analysis (1986) 99 G D Crown ef a/, Abstract Algebra (1986) 100 J H Carruth et a!, The Theory of Topological Semigroups, Volume 2 (1986) 101 R S DoranandV A Belfi, Characterizations of C*-Algebras (1986) 102 M W Jeter, Mathematical Programming (1986) 103 M Altman, A Unified Theory of Nonlinear Operator and Evolution Equations with Applications (1986) 104 A Verschoren, Relative Invanants of Sheaves (1987) 105 R A Usmam, Applied Linear Algebra (1987) 106 P B/ass and J Lang, Zanski Surfaces and Differential Equations in Characteristic p > 0(1987) 107 J A Reneke et al, Structured Hereditary Systems (1987) 108 H BusemannandB B Phadke, Spaces with Distinguished Geodesies (1987) 109 R Harte, Invertibihty and Singularity for Bounded Linear Operators (1988) 110 G S Ladde et al, Oscillation Theory of Differential Equations with Deviating Arguments (1987) 111 L Dudkin et a!, Iterative Aggregation Theory (1987) 112 T Okubo Differential Geometry (1987)
113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171
D L Stand and M L Stand, Real Analysis with Point-Set Topology (1987) T C Gard, Introduction to Stochastic Differential Equations (1988) S S Abhyankar Enumerative Combinatorics of Young Tableaux (1988) H Strade and R Famstemer, Modular Lie Algebras and Their Representations (1988) J A Huckaba, Commutative Rings with Zero Divisors (1988) W D Wallis, Combinatorial Designs (1988) W Wiestaw, Topological Fields (1988) G Karpilovsky, Field Theory (1988) S Caenepeel and F Van Oystaeyen, Brauer Groups and the Cohomology of Graded Rings (1989) W Kozlowski, Modular Function Spaces (1988) E Lowen-Colebunders, Function Classes of Cauchy Continuous Maps (1989) M Pavel, Fundamentals of Pattern Recognition (1989) V Lakshmikantham et al, Stability Analysis of Nonlinear Systems (1989) R Sivaramaknshnan, The Classical Theory of Arithmetic Functions (1989) N A Watson, Parabolic Equations on an Infinite Strip (1989) K J Hastings, Introduction to the Mathematics of Operations Research (1989) B Fine, Algebraic Theory of the Bianchi Groups (1989) D N Dikranjanet al, Topological Groups (1989) J C Morgan II, Point Set Theory (1990) P BilerandA Witkowski, Problems in Mathematical Analysis (1990) H J Sussmann, Nonlinear Controllability and Optimal Control (1990) J-P Florens et al, Elements of Bayesian Statistics (1990) N Shell, Topological Fields and Near Valuations (1990) B F Doolin and C F Martin, Introduction to Differential Geometry for Engineers (1990) S S Holland, Jr, Applied Analysis by the Hilbert Space Method (1990) J Oknmski, Semigroup Algebras (1990) K Zhu, Operator Theory in Function Spaces (1990) G B Price, An Introduction to Multicomplex Spaces and Functions (1991) R B Darst, Introduction to Linear Programming (1991) P L Sachdev, Nonlinear Ordinary Differential Equations and Their Applications (1991) T Husam, Orthogonal Schauder Bases (1991) J Foran, Fundamentals of Real Analysis (1991) WC Brown, Matnces and Vector Spaces (1991) M M RaoandZ D Ren, Theory of Orlicz Spaces (1991) J S Golan and T Head, Modules and the Structures of Rings (1991) C Small, Arithmetic of Finite Fields (1991) K Yang, Complex Algebraic Geometry (1991) D G Hoffmanetal, Coding Theory (1991) MO Gonzalez, Classical Complex Analysis (1992) MO Gonzalez, Complex Analysis (1992) L W Baggett, Functional Analysis (1992) M Sniedovich, Dynamic Programming (1992) R P Agarwal, Difference Equations and Inequalities (1992) C Brezinski, Biorthogonality and Its Applications to Numerical Analysis (1992) C Swartz, An Introduction to Functional Analysis (1992) S B Nadler, Jr, Continuum Theory (1992) M A AI-Gwaiz, Theory of Distnbutions (1992) E Perry, Geometry Axiomatic Developments with Problem Solving (1992) E Castillo and M R Ruiz-Cobo, Functional Equations and Modelling in Science and Engineering (1992) A J Jem, Integral and Discrete Transforms with Applications and Error Analysis (1992) A Charlier era/, Tensors and the Clifford Algebra (1992) P Bilerand T Nadzieja, Problems and Examples in Differential Equations (1992) E Hansen, Global Optimization Using Interval Analysis (1992) S Guerre-De/abnere, Classical Sequences ;n Banach Spaces (1992) Y C Wong, Introductory Theory of Topological Vector Spaces (1992) S H KulkamiandB V Limaye, Real Function Algebras (1992) W C Brown, Matnces Over Commutative Rings (1993) J LoustauandM Dillon, Linear Geometry with Computer Graphics (1993) W V Petryshyn Approximation-Solvability of Nonlinear Functional and Differential Equations (1993)
172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225
£ C Young, Vector and Tensor Analysis Second Edition (1993) T A Bick, Elementary Boundary Value Problems (1993) M Pavel Fundamentals of Pattern Recognition Second Edition (1993) S A Albeveno et a/, Noncommutative Distributions (1993) W Fu/ks, Complex Variables (1993) MM Rao, Conditional Measures and Applications (1993) A Jamcki and A Weron, Simulation and Chaotic Behavior of a-Stable Stochastic Processes (1994) P Neittaanmaki and D Tiba, Optimal Control of Nonlinear Parabolic Systems (1994) J Cronm, Differential Equations Introduction and Qualitative Theory, Second Edition (1994) S Heikkila and V Lakshmikantham, Monotone Iterative Techniques for Discontinuous Nonlinear Differential Equations (1994) X Mao, Exponential Stability of Stochastic Differential Equations (1994) B S Thomson, Symmetric Properties of Real Functions (1994) J E Rubio, Optimization and Nonstandard Analysis (1994) J L Bueso et al, Compatibility, Stability, and Sheaves (1995) AN Michel and K Wang, Qualitative Theory of Dynamical Systems (1995) MR Darnel, Theory of Lattice-Ordered Groups (1995) Z Naniewicz and P D Panagiotopoulos, Mathematical Theory of Hemivanational Inequalities and Applications (1995) L J Corwin and R H Szczarba, Calculus in Vector Spaces Second Edition (1995) L H Erbe et al, Oscillation Theory for Functional Differential Equations (1995) S Agaian et al, Binary Polynomial Transforms and Nonlinear Digital Filters (1995) Ml Gil', Norm Estimations for Operation-Valued Functions and Applications (1995) P A Gnllet, Semigroups An introduction to the Structure Theory (1995) S Kichenassamy, Nonlinear Wave Equations (1996) V F Krotov, Global Methods in Optimal Control Theory (1996) K I Beidaret al, Rings with Generalized Identities (1996) VI Amautov et al Introduction to the Theory of Topological Rings and Modules (1996) G Sierksma, Linear and Integer Programming (1996) R Lasser, Introduction to Founer Series (1996) V Sima, Algorithms for Linear-Quadratic Optimization (1996) D Redmond, Number Theory (1996) J K Beem et al, Global Lorentzian Geometry Second Edition (1996) M Fontana et al, Prufer Domains (1997) H Tanabe, Functional Analytic Methods for Partial Differential Equations (1997) C Q Zhang, Integer Flows and Cycle Covers of Graphs (1997) £ Spiegel and C J O'Donnell, Incidence Algebras (1997) B Jakubczyk and W Respondek Geometry of Feedback and Optimal Control (1998) T W Haynes et al, Fundamentals of Domination in Graphs (1998) T W Haynes et al, eds , Domination in Graphs Advanced Topics (1998) L A D'Alotto et al, A Unified Signal Algebra Approach to Two-Dimensional Parallel Digital Signal Processing (1998) F Halter-Koch, Ideal Systems (1998) N K Govil et al, eds , Approximation Theory (1998) R Cross, Multivalued Linear Operators (1998) A A Martynyuk, Stability by Liapunov's Matrix Function Method with Applications (1998) A Favini and A Yagi, Degenerate Differential Equations in Banach Spaces (1999) A /Wanes and S Nad/er Jr Hyperspaces Fundamentals and Recent Advances (1999) G Kato and D Struppa, Fundamentals of Algebraic Microlocal Analysis (1999) GX-Z Yuan, KKM Theory and Applications in Nonlinear Analysis (1999) D Motreanu and N H Pavel, Tangency, Flow Invanance for Differential Equations, and Optimization Problems (1999) K Hrbacek and T Jech, Introduction to Set Theory, Third Edition (1999) G £ Ko/osov Optimal Design of Control Systems (1999) N L Johnson, Subplane Covered Nets (2000) B Fine and G Rosenberger Algebraic Generalizations of Discrete Groups (1999) M Vath Volterra and Integral Equations of Vector Functions (2000) S S Miller and P T Mocanu Differential Subordinations (2000)
226. R. Li et a/., Generalized Difference Methods for Differential Equations: Numerical Analysis of Finite Volume Methods (2000) 227. H. Li and F. Van Oysfaeyen, A Primer of Algebraic Geometry (2000) 228. R. P. Agarwal, Difference Equations and Inequalities: Theory, Methods, and Applications, Second Edition (2000) 229. A B. Kharazishvili, Strange Functions in Real Analysis (2000) 230. J. M. Appell et a/., Partial Integral Operators and Integra-Differential Equations (2000) 231. A. I. Prilepko et a/., Methods for Solving Inverse Problems in Mathematical Physics (2000) 232. F. Van Oysfaeyen, Algebraic Geometry for Associative Algebras (2000) 233. D. L Jagerman, Difference Equations with Applications to Queues (2000) 234. D. R. Hankerson et a/., Coding Theory and Cryptography: The Essentials, Second Edition, Revised and Expanded (2000) 235. S. Dascalescu et a/., Hopf Algebras: An Introduction (2001) 236. R. Hagen et a/., C*-Algebras and Numerical Analysis (2001) 237. Y. Talpaert, Differential Geometry: With Applications to Mechanics and Physics (2001) 238. R H. Villarreal, Monomial Algebras (2001) 239. A. N. Michel et a/., Qualitative Theory of Dynamical Systems: Second Edition (2001) 240. A. A. Samarskii, The Theory of Difference Schemes (2001) 241. J. Knopfmacher and W -B. Zhang, Number Theory Arising from Finite Fields (2001) 242. S. Leader, The Kurzweil-Henstock Integral and Its Differentials (2001) 243. M. Biliotti et al, Foundations of Translation Planes (2001) 244. A. N. Kochubei, Pseudo-Differential Equations and Stochastics over Non-Archimedean Fields (2001) 245. G. Sierksma, Linear and Integer Programming: Second Edition (2002) 246. A. A. Martynyuk, Qualitative Methods in Nonlinear Dynamics: Novel Approaches to Liapunov's Matrix Functions (2002) 247. B. G. Pachpatte, Inequalities for Finite Difference Equations (2002) 248. A. N. Michel and D. Liu, Qualitative Analysis and Synthesis of Recurrent Neural Networks (2002) 249. J. R. Weeks, The Shape of Space: Second Edition (2002) 250. M. M. Rao and Z. D. Ren, Applications of Orlicz Spaces (2002) 251. V. Lakshmikantham and D. Trig/ante, Theory of Difference Equations: Numerical Methods and Applications, Second Edition (2002) 252. T. Albu, Cogalois Theory (2003) 253. A. Bezdek, Discrete Geometry (2003) Additional Volumes in Preparation
PURE AND APPLIED MATHEMATICS A Program of Monographs, Textbooks, and Lecture Notes
EXECUTIVE EDITORS Earl J. Taft Rutgers University New Brunswick, New Jersey
Zuhair Nashed University of Central Florida Orlando, Florida
EDITORIAL BOARD M. S. Baouendi University of California, San Diego Jane Cronin Rutgers University Jack K. Hale Georgia Institute of Technology
Anil Nerode Cornell University Donald Passman University of Wisconsin, Madison Fred S. Roberts Rutgers University
S. Kobayashi University of California, Berkeley
David L. Russell Virginia Polytechnic Institute and State University
Marvin Marcus University of California, Santa Barbara
Walter Schempp Universitdt Siegen
W. S. Massey Yale University
Mark Teply University of Wisconsin, Milwaukee
PREFACE
It is with great pleasure that we publish this collection of papers dedicated to Professor Wlodzimierz Kuperberg commemorating the occasion of his sixtieth birthday, January 19, 2001. All included papers were received in the second half of 2001 and contain new results. The principal theme of this volume is intuitive geometry. This book covers packing and covering theory, tilings, combinatorial geometry, convexity, and computational geometry. These topics belong to subjects on which Professor Kuperberg has made strong impacts and is continuing to make many deep contributions. A special feature of the volume is a problem collection, which is an extended version of the set of problems accumulated at the Discrete Geometry Special Session, organized by Andras Bezdek, and held at the Annual Joint Mathematics Meetings in New Orleans. I would like to express my gratitude to the authors for contributing to this anniversary volume and to the many referees who gave their valuable time to read the manuscripts. I also thank Professor Krystyna Kuperberg, who provided several of the biographical details for the introductory paper. Andras Bezdek
CONTENTS
Preface Contributors Biographical notes and work ofW. Kuperberg Andras Bezdek and Gabor Fejes Toth
1. Transversal lines to lines and intervals Jorge L. Arocha, Javier Bracho, and Luis Montejano
in ix xiii
1
2. On a shortest path problem of G. Fejes Toth Donald R. Baggett and Andras Bezdek
19
3. A short survey of (r, ^-structures Vojtech Bdlint
27
4. Lattice points on the boundary of the integer hull Imre Bdrdny and Kdroly Boroczky, Jr.
33
5. The Erdos-Szekeres problem for planar points in arbitrary position Tibor Bisztriczky and Gabor Fejes Toth
49
6. Separation in totally-sewn 4-polytopes Tibor Bisztriczky and Deborah Oliveros
59
7. On a class of equifacetted polytopes Gerd Blind and Roswitha Blind
69
8. Chessboard Ramsey numbers Jens-P. Bode, Heiko Harborth, and Stefan Krause
79
9. Maximal primitive fixing systems for convex figures Vladimir Boltyanski and Herndn Gonzdlez-Aguilar
85
CONTENTS
10. The Newton-Gregory problem revisited Kdrohj Boroczky
103
11. Arrangements of 13 points on a sphere Kdroly Boroczky and Ldszlo Szabo
111
12. On point sets without k collinear points Peter Brass
185
13. The Beckman-Quarles theorem for rational d-spaces, d even and d > 6 Robert Connelly and Joseph Zaks
193
14. Edge-antipodal convex polytopes - a proof of Talata's conjecture 201 Baldzs Csikos 15. Single-split tilings of the sphere with right triangles Robert J. MacG. Dawson
207
16. Vertex-unfoldings of simplicial manifolds Erik D. Demaine, David Eppstein, JeffErickson, George W. Hart, and Joseph O'Rourke
215
17. View-obstruction through trajectories of co-dimension three Vishwa C. Dnmir and Rajinder J. Hans-Gill
229
18. Fat 4-polytopes and fatter 3-spheres David Eppstein, Greg Kuperberg, and Giinter M. Ziegler
239
19. Arbitrarily large neighborly families of congruent symmetric convex 3-polytopes JeffErickson and Scott Kim
267
20. On the non-solidity of some packings and coverings with circles August Florian and Aladdr Heppes
279
21. On the mth Petty numbers of normed spaces Kdrohj Bezdek, Marion Naszodi and Baldzs Visy
291
22. Cubic polyhedra Chaim Goodman-Strauss and John M. Sullivan
305
CONTENTS
23. "New" uniform polyhedra Branko Griinbaum 24. On the existence of a convex polygon with a specified number of interior points Kiyoshi Hosono, Gyula Kdrolyi, and Masatsugu Urabe 25. On-line 2-adic covering of the unit square by boxes Janusz Januszewski and Marek Lassak 26. An example of a stable, even order quadrangle which is determined by its angle function Jdnos Kineses
331
351
359
367
27. Sets with a unique extension to a set of constant width Marion Naszodi and Baldzs Visy
373
28. The number of simplices embracing the origin Jdnos Pack and Mario Szegedy
381
29. Helly-type theorems on definite supporting lines for /c-disjoint families of convex bodies in the plane Sorin Revenko and Valeriu Soltan
387
30. Combinatorial aperiodicity of polyhedral prototiles Egon Schulte
397
31. Sequences of smoothed polygons G. C. Shephard
407
32. On a packing inequality by Graham, Witsenhausen and Zassenhaus Jorg M. Wills
431
33. Covering a triangle with homothetic copies Zoltdn Fu'redi
435
34. Open Problems Andrds Bezdek
447
Index
459
CONTRIBUTORS
Jorge L. Arocha Mathematical Institute, Universidad Nacional Aut6noma de Mexico , Mexico City, Mexico Donald R. Baggett Auburn University, Auburn, Alabama Vojtech Balint University of Zilina, Zilina, Slovak Republic Imre Barany Renyi Institute of Mathematics of the Hungarian Academy of Sci., Budapest, Hungary Andras Bezdek Auburn University, Auburn, Alabama and Renyi Institute of Mathematics of the Hungarian Academy of Sciences, Budapest, Hungary Karoly Bezdek Eotvos Lorand University, Budapest, Hungary Tibor Bisztriczky University of Calgary, Calgary, Canada Gerd Blind University of Stuttgart, Stuttgart, Germany Rozwitha Blind Waldburgstr. 88, D 70563 Stuttgart, Germany Jens-P. Bode Technical University, Braunschweig, Germany Vladimir Boltyanski Mathematical Research Center, Guanajuato, Mexico Karoly Boroczky Eotvos Lorand University, Budapest, Hungary Karoly Boroczky Jr. Alfred Renyi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary Javier Bracho Mathematical Institute, Universidad Nacional Aut6noma de Mexico , Mexico City, Mexico Peter Brass Free University Berlin, Berlin, Germany Robert Connelly Cornell University, Ithaca, New York
x
CONTRIBUTORS
Balazs Csikos Eotvos Lorand University, Budapest, Hungary Robert J. MacG. Dawson Saint Mary's University, Halifax, Canada Erik D. Demaine MIT Laboratory for Computing Science, Cambridge, Massachusetts Vishwa C. Dumir Centre for Advanced Study in Mathematics, Panjab University, Chandigarh, India David Eppstein University of California, Irvine, California Jeff Erickson University of Illinois at Urbana-Champaign, Urbana, Illinois Gabor Fejes Toth Alfred Renyi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary August Florian University of Salzburg, Salzburg, Austria Zoltan Fiiredi University of Illinois at Urbana-Champaign, Urbana, Illinois and Alfred Renyi Institute of Math., Hungarian Academy of Sci., Budapest, Hungary Hernan Gonzalez-Aguilar Mathematical Research Center, Guanajuato, Mexico Chaim Goodman-Strauss University of Arkansas, Fayetteville, Arkansas Branko Griinbaum University of Washington, Seattle, Washington Rajinder J. Hans-Gill Centre for Advanced Study in Mathematics, Panjab University, Chandigarh, India Heiko Harborth Technical University of Braunschweig, Braunschweig, Germany George W. Hart
SUNY Stony Brook, Stony Brook, New York
Aladar Heppes Alfred Renyi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary Kiyoshi Hosono Tokai University, Shimizu, Shizuoka, Japan Janusz Januszewski Academy of Technical and Agricultural Sciences, Bydgoszcz, Poland Gyula Karolyi Eotvos Lorand University, Budapest, Hungary Scott Kim P.O.Box 2499, El Granada, California 94018
CONTRIBUTORS
xi
Janos Kineses Szeged University, Szeged, Hungary Stefan Krause Technical University of Braunschweig, Braunschweig, Germany Greg Kuperberg Department of Mathematics, University of California, Davis, California Lassak Marek Academy of Technical and Agricultural Sciences, Bydgoszcz, Poland Luis Montejano Mathematical Institute, UNAM, Mexico City, Mexico Marton Naszodi Eotvos Lorand University, Budapest, Hungary Joseph O'Rourke Smith College, Northampton, Massachusetts Deborah Oliveros University of Calgary, Calgary, Canada Janos Pach Courant Institute, New York, New York and Renyi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary Sorin Revenko George Mason University, Fairfax, Virginia Egon Schuite Northeastern University, Boston, Massachusetts Geoffrey C. Shephard University of East Anglia, Norwich, England Valeriu Soltan George Mason University, Fairfax, Virginia John M. Sullivan University of Illinois at Urbana-Champaign, Urbana, Illinois Laszlo Szabo Computer and Automation Research Institute of the Hungarian Academy of Sciences, Budapest, Hungary Mario Szegedy Rutgers University, New Brunswick, New Jersey Masatsugu Urabe Tokai University, Shimizu, Shizuoka, Japan Balazs Visy Eotvos Lorand University, Budapest, Hungary Jorg M. Wills University of Siegen, Siegen, Germany Joseph Zaks University of Haifa, Haifa, Israel Giinter M. Ziegler Technical University of Berlin. Berlin. Germany
BIOGRAPHICAL NOTES AND WORK OF W. KUPERBERG
Wiodzimierz (Wlodek) Kuperberg was born on January 19th, 1941, in Belarus, just outside the Polish border. His mother, father and two older siblings abandoned their home in Warsaw and headed east, escaping the horrors of WWII. In 1946, the family consisting of the parents and four children returned to Poland and made its home in the city of Szczecin. In 1959, Kuperberg enrolled at Warsaw University as a student of mathematics. His original intention was to study physics, but he changed his mind after winning the Mathematics Olympiad, the most prestigious math competition in Poland for high school students. Surprised by this sudden success and fascinated by the mathematical charm of Kazimierz Kuratowski, who spoke at the olympiad ceremony, Wiodzimierz was hooked on math. The mathematics program at Warsaw University had much to offer. The students were exposed to open problems early in seminars, lectures, and informal conversations. As a freshman, Wlodek Kuperberg, together with his good friend Wlodek Holsztyriski, a sophomore, solved a problem in geometry and published the paper titled "On a property of tetrahedra" in Wiadomosci Matematyczne (Annals of the Polish Mathematical Society) 6 (1962), 13-16. Geometry was a natural choice of study. Karol Borsuk, who had a strong influence at Warsaw University, was known for several famous conjectures in this area. In those years, however, Borsuk devoted his seminars to topology: theory of retracts and shape theory. As for many of Borsuk's students, topology became Kuperberg's research area. As a graduate student, he wrote three important papers in topology: "Stable points of a polyhedron" Fund. Math. 59 (1966), 43-48; "A cyclic two-dimensional compactum which contains no irreducibly cyclic two-dimensional subcompactum" Doklady Akad. Nauk USSR 182 (1968), 35-37; and "Homotopically labile points of locally compact metric spaces" Fund. Math. 73 (1971/72), 133-136. The second paper has a nice history. Kuperberg solved a problem posed by P.S. Alexandroff and sent a hand-written paper (in Russian) to him asking whether the problem was still open. On Alexandroff's invitation, the paper appeared in the Doklady.
xiv
BIOGRAPHICAL NOTES
Kuperberg received his PhD degree at Warsaw University in 1969. He wrote his dissertation in algebraic topology under Borsuk's direction, inspired by Borsuk's geometric style in topology and by the works of H. Hopf and L. Vietoris. In addition to Borsuk, other great mathematicians such as Stan Mazur, Kazimierz Kuratowski and Waclaw Sierpiriski, who at that time were active members of the Warsaw mathematical community, had a strong influence on Kuperberg's research. During his short period of employment at Warsaw University, Kuperberg received an Excellence in Teaching and Research Award given by the university, and the Polish Mathematical Society Award for Young Mathematicians. He also wrote 3 high school textbooks, one of which was a geometry book that became widely used in Poland. The 1960's and 1970's were very eventful years. In 1964, Wlodek Kuperberg married Krystyna Trybulec, a student of mathematics, and their son Greg was born in 1967. Greg is now a math professor at the University of California at Davis. In 1969, the Kuperbergs hastily moved to Sweden. Soon after their arrival their second child, Anna, was born, who is now a photo journalist in San Francisco. Wlodek worked at Stockholm University for two and a half years, lecturing in Swedish, a language he had to learn quickly. During that time he submitted the results of his dissertation for publication, his 8th paper, "On certain homological properties of finite-dimensional compacta. Carriers, minimal carriers and bubbles" Fund. Math. 83 (1973), 7-23. Together with Krystyna, he wrote a problem set in topology. With the proximity of the Mittag-Leffler Institute and two other universities, Uppsala University and the Royal Institute of Technology in Stockholm, the mathematical environment was rich. To Wlodek, however, a big step forward was attending a topology conference in Houston, Texas, in 1971, and assuming a two-year visiting position at the University of Houston in 1972. There he worked in continuum theory, collaborating with Andrew Lelek and Howard Cook. In "Mapping arcwise connected continua onto cyclic continua", Colloq. Math. 31 (1974), 199-202, he defines an algebraic invariant useful in the study of continua. In 1974, Wlodek and his wife Krystyna, who received a PhD degree at Rice University in Houston that year, took employment at the math department at Auburn University, a land-grant institution in Auburn, Alabama. Krystyna is known for her results in topology and dynamical systems, in particular for constructing a smooth counterexample to the Seifert conjecture. Wlodek continued his research in topology, returning to the geometric topics related to his work in Poland. His paper "Unstable sets and the set of unstable points", Bull. Acad. Polon. Sci. Sr. Sci. Math. Astronom. Phys. 26 (1978), 281-285, is a good example. He was also interested in shape theory, which was developed and popularized by Borsuk. Wlodek received tenure in 1977 and was made Professor in 1982.
BIOGRAPHICAL NOTES
xv
Time spent at math conferences has always been productive and enjoyable. At the 1973 Topology Conference in Blacksburg, Virginia, Wlodek "earned" a dinner from R.H. Bing by answering a question that Bing posed during the conference. Bing included the solution in his paper titled "An unusual map of a 3-cell onto itself. The picture enclosed here shows Bing's note written on the back of the banquet dinner ticket. Another remarkable conference took place in Denton, Texas, in 1979. It was dedicated to the Scottish Book, a set of problems collected in Lwow before WWII. One of the main contributors to the book, Stan Ulam, was in Denton and Kuperberg answered the Scottish Book Problem 110 which was posed by Ulam in 1935. At the Denton conference, Kuperberg gave the first counterexample, a 1-dimensional continuum with certain properties. Subsequent counterexamples based on flows in manifolds by P. Mine, K. Kuperberg, and C.S. Reed led to important research in dynamical systems. In the early 1980's, influenced by the work of Vladimir Boltianski, Don Chakerian, and Laszlo Fejes Toth, W. Kuperberg revived his interest in geometry with the paper "Packing convex bodies in the plane with density greater than 3/4", Geom. Dedicata 13 (1982), 149-155. This result led to an invitation to a geometry conference in Siofok, Hungary, and subsequently to a very fruitful collaboration with the geometers in Hungary. Both authors of this article profited a lot of the collaboration with Wlodek. On the meeting in Siofok Wlodek showed once more, but not for the last time, that his best ideas come in the inspiring environment of a meeting: The sharp inequality claiming that the quotient of the packing density and the covering density of a plane convex body is at least 3/4 (Geometriae Dedicata 13 (1982), 149-145) was proved there. Kuperberg together with Andras Bezdek - who joined the department of mathematics at Auburn University in 1991 - studied "Maximum density space packing with congruent circular cylinders of infinite length" Mathematika (37) 1990, 74-80. Prior to this paper no convex solid S in E3 (bounded or not) with 6(S) ^ I had its packing density computed explicitly. Jointly with A. Bezdek and E. Makai, Kuperberg generalized Gauss' theorem by proving that, if a sphere packing in E3 consists of parallel strings of spheres, then the density of the packing is smaller than or equal to ?r/\/l8. In "Applied geometry and discrete mathematics", DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 4 (1991), 71-80, Kuperberg and A. Bezdek produced a number of results concerning packings of compact convex cylinders in .E3 and ellipsoids. Concerning ellipsoids, a surprise was discovered: certain congruent ellipsoids in Ed (for d > 3) can be packed in a nonlatticelike manner more densely than in a lattice-like manner. In view of Hales'
xvi
BIOGRAPHICAL NOTES
proof of Kepler's conjecture this means that in E3 packings of congruent replicas of certain ellipsoids can achieve higher density than any packing of equal balls. In the subsequent years Gabor Fejes Toth also became Wlodek's good friend and a frequent visitor in Auburn. Inspired by the result on dense ellipsoid packings, they solved the dual problem for coverings in "Thin nonlattice covering with an affine image of a strictly convex body", Mathematika 42 (1995), 239-250. Gabor is also very proud of their surveys, in particular of the paper "Packing and covering with convex sets" in Handbook of Convex Geometry, 1993, 799-860. Wlodek quite often uses his background of topology in his research in geometry. The paper on "On-line covering a cube by a sequence of cubes", Discrete Comput. Geom. 12 (1994), 83-90 is one example. The applied on-line covering method uses a cube-filling curve which is an analogue of the classical Peano curve. Another result of topological flavor is his elaborate construction in the paper "Knotted lattice-like space fillers", Discrete Comput. Geom. 13 (1995), 561-567. Given any handlebody (ball with handles attached), such that the handles may be knotted and/or linked with one another, and to which mutually disjoint tunnels have been drilled out (also potentially knotted and linked), this also forms the topological type of a tile that can be used to tile Euclidean 3-space. Quite often Wlodek's proofs "come straight from the book". As a recent example we mention his paper "Holey coronas - a solution of the GriinbaumShepard conjecture", American Mathematical Monthly 17 (2000), 551-555. In this paper he disproves the conjecture that the corona of every tile in an isohedral tiling of the plane by convex tiles is simply connected. He gives a very elegant construction to obtain a tiling in which every corona is a handlebody with an arbitrarily large number of handles. We already praised Wlodek as an excellent problem solver. We have to mention that he is an equally good problem raiser. A further special strength of his is clarity of presentation. Difficult tricks appear natural as he explains them. Take for example his joint paper with his son Greg, which presents the best known lower bound for the packing density of a convex plane body. The second named author of this article remembers refereeing this paper. He read the paper in one afternoon and sent his supporting report next day. Later the editors asked him whether he was sure that the paper is worth publishing, as the proof appeared to be trivial. Confronted with this question he sat down and tried to reconstruct the proof. Only when this attempt failed did he realize that the seeming triviality was caused by the absolutely clear presentation. The result, of course, was published in Discrete Comput. Geom. 5 (1990), 389-397 and it is widely cited. A whole section with detailed proof is devoted to it in the book entitled "Combinatorial Geometry" by Janos Pach and Pankaj Agarwal. Wlodek's talks show the
BIOGRAPHICAL NOTES
xvii
very same clarity as his papers. Because of the style of his presentations he is frequently chosen by conference organizers to deliver the closing speech. In 1996, Wlodek was awarded a five-year Alumni Professorship at Auburn University. He conducted most of his research at Auburn, occasionally spending sabbatical time at another university and frequently attending mathematical meetings. In the Summer of 1999, he received an Erdos Professorship and visited the Renyi Institute of the Hungarian Academy of Sciences in Budapest. There were many geometers around to talk about mathematics. He found himself in a congenial and familiar environment. For example, Gyula Katona, the director of the institute, was an old friend of Wlodek. The friendship originated when they were both high school students and competitors at the first International Mathematics Olympiad. The Kuperbergs have a reputation for exceptional hospitality. Those who visited their house experience a uniquely relaxed atmosphere. This is how the 35 participants of the Hungarian-US Geometry Workshop will remember the welcome party, held in the Kuperbergs' backyard, surrounded by blooming azaleas in the middle of a warm March in 2000. Immediately after proposing the volume to fellow geometers, the editor of this volume received overwhelming support, as shown by comments, some of which is reprinted here: ... I like Wlodek (and his mathematics) a lot, and would be happy to submit an article ... Wlodek is one of the youngest 60-year-olds I know ... it's a wonderful idea to publish this special volume ... it seems hard to believe that he is turning 60 this year! What is that lucky date? ...
Andrds Bezdek and Gdbor Fejes Toth
TRANSVERSAL LINES TO LINES AND INTERVALS
Jorge L. Arocha Institute de Matematicas, UNAM, Ciudad Universitaria, Circuito Exterior, Mexico D.F. 04510, Mexico. Javier Bracho Institute de Matematicas, UNAM, Ciudad Universitaria, Circuito Exterior, Mexico D.F. 04510, Mexico. Luis Montejano Institute de Matematicas, UNAM, Ciudad Universitaria, Circuito Exterior, Mexico D.F. 04510, Mexico.
ABSTRACT. We prove three theorems. A set of lines in RPn has a transversal line if and only if any six of them have a transversal line. The same holds when any five of them have a transversal line, provided that the set of lines is in general position and there are at least seven of them. A finite set of intervals in Rn has a transversal line if and only if any six of them have a transversal line compatible with a given linear order.
1. INTRODUCTION Helly's Theorem reads: let C be a family of compact convex sets in Rn; if every n + I of the sets in C have a common point, then all the family has a common point. Hadwiger showed that an extra hypothesis is needed to prove an analogous theorem for "lines that cross" convex sets in the plane. Hadwiger's Theorem, [7], can be stated as follows. Let {d,C2, ...,Cn} be a finite collection of convex sets in the plane such that for any three, d, Cj,Ck, i < j < k, there is a line crossing them precisely in that order; then there exists a line crossing all the sets in the collection. A fruitful direction in which Hadwiger's Theorem has been generalized is for hyperplane transversals. It was opened by Goodman and Pollack in [5], where they gave necessary and sufficient conditions for the existence of a hyperplane transversal to convex sets in any dimension. That work has i
2
AROCHA, BRACHO AND MONTEJANO
been pushed further by them and other authors (see [1],[2] and the references there). However, until now, and as far as we know, no Hadwiger-type theorem is known for transversal line in W1 for n > 2. Some work has been done to obtain criteria for the existence of transversal lines to special classes of convex sets. For example, there is an open conjecture due to Katchalski [9]: if every m members of a collection of pairwise disjoint unit balls in E3 have a transversal line, then the entire collection has a transversal line. For more information we refer the reader to the excellent surveys [3],[4],[6] and [10]. The goal of this paper is to study transversal lines to families of lines and intervals in nth dimensional space (n > 2); we prove a Helly-type theorem for lines and a Hadwiger-type theorem for intervals. Consider lines first. Note that when talking about two lines in W1 that intersect, there is always a limiting case of "intersection at infinity" when they become parallel (and remain coplanar). To avoid awkward argumentations, or changing the concept of transversality for coplanarity, it is better to complete W1 to the real projective n-dimensional space Pn, and simply define that two lines there are transversal if they intersect, and that a line is transversal to a set of lines if it is transversal to each of them. Then all our results will have obvious translations to the affine case. Our opening Theorem is the following. Theorem 1.1. Let C be a collection of lines in Pn. // every 6 of them have a transversal line, then C has a transversal line. It seems strange that no Hadwiger-type assumption is needed, so that by adding the extra condition of partial transversal lines consistent with a given linear or cyclic ordering, one might expect that the "magic number", 6, can be lowered to 5 in the theorem. This is not the case. There are examples of 6 lines with 5 to 5 transversal lines that meet them in a given linear or cyclic ordering, but with no complete transversal. The study of such examples leads to a refinement in a different direction. Namely, the "magic number" can be lowered to 5 if £ contains enough lines (at least 7) and they are in general position (Theorem 5.1 proved in Section 5). The proof of Theorem 1.1 is remarkably easy for the general case (lines in general position). It relies on simple properties of hyperboloids, that is, quadratic surfaces with two line rulings. Most of these facts are well known or straightforward, however, we feel the need to write them down in Section 2 for the benefit of the unaware reader and to establish notation. In Section 3 we prove the degenerate case of Theorem 1.1. In Section 4 we describe the examples of 6 lines with 5 to 5 transversals. Finally, in Section 6 we extend the results to the general case of intervals, rays or lines in W1 (n > 3), proving a Hadwiger-type theorem (Theorem 6.1).
TRANSVERSAL LINES TO LINES
3
2. HYPERBOLOIDS AND THEIR RULINGS Given a family £ of lines in Pn, we will denote by h (£) the set of all the lines transversal to £, and by |/i(£)| C Pn, called its support, the union of all those lines. We will be working with these sets constantly, so that, even if its obvious, it is important to bear in mind that
Our main tool will be the understanding of h(£) for small sets of lines, £ = {^1,^2, ••• ,^fc} with k < 6. For the remainder of this section, we will consider such a set of lines £, for growing fc, with the extra assumption that they are in general position, that is, that no two of them intersect. Until the next section we will address the degenerate case when some lines in £ may meet. Let us begin with k = 2. For any point p% 6 t^, we have a plane passing through t\ and p%, which we denote t\ Vp2- Observe that any point p € t\ Vp2 different from p2 is in a unique line through p% and transversal to l\ (namely, p V pz). As ^2 £ ii varies, the planes i\ V p% span a 3-dimensional flat. Therefore \h(£\,£z}\ = P3, and every point there not in i\ or 1% is in a unique transversal to them (in a unique line in ^(^1,^2))- One can also think of h (^i, ^2) naturally parametrized by the torus i\ x 1% (the projective line is a circle); namely, for each p\ ^ t\, pi G ti, we have the transversal Now, consider a new line. If i\ and £2 have a common transversal with 4 (M4,^2,4) ^ 0),then ^3 intersects the 3-flat |/i(^2)|. But if> moreover, ^1,^2 and £3 have more than one transversal line (tj/i(^i,^2,^s) > 1), then £3 is contained in the 3-flat |/i(^i,^2)| (because it has two points there) and h (^1,^2, ^3) grows to be a projective line: it can be naturally parametrized by the points in £3 where the transversals intersect, because of the uniqueness remark in the preceding paragraph. In this case, three lines in general position in P3, ^(^1,^2,^3) is one ruling (naturally parametrized by -intersection with- either of the three lines) of the hyperboloid \h (^1,^2,^3)!; the unique one that contains the three lines as subsets. For a beautiful exposition of this idea see the opening paragraphs of [8]. The main fact we need about hyperboloids is that |/i(^i,^2,^3)| has another ruling which we call the orthogonal ruling, and denote it h (^1,^2, ^3) , in which the ^ lie. Namely, consider any three (different) lines •£/- , ^ , £j- 6 h (i\,ti ,^3), since they have at least the transversal lines ^1,^2 and ^3, then |/i (•^jS^ is also a hyperboloid, and it happens that 1,^(^1,^2,^3)! = \h (^i",^ Then we define h(^^^}L •= h (££,£%,££) D {^1,^2,^3}- Summarizing, h (£1,^2,^3) is either empty, a unique line or the ruling (parametrized by the
4
AROCHA, BRACHO AND MONTEJANO
projective line) of a hyperboloid, which has another ruling containing the 3 lines. The main property we will repeatedly use about hyperboloids is that if a line meets one in more than 2 points, then it belongs to one of its two rulings. This follows, of course, because they are given by quadratic equations, but also from the simple facts we have gadered. For k = 4, suppose that ^(^1,^2,^3,^4) > 2, we want to prove that in this case, -£1,^2,^3 and £4 belong to a ruling of a hyperboloid. By hypothesis we can take three lines t^,^,^ 6 h(t\,t-2.,l$,t£). Sinceft-(^1/2, 4, 4) C h (t\,t
The aim of this section is to extend the preceding proposition to the case where two of the lines in our family £ meet, and thus, to complete the proof of Theorem 1.1. Proposition 3.1. Let C be a family of lines in Pn such that two of them intersect. If every 6 of them have a transversal line, then £ has a transversal line. Proof. Let ^1,^2 6 £ be transversal. Denote by p their intersection point and by P the plane they span (we shall write with its obvious generalizations, p = ^ A £2 and P — ^i v ^2)- Observe that /i(^i,#2) consists of all the lines in P and the lines through p in Pn. The proof brakes into three cases. Case 1. There exists 13 e £ such that £3 C P and p £ £3. Then h (£1,^2,^3) is exactly the set of lines in P. We may clearly disregard all the
TRANSVERSAL LINES TO LINES
5
lines in £ that are contained in P (any line in h (^1,^2,^3) is also transversal to them). The remaining lines in £ intersect P at a point (because they have transversals with ^1,^2 and ^3). The hypothesis then gives us a set of points in a plane, each three of which are colinear. Hence they are all colinear, and the given line is transversal to £. Case 2. There exists 4 G £ such that £3 DP = 0. Then h (^1,^2, 4) is the set of lines through p in the plane p V ^3 (this is, h (^1,^2,^3) = {pVps '• Ps £ ^3}). Now every line in £ must meet the plane p V ^3. Suppose there exists £4 G £ such that p ^ l± and £4 ^ p V ^3 (if not, we are clearly done), and let P4 = £4 A (p V ^3). Then, ft, (^1,^2,^3,^4) = {p Vp4J and every other line in £ meets p V j>4. (Note that the magic number 6 could be lowered to 5 in this case) . Case 3. Otherwise. In this case, for each line i{ G £, we have a well defined point pi G ii D P; namely pi := p if p G ^i and pj := ^ A P otherwise. We may assume that this points are not colinear. Then we can find p$ ^ p±, and such that p ^ p3 V p$. Then, h (t\,ti, ^3, t±) contains the line p$ V ^4 and at most one other line passing through p (either p V (^3 A ^4) if ^3 and i\ intersect, or a unique one if p G |/i(^3,£i)|). From here ($h (^1,^2,^3,^4) < 2), the 4-2 argument completes the proof. •
4. EXAMPLES We will describe examples of 6 lines without a transversal line, but having transversals 5 to 5. They will prove that Theorem 1.1 is best possible for such a simple statement. However, they will also point out that it has a refinement in an unexpected direction. All our examples consist of 6 lines t\ , t^ , • • • , t§ in P3 (though described in R3 C P3), and 6 "transversals" which we may denote ^,^2", • • • ,^j- according to the rule: Example 1. Let ^1,^2,^3 be three lines in a plane P meeting at different points pij = til\lj. Consider three non colinear points in P, called P4,ps,p6) and any point p not in the plane P. Define ii — p V Pi for i = 4,5,6. The 5 to 5 transversals are then uniquely determined by t^ = p V pjk for (z, j, k} = {1,2,3}, and if- — PJ V pk for (z, j, k} = {4,5,6}. This example may clearly grow for any k > 6 by taking new points pi G P, 7 < i < fc, and defining ^ —p\/p^ they maintain 5 to 5 transversals but not all 6 to 6. Example 2. We now avoid the concurrence of many lines in the example ahovp. by taking i^J^J.^. in general position. Let C = \h (£4. £5, 6)| n P for some transversal plane P, and as before, let pi = ti A P. Now, consider three new points in C, and let ^1,^2,^3 be the three lines through them (denote
6
AROCHA, BRACHO AND MONTEJANO
again pij — ii A t j ) . For a subset of 5 containing {1,2,3} the transversal is as before (generated by the corresponding pjand p k ) , and if it intersects in only two elements, say 1 and 2, it is the rule in /i (£4,^5,^6) passing through piz. Again, this example may grow by taking more lines in the ruling /i (^4, ^5, ^g)"1- We are now using a little more about hyperboloids: that planes that do not contain any of their rules (what we called transversal), intersect them in conic curves which parametrize via intersection both of the rulings, and that conies do not have three colinear points. Our aim now is to give examples in general position. Example 3. Consider two parallel copies of a circle in IR3. To be precise, let C° = S1 x {0} and Cl = S1 x {1} (c R3) where S1 C R2 is the unit circle. Let C = CQ U C1, and let Ra : C -> C
be the map that interchanges the two components (maintaining the first two coordinates) and then rotates both by an angle a. For i = 0, 1, let
It is not hard to see that, for 0 < a < TT, h^ and h^ are the two rulings of a hyperboloid Qa. Now, consider (3 ^ a such that 3(a + j3) — 2?r and let Qp be the analogous hyperboloid. Note that Qa n Qp = C. Our example will have three rules in h^ and three in hQ. Let us construct the first three lines together with their corresponding transversals. Consider any point p® G C°. Let p\ := Ra (p^) and define H\ := p® V p\ G h°a ; observe that p\ G C1. Now, let p% := Rp (p\), and i^ := p\ Vp§ G /ij; we have gone up through a rule in h^ and come down again through one in /iL so that p® is obtained by rotating p® an angle a + (3 in C°. Do this two more times: p\ := Ra (p§), with ^ := P°2 V p\ G h°a] p°3 := Rp (p\), with i{ := P\ Vp§ e /ij; and then pj := #a (p§), with 4 := p\ \J p\ e /i°, and finally, Pj* = .R/j (j9g) (because of our choice of angles), with 1% :~ P\ V I3?- Observe that, by definition, ^ e /i(^-,^) for {i,j, fc} = {1,2,3}; and moreover, ^- n ^ = 0 because ^-, being a rule of Qp ^ Qa, touches Qa at most (and in fact) twice, namely if- n Qa = {pj,Pfc} for (i j fc) = (1 2 3), where they are considered as cyclic orders. To define ^4,^5,^5 and their corresponding transversals, we do the same procedure starting at a new point but going up by Rp and coming down by Ra. Namely, let p^ G C° be any point different from p^p^ and ^3. Then define p] := R0 (rf), p°5 := Ra (pj), pj := Rp (pg) ? pg := H. (pj) ; pj := ^ (pg); and i, := p? V pj, ^ := p) V p°k for (i j fc) = (4 5 6). We must finally observe that for i = 1, 2,3, if- G ^(^4,^5,^6) = g (and likewise
TRANSVERSAL LINES TO LINES
7
lj- £ ^(^1,^2,^3) = hla f°r J = 4,5,6), because they belong to orthogonal rulings of the same hyperboloid. So that our 12 lines satisfy the required conditions. It is also clear that there is no transversal to the six lines, it would have to be a rule of both Qa and Qp and there are no such lines (a^/J). It is not hard to see that the 5 to 5 transversals ^,^2", • • • ,^g- in this example, do not intersect the lines t^ii,- • • , £5m a consistent linear or cyclic order (which is the natural thing to ask in P3) -we avoid the technicalities involved in the proof, because they will not be relevant for the results. Thus, we were lead to believe that a Hadwiger-type theorem was at hand, lowering the magic number to 5 but imposing a compatible order, to rule out this example. But this turned out not to be the case as the following, and last, example shows. Example 4. Consider two hyperboloids Qa and Qb, and let C be their curve of intersection, that is, C — Qa fl Qb- Then C is a curve of (algebraic) degree 4. It may have many different topological types. In our previous example it has two components each of which is (homologically) an essential cycle in both hyperboloids -and, believe us, this has to do with the impossibility of giving them an order. But it may also happen that C has two components C° and C1 which are topological circles, and each of which bounds a disk in both hyperboloids -with the obvious notation, we can call these disks D%,D$,D* and L>J, so that dD\ = C1 and D\ C Q*. For an example, consider two ellipses centered at the origin in R2 having 4 intersection points; let them be sections of hyperboloids Qa and Qb with central axis on the z-axis but expanding, as hyperbolas, at different rates (see Figure 2). This is the case we want to study. We have two spheres S° = D°a U D% and Sl = Dla U D\ with "equators" C° and C1, respectively. Consider one of them, S = Da U Db dropping the superindices for a moment. We visualize it as a baseball. The stitching is the equator and the two patches are the hemispheres. So let us call this topological type of intersection of two hyperboloids a double baseball intersection. Each hemisphere of S, say Da (but the same holds for Db}, is ruled by intervals that start and end at the equator -the intersections of the rules of Qa with Da. If, with these rules, we can form a cycle of length 6 that goes alternatively from one hemisphere to the other, we can play the game of the example above, obtaining three lines (on one hyperboloid) and the corresponding transversals (on the other). The remaining three lines and transversals will come from the other sphere using the appropriate rulings of the hyperboloids to impose the needed intersections. The main point being that a rule of Qa, say, is transversal at most to two rules in a given ruling of Qb. Lets be more precise.
8
AROCHA, BRACHO AND MONTEJANO
Denote by /i+ and h~ the two rulings of Qa, and likewise h£ and h^ for Qb -our change in notation from Example 3 is because 0 and 1 have now a different meaning. For any Qa and Qt, (with no common rules) we have a map R+ : C -> C
defined as follows. Given p e C = Qa fl Qt,, let h+(p) be the rule in /i+ through p; since /i+ (p) n Qb C C has at most one other point than p, define it to be R£(p) if there is such, or R£(p) =piih£ (p) C\Qb — {p}- Similarly, we have three other maps R~,R^,R^ : C —> C, which will be addressed as the ruling involutions of C. Clearly, they are involutions, that is, e.g., (Ra) = R-a0Rt = ^- ^n Example 3, Ra and Rp are not globally the ruling involutions, but they are so in each component, so that the example can be constructed using them. Now, suppose that Qa and Qb have double baseball intersection. Then, each of the ruling involutions keeps the components of C fixed (as opposed to Example 3 where they transpose them) because now they are inessential. Therefore, they act as (topological) reflections on C° and C1. Consider one of the components, C° say. The composition of two ruling involutions (corresponding to the two hyperboloids, say R^ o 72+) is then an orientation preserving homeomorphism in CQ = S1, with a rotation angle a. Examples show, and the algebraic nature of the context makes plausible, that all the orbits of this "rotation" have the same behavior depending on a. Our examples arise when a = yr/3. More precisely, suppose Qa and Qb are such that for some p~± G C° we have that
(i)
fo-°#)3(p?)=ri-.
Then, as in Example 3, define p^ := R+ (PI"), p% '•= R^ (PI)I P2 := &a (Pz)iP3 '•= Rb feOiPs" := ^a (PI) (our condition then gives R£ (p^) = p+); and i, := h+(p+) = ^(pr), # :== h^(pj) = ^(p+) for (i j k} = (I 2 3). If we also have pj e C1 such that (R~ o R+)3 (p+) = p+, then, using R£ and then R~, the lines ^4,^5,^6 € h£ and £^,£^,l^ £ h~ can analogously be defined giving an example of 6 lines without transversals, but with 5 to 5 transversals. By sending an appropriate plane to infinity, and probably relabeling the lines among the subsets {1,2,3} and {4,5,6}, it is clear that they look like Figure 1. Thus the transversals are compatible with the natural ordering.
TRANSVERSAL LINES TO LINES
FIGURE 1. This is a plane projection of a real 3D example. You can find it in the Web page: http://combinatoria.matem.unam.mx/Add/TrcUisvLines/Default.html
It remains to prove the existence of such Qa and Qb- For this, let them be defined, for a, 6 > 0, by the following equations in R3. Qa
v2 : a2x2 + ^ - z2 = 1,
Qb
: x2+y2-b2z2 = l.
As we will shortly see, they do have double baseball intersection when 0 < a < 1, and b > I/a. So it will be convenient to define c := l/b, and use parameters a and c subject to the condition 0 < c < a < 1. Indeed, if we contract the z-axis by a factor c, Qb becomes the canonical hyperboloid (x2 +y2 — z2 = 1) and Qa is given by the equation a2x2 + a~2y2 — c2z2 = I. These are the hyperboloids we will study, referring to them still as Qa and Qb- The projection of their intersection C = Qa D Qb to the yz-plane may be derived by solving for x2 in the equation of Qb and then substituting in that of Qa, giving
E_
•
y
a2-c2
which is an ellipse, E, for 0 < c < a. The two components of C are then obtained by lifting each point in this ellipse E (on the yz-plane) to the appropriate x-coordinate (positive for C° say, and its negative in C1). So that all the analysis can now be done in the yar-plane, whose hyperbolas of intersection with Qa and Qb are, lets say, Ha and Hb respectively, (see Figure 2). The rulings of Qa (respectively, Qb), project to the pencil of tangent lines
AROCHA, BRACHO AND MONTEJANO
10
to Ha (resp., HI,), so that the ruling involutions can be seen on E as the transposition of the feet of the chords in E belonging to the appropriate part of those pencils. Let us call the ruling involutions R+, R~, R£, R^ : E —> E as before. We are seeking for the appropriate a and c such that (1) holds. Observe, that by the symmetry of our example, it suffices to do this on E and then lift it to the actual components C° and Cl.
y
FIGURE 2 Though hard to write down explicitly, observe that Rb o Ra (where we will drop the superindices by making an specific choice) is, by its algebraic nature, an analytic function, which can be thought of as going from the circle to the circle. It then has a topological rotation angle a. Which, by a well known theorem in dynamical systems, makes RboRa topologically equivalent to the rotation of angle a. This implies that if the angle is rational, then all the orbits are finite and of the same length. But moreover, if it has a finite orbit then all the others have that same length. We are looking for one orbit of length 3. Our example tells us exactly where to look for it. To fix ideas, let ha be the pencil of Qa with negative slope and h^ the one with positive slope. Observe that Ra has exactly two fixed points, namely the two points of E where lines of the pencil ha are tangent to it. Let pa be one of them (with z > 0, say), and let i^ be the line of hb that passes through it. So that (Rb o Ra) (pa) is the other foot of 4, say p. Observe that the only possible way that (Rb o Ra)s (pa~) — pa, is then that the other foot of the chord ha(p) is precisely a fixed point of Rb (see Figure 3). Therefore, we have a simple way of finding out if (Rb o Ra) has an orbit, and hence all the orbits, of length three. Namely, calculate the fixed points pa and pb for Ra and Rb respectively (chosen among the respective pairs with obvious geometric arguments), and find the lines -4 := hb(pa) and
TRANSVERSAL LINES TO LINES
11
P •f/n
£a '•— ha(pb). Then, (Rb o Ra]3 = id# if and only if ia n 4 € E. In principle, this procedure can be carried on. An algebraic "tour de force", involving the "right" parametrizations and a miracoulous solution of the equations that appear (with no further important contribution to the present paper), yields that 4 n 4 € E if and only if (a2 -
where, of course, we are still assuming that 0 < c < a < 1. Observe that the denominator has roots at 0, the golden ratio < & : = ( ! + \/5)/2 and —&~l. Surprisingly, the numerator has roots at the inverse golden ratio <&-1, and also at —Q~l and a double one at 0. So that /j, has a single pole at <& and zeros at 0 and 3>~l (Figure 4). Curiously /z(a)^(l/a) = 1. In particular, //($~1) = 0; also important to us are the facts that /^(l) = 1, and that 0 < JJL(O) < a for 3>-1 < a < 1. Because then we have proved the existence of our examples: for every a between <&-1 and 1, take c = //(a). Then any point in E (or C° and C1) different from the four points of tangency to the rulings ha an hb serves to form the needed cycle of length 6 with lines alternating on the rulings of Qa and QbSummarizing, there exist examples of 6 lines in R3 with 5 to 5 transversals compatible with a linear order, but without transversals. For the last Section, it will be interesting to note now that the lines in these examples can be reduced to closed intervals. 5. THE IMPROVEMENT Examples 3 and 4 outlined above, and their obvious generalization to other kinds of topological intersection of hyperboloids, turn out to be the only ones
AROCHA, BRACHO AND MONTEJANO
12
-1
that make it impossible to lower the magic number 6 of Proposition 2.1 to 5. However, they cannot grow as Examples 1 and 2 did. Theorem 5.1. Let £ be a family of lines in general position in Pn. If$£>7 and every 5 lines in C have a transversal line, then C has a transversal line. Proof. Suppose that there are 6 lines in C, say t\,li,--- ,^e with no common transversal. By hypothesis they have 5 to 5 transversals, which we denote i , i ' " > labelled so that
Observe that then Cf- ^ t^ for i ^ j. Our first goal is to prove that there are no more transversals than the obvious ones for all subsets of 4 and 5 elements. We claim that for all i, j (indices understood between 1 and 6), we have that (3)
We will refer to these equalities as "uniqueness" of transversals because the sets on the right hand side are, by definition, contained in the corresponding left hand sides. To ease notation, we may take i = 6 and j = 5. So consider ^1,^2,^3,^4- By the general position hypothesis, and the fact that )|/i(fi,^2,^3) > 1, we have that /i(^i,^2,^s) is the ruling of a hyperboloid. If £4 is an element of its orthogonal ruling /i(^i,^2 5 ^3)~ L ) then every transversal to ^1,^2,^3 is also transversal to £4, but then £4- is transversal to ^4, which does not happen. Therefore ^(^1,^2,^3,^4) < 2, and the first equation is proved. Since fc(^2,4,4,4) C /i(^2,4,4) = {^,4l> but ^ i ^(^1,^2,^3,^4,^5) by definition, the second uniqueness equation follows.
TRANSVERSAL LINES TO LINES
13
Now, consider any other line i € C. Since
then t is transversal to f.§ or to CQ . This clearly holds for any subset of two. Namely, for each i and j, we have that t is transversal to one of t^ or i^. If we assume that i is not transversal to one of the "transversals" t ^ - , say to IQ, then, using all the sets of 2 elements containing 6, we conclude that
(4)
leh^e^^ii).
Observe that this is also the case if i meets all of the t\- . To conclude from here that i = 4, we need the equivalent version of (3) with the "transversals" playing the role of the "original" lines and viceversa. Observe that all of the conditions on them are symmetric except for the general position of the "original" lines. But the general position of the "transversals" follows because every pair of them are in a ruling, e.g., #5-, IQ- £ /i(4,4,4)- Thus, we have the corresponding uniqueness equations (3) for the "transversals", which imply, from (4), that I = 4We have proved that any line t 6 C is equal to one of 4,4, - " ,4Therefore jj£ = 6. The condition J}£ > 7 then implies that every 6 lines have a transversal line and the Theorem follows from Proposition 2.1. • Remark 1. The general lines considered thoroughly in the preceding proof belong to the family outlined in Examples 3 and 4. Indeed, if we let Qa = IM4,4,4)| and Qb = |h(4,4,4)|, then #,#,# e /*(4,4,4) and t*, #5,26 £ M4>4,4)- The intersection points ii Mj- for {i,j} C {1,2,3} or {«, j} C {4, 5, 6} are then in C = Qa D Qb. They form two cycles of length 6 (joined by the corresponding lines) and are related by the corresponding ruling involutions just as in Example 4. They also have the property of behaving like this for any other subset of 3 to start with. Remark 2. The "grown up" Examples 1 and 2 show that some hypothesis like "general position" is needed. It could possibly be weakened, but hardly stated more simply. 6. INTERVALS The purpose of this last section is to obtain a criterion for the existence of transversals to a set of intervals in Rn. By an interval we mean any connected subset of a line, so that they may also be open, rays or complete lines. A line being transversal to a set of intervals means that it does intersect all of them. We denote, as before, by /i(/i,/2, • • • ,/&) the set of lines transversal to the intervals /i, /2, • • • , IkThe extension of Theorem 1.1 to intervals, requires the Hadwiger hypothesis of partial transversals compatible with a given linear order. Because
14
AROCHA, BRACHO AND MONTEJANO
we have been working in projective space, where the general problem really lies, one other natural Hadwiger-type hypothesis to consider is compatibility with a given cyclic order. So, before going into the main theorem, let us give an example which will also come handy for the proof. Example 5. Consider the hyperboloid Qa of Example 3 for any angle a, 0 < a < TT. But now with the circle C° at height z = — 1 (C° = S1 x { — !}), so that Qa becomes symmetric with respect to the xy-plane, where it intersects at its smallest horizontal circle, which we call S. Consider k points pi,p2, • • • ,pk that form an equilateral k-gon in 5, observe they have a natural cyclic order. Choose one of the rulings of QQ, say h^,. And then for any t > 0, let Ii(t) be the interval of the corresponding rule h^(pi) that satisfies —t
n : Qa -»5 n() = hla(q)ns. So that, for any subset A C (1, • • • , fc}, with $A > 3, we have that
h({ii(t) -. i e A}) ^ 0 ^ p| n (/,(£)) ^ 0. i€A
Moreover, the transversals correspond one-to-one to the intersection points; the former are precisely the rules of h^ passing through the latter. By symmetry, the projections II (/i(i)) are arcs in S centered at pi. Their angle grows monotonously with £, so that it is better to change the meaning of t for half of that angle. Now, t goes from 0 to TT (never reaching it). For small values of t there are no transversals to the intervals Ii(t) in the ruling h^j but they will gradually appear as t grows. For t = TT /k we have the first (rule) transversals for consecutive intervals. For t = 2(?r/A;), the first three-way transversals appear, but only for three consecutive intervals. This goes on, so that for t = (k — 2) (TT//C), every subset of k — I intervals (which is necessarily consecutive) has a unique common transversal; but there is no transversal to them all. This example ({/^(t)}, t = (k — 2) (ir/k)) shows that for any /c, there are intervals such that every k — l of them have transversal lines compatible with a given cyclic order, but with no total transversals; thus, that an extension of Theorem 1.1 to intervals, requires an extra hypothesis which cannot be compatibility with a cyclic order. It also shows, by the way, the impossibility of a simple Helly-type theorem for connected subsets of the circle. The existence of transversals to all the intervals, /i(i), first happens when t = (k — 1) (TT/A;); where exactly k transversals to the k intervals appear.
TRANSVERSAL LINES TO LINES
15
Each transversal intersects the intervals in one of the k compatible linear orders of their natural cyclic order. The example just developed is, in many ways, not as particular as it seems; because all hyperboloids are projectively equivalent, so that Qa serves as a good model to think about any of them. Let us remark some of these general facts. First, for any set £ of k intervals along one ruling, h°, of a hyperboloid Q, they naturally acquire a cyclic order such that all the orthogonal rules hit them (or their supporting lines) in that order. Second, once an orientation is given to a rule, it spreads uniquely to all the lines in its ruling (in Example 5 this is implicitly given according to the 2-axis); cyclic orders implicitly use this fact. Third, thinking of the hyperboloid in affine space, as a rule of hl moves, the intersection points with the distinguished lines (in £) move, in the positive direction say; the "largest" goes to infinity and reappears on the other side so that all compatible linear orders are shown, each of them in a connected interval of rules. Finally, observe that the projection by a ruling, can also be made to any orthogonal rule, and they are topologically equivalent. We have now enough information to prove our last result. Theorem 6.1. Suppose C — {/i, /2, • • • , Ik} is a family of intervals in W1. If for every 6 of them there is a transversal line that intersects them compatibly with their linear order, then they have a transversal line. Proof. First of all, note that if for some subset of 4 intervals, say h, h, Is, I^i we have that jj/i(/i,h,Is, I±) < 2, the 4-2 argument goes through, taking intervals instead of lines, without any use of the order assumption. So we will assume henceforth that every four of our intervals have at least 3 transversals, addressing it as the "4-3 assumption". Let ti be the line in which /j lies, considered as a line in Pn. The proof falls into cases, corresponding to Propositions 2.1 and 3.1. Case 1. Suppose t\,ti,--- ,@k are in general position. By the 4-3 assumption, each four of these lines, and hence all, lie in the ruling h° of a hyperboloid Q. Furthermore, all of their (at least 3-way) transversals lie in the other ruling hl of Q, which may then be oriented to keep the cyclic ordering (12 • • -k] -there are enough partial transversals to assure this is the cyclic order. We must find a rule in hl that intersects all the intervals. To get the idea of the general argument and to establish notation on the way, suppose there exists a rule t 6 hl that misses all the intervals /i,/2, • • • ,-ffc- Then, the projection, II, of Q by the ruling hl unto any rule of /i°, say to £Q, gives us k intervals in the real line (£o\{t A IQ}}, with 6 to 6 intersections. More than enough ("4 too generous") to apply Helly's Theorem on the line and obtain a common point of the projections, and thus a transversal to the intervals.
16
AROCHA, BRACHO AND MONTEJANO
For the general argument we use the linear order. Consider the two rules t\,ik € h°. By the remarks above, we have that IQ breaks into two intervals such that the rules in hl that pass through one of them, say /o, hit i\ and Ik in the order 1 < k, and the rules through the complement hit them in the order k < 1. Consider now the set of intervals Ij := II(/i) n/o,i = l , . - . , f c , as convex sets in the real line (sending to infinity any point outside /o). Our hypothesis of transversals compatible with the order 1,2, • • • , fc, gives us that each 4 of the /; intersect. Because if we add I\ and /fc, to the four corresponding /;, by hypothesis we get a transversal line with 1 and k as extremes, and such a rule intersects IQ. Classical Helly in the line (now with "generosity 2") gives us the total transversal. The remaining cases correspond precisely to those of Proposition 3.1. They follow them step by step making the convenient, or necessary adjustments for intervals. So suppose H.\ and i^ meet at the point p and span the plane P. Observe that now the prescribed linear order of the Theorem need not correspond to the indices, but it will be much simpler to follow the notation of Proposition 3.1, keeping this in mind. Case 2. We assume ^1,^2 and i% lie in the plane P but now we can generalize to /i,/2,/3 not concurrent. In this case, /i(Ii,/2,/3) need not be all the set of lines in P , but it is certainly contained there, and that's enough. We must now consider, for every other interval, its intersection with P. They are all intervals or points. So that the case follows from the classical Hadwiger's Theorem (with "generosity 0"). Indeed, for each three of the intersections, /j n P, adding /i,/2,/3 to them we get a compatibly ordered transversal on the plane. Observe that the argument extends to the case p ^ /i fl /2, because then /i(/i, I^) is contained in the lines of the plane P and we can apply Hadwiger (with "generosity 1"). Case 3. We can assume that p — I\ Pi /2, and the case extends to the existence of 73 such that 1% n P = 0. Since /i(/i,/ 2 ,/3) = {p V ps : ^3 6 /3J which is contained in the lines of the plane p V ^3. This case follows from Hadwiger's Theorem as the previous one, now arguing in the plane p V £3. Case 4. Now, we have that every interval contained in P passes through p, and the remaining ones intersect it at a point. Assigning points as in the corresponding Case, we obtain that they are either colinear or a contradiction to the 4-3 assumption. • A final remark about the notion of "compatibility" is in order because of the degenerate cases. We understand that a transversal line is compatible with the given order if the map of the indices +o the intersection points is monotonous (in the transversal), and not necessarily strictly monotonous. Hadwiger's Theorem clearly holds in this case.
TRANSVERSAL LINES TO LINES
17 REFERENCES
[1] Anderson, L. and Wenger, R., Oriented matroids and hyperplane transversals, Adv. Math., 119 (1996), 117-125. [2] Arocha, J.L. , Bracho, J., Montejano, L., Oliveros, D. and Strausz, R. Separoids, their category and a Hadwiger type theorem for transversals, Discrete and Computational Geometry, 23 (2002), 377-385 [3] Dantzer, L. , Griinbaum, B. and Klee, V., Kelly's theorem and its relatives, Convexity, vol. 7, Proc. Sympos. Pure Math., Amer. Math. Soc., Providence, RI, (1963), 101-180. [4] Eckhoff, J., Helly, Radon and Caratheodory type theorems, Handbook of Convex Geometry (P. Gruber and J.M. Wills eds.), North-Holland, Amsterdam, (1993), 389-448. [5] Goodman, J. E. and Pollack, R. Hadwiger's transversal theorem in higher dimensions, J. Amer. Math. Soc., 1 (1988), 301-309. [6] Goodman, J. E., Pollack, R. and Wenger R. Geometric transversal theory, New Trends in Discrete and Computational Geometry (J. Pach ed.), Springer-Verlag, Berlin, (1993), 163-198. [7] Hadwiger,H. Uber Eibereiche mit gemeinsamer Treffgeraden, Portugal. Math., 16 (1957), 23-29. [8] Hilbert, D. and Cohn-Vossen, S. Geometry and the imagination, Chelsea Publ. Comp., New York, (1952). [9] Katchalski, M., A conjecture of Griinbaum on common transversals, Math. Scand., 59 (1986), 192-198. [10] Wenger R., Helly-type theorems and geometric transversals, Handbook of Discrete and Computational Geometry (J.E. Goodman and J.O. Rourke eds.), CRC Press, Boca Raton, FL, (1997), 63-82. E-mail address: E-mail address: E-mail address:
[email protected] ''Jorge L. Arocha'' roliSmath.unam.mx ''Javier Bracho''
[email protected] ''Luis Montejano''
ON A SHORTEST PATH PROBLEM OF G. FEJES TOTH
DONALD R. BAGGETT Department of Mathematics, Auburn University, AL 36849-5310, U.S.A, ANDRAS BEZDEK 1 Department of Mathematics, Auburn University, AL 36849-5310, U.S.A and Renyi Institute of Mathematics, Hungarian Academy of Science Budapest, Hungary, H-1053
ABSTRACT. We study that version of the shortest path problem, when a tiling is given and one wants to connect two boundary points by navigating only along the edges of the tiling. We are seeking strategies which minimize the ratio of the distance covered to the straight distance between the start and the target points. As a corollary we solve a special case of a problem of Gabor Fejes Toth concerning circle coverings.
1. INTRODUCTION Motivated by the diffusion phenomena L. Fejes Toth [3] suggested to study the problem of arranging disjoint discs in parallel strips so as to force a point travelling across the strip and evading all circles to describe a possibly long path. His study inspired several further results, which can be traced through the survey [2] by G. Fejes Toth. Computational Geometry - starting with the paper [5] by Papadimitriou and Yannakakis - in recent years gave the shortest path problems a new significance and boosted their further development. See [4] by J.S.B. Mitchell for a detailed account on variations of the problems considered so far. The common thread is that a certain obstacle scene (packing) is given and one has to find a navigational strategy for a robot to minimize the length of x
The author was partially supported by the Hungarian National Science Foundation, grant numbers T016131, T16387 and T38397 19
20
the path as the robot gets from a start point to a target point. One can make different assumptions on the type of the obstacles and also on the sensor capabilities of the robot (the whole map can be known in advance or instead the robot learns of the obstacles only as it is able to see or contact them, etc.). By definition we say that a strategy achieves a ratio r if for any 6 > 0 the ratio of the connecting path to the straight distance is less than r + € whenever the start and target points are sufficiently far away from each other. At this point we need to recall the following conjecture of G. Fejes Toth, which initiated the study of the duals of the above shortest path problems: Conjecture of G. Fejes Toth. Let both P and Q be multiple covered points in a given covering of the plane by congruent closed discs. Given any e > 0 prove that if the distance PQ is sufficiently large, then there is a path which connects P to Q, evades the single covered parts of the plane and has a length less than (\/2 + e)PQ. Note that the lattice covering, which arises when the centers of the unit discs form a square grid of side length \/2, shows that \/2 in this conjecture can not be replaced with any smaller constant. We can say that with his conjecture G. Fejes Toth initiated the study of duals of short path problems. In case of packings one optimizes paths, which stayed within the uncovered regions. In case of coverings he considers paths staying within multiple covered regions. In this paper we study a related variation of dual-shortest path problems. We assume a tiling is given and one wants to connect two boundary points by navigating only along the edges of the tiling. We again are seeking strategies which minimize the ratio of the distance covered to the straight distance between the start and the target points. We will prove Theorem 1. Let C be a lattice tiling of the plane by central symmetric hexagons, which are inscribed in circles of radii 1. Let S and T be points on the edges of C. There exist a path connecting the start point S to the target point T along the edges of C, whose length is at most \/2\ST\ -f 5\/2 + 3. Theorem 1 says that G. Fejes Toth's conjecture is true for lattice coverings of the plane by discs. The following theorem gives a bound in case of nonlattice tilings. Theorem 2. Let T be an edge-to-edge tiling of the plane by convex polygons with maximum edge length e and maximum interior angle 9. Let S and T be points on the edges of T. There exist a path connecting the start point S to the target point T along the edges of T which achieves a ratio arbitrarily close to sec (|). In fact we show that the length of the connecting path is at most sec (f) ^(\ST\2 + e2) + 2e.
21
ON A SHORTEST PATH PROBLEM
Corollary. If we have only acute triangles in the tiling, then the maximum angle 0 is at most £, and thus sec(|) < \/2. According to Theorem 2 in these tilings there exists a path, consisting of edges of T and connecting the start point S to the target point T, which achieves a ratio arbitrarily close to \/2. 2. PROOFS We start with three elementary lemmas: Lemma 1. Assume that the altitudes AA\ and CC\ of the acute triangle ABC intersect each other at a point M (Figure 1). Consider all lines, which pass through M and intersect the segments AC\ and A\C. Denote these intersection points by C* and by A* resp. Prove that among these lines the length of the polygonal path AC*A*C is maximal either when the line coincides with AA\ or when it coincides with CC\.
FIGURE 1 Proof of Lemma 1: Without loss of generality we may assume that \BM\ = 1. Denote the acute angles /.ABM and /.MBC by a and f3. We will find a formula for the pathlength l(AC*A*C) in term of the /.CM A* = 6). Let 1(6) = l(AC*A*C) It is easy to see that:
1(8) = l(AC*A*C) = \Ad\ -
|C*M|
With the help of the function g(x) = -^^ — tan x we can write *C) = \Ad\ + |AiC| + 8inag(6) + sin/ty(a + /3 - 6)
22
BAGGETT AND BEZDEK
A simple calculation shows that for 0 < x < |- the second derivative g"(x) — ^3^(1- sin x)2 > 0, thus I"(8} = sin /3g"(6) + sin ag"(a + f3 - 8} > 0, which means that the function /(<*>) is convex up and on the interval [0,ZAiMC] it takes on its maximum at one of the endpoints. D Lemma 2. Let APQD be a quadrilateral inscribed in the semicircle erected above the diagonal AD. Let C be a point on the side QD. First draw a line parallel to the diagonal PD through C and denote its intersection point with the diagonal AQ by M. Then draw a line parallel to the side PQ through M and denote its intersection points with the sides AP and QD by PC and QcProve that for each C the ratio of the length of the polygonal path APcQcC with the distance AC is at most \/2Proof of Lemma 2: Let B be the intersection of the lines AP and QD. Denote the intersection of the line MC and the side AB by E. Notice that M is the intersection of the altitudes AQ and EC of the acute triangle ABC. By Lemma 1 the ratio in question is less then the maximum of 4^7 and ^y , which is \/2, since both triangles AEC and AQC are right triangles. D Let C be again a lattice tiling of the plane by central symmetric hexagons, which are inscribed in circles of radii 1. Color the vertices of the tiling £ red and blue so that no edge connects two vertices of the same color. Notice that any translation which takes a vertex onto another vertex of the same color takes the tiling onto itself. We will need the following rather technical fact: Lemma 3. Given two points S and T on the edges of the lattice tiling C centralsymmetrical hexagons, one can move them along the edges of the tiling to a pair of red vertices Sr,Tr and to a pair of blue vertices S(,,Tb, such that at both changes the endpoints S and T are moved with a total path length at most 3 + 2\/2, ii) STTr and S^T^ are parallel and have the same length, which is at most \ST\ + 3. Proof of Lemma 3: Let p be the perimeter of the tiles. Since the tiles are inscribed in a unit circle, their perimeter is at most 6 . Since along the boundary of one hexagonal tile the vertices of the same color are at most |p apart, S and T can be moved along the edges to vertices 5"*,T* of the same color at an expense of total path length of 3. This implies that the distance between S* and T* is at most |ST| + 3. One of the neighboring edges of S* must be shorter, than \/2. Moving S* along this edge and moving T* along a parallel edge we reach a neighboring vertex of the other color at an expense of total path length 2\/2. D
ON A SHORTEST PATH PROBLEM
23
FIGURE 2 Proof of Theorem 1: For reference purposes select one of the hexagonal tiles, denote it by H and denote its center by 0. Let C be that boundary point of H, for which the rays OC and ST are parallel. Let D be the vertex of H, which is closest to C and denote by A the vertex of H which is across C (Figure 2). Without loss of generality we may assume that the tiling is oriented so that the diagonal AD is horizontal, A is left from D and the ray OC is in the half-plane above the diagonal AD. Let APQC be the upper half of the hexagon H. Using Lemma 3 we will assume that S coincides with A and T has the same color as S (At the end of the proof we will take in account that this could require an additional path length of 3 + 2\/2 and also need to remember that the distance between the start S and the target point T in fact could increase by at most 3). By the choice of the vertex D, the ray ST intersects the side QD. Next we define a type of path, which we will call zig-zag path along a diagonal line. Let U,V and W be three consecutive vertices of a tile H. The union of the hexagons {H -f kUW\k is an integer} is called a row in the tiling. The boundary of this row consist of two infinite paths, the one passing through U will be called zig-zag path along the diagonal line UW. Two zig-zag paths are parallel if their defining diagonals are parallel. Let us connect S to T by travelling first on the zig-zag path along the diagonal line AQ and then turning and going towards T on the zig-zag path parallel to the one along a diagonal PD. Due to the fact that both vertices S and T have the same color, this connecting path uses even number of edges from both zig-zag paths. Also notice that the ratio of this path length with the length PS is equal to the ratio -*—rf^r—? where PC and Qc means the same as in Lemma 2. \AL/ \ Thus it is at most \/2. In case S and T are not necessarily lattice points, according to Lemma 3 the actual path could be longer by a length of 3 + 2-S/2 and the actual length of ST could be smaller by a length of at most 3.
BAGGETT AND BEZDEK
24
These differences are responsible for the added constant in the inequality of Theorem 1. D Proof of Theorem 2: Choose one of the tiles and a vertex - say V - of it. The interior angle at V is less than 9. Thus, given a directed ray "r^ emanating from the vertex V into the polygon, we can travel to a neighbouring vertex W of the polygon such that ',_—J _^ is less than sec(f), where proj(VW, ~r*) denotes the projection of the vector VW onto the ray T*. We say that we can travel from V to W with an efficiency of sec (|) with respect to the ray T*. We first assume S and T are vertices of our tiling, and leave the remaining case for later. For simplicity, we denote ST as the positive rr-axis. For any angle >£ ( — £,£•), we can find an edge path emanating from S and achieving an efficiency of sec(|) with respect to r^, the vector corresponding to the angle 0. Notice that for a given >, it is possible that many edge paths are efficient.
FIGURE 3 Similarly, we construct edge paths emanating from T which are efficient with respect to — r^. If there exists an angle 7 G ( — f ? f ) such that an edge path emanating from 6* and an edge path emanating from T intersect, such that both paths are efficient with respect to the same vector, then we have the desired path by simply travelling along the first path and switching to the second at any point of intersection. The idea of finding two efficient paths heading towards each other was outlined for different purposes in [1] by G. Fejes Toth. It turns out that proving that this idea works involves more than just a continuity argument so we present in our case a detailed proof, and thus prove the existance of a path whose length is at most sec(|)|,ST|. Of the efficient paths emanating at S, two distinguish themselves. The first is the path which results in always choosing the leftmost vertex W possible,
ON A SHORTEST PATH PROBLEM
25
in the sense that VW results in the largest angle possible in [0 — |,0 + |]. We call this the leftmost path PL(<^), and define the rightmost path PR(<^>) similarly. Define p ( S ) as the line passing through S perpendicular to ST: and define p(T) similarly. We assume that no angle 0 results in a path emanating from S passing through T, since we would simply take that path as the desired one. For every path P that intersects p(T), define C(P) to be the point of P H p(T) closest to T. We say a path P emanating at S "goes up" if C(P) is above T or if C(P~) does not exist and all but finitely many of P's vertices are above ST. We say a path P emanating at S "goes down" if C(P) is below T or if C(P) does not exist and all but finitely many of P's vertices are below ST. We define U to be the set of all paths that go up and V to be the set of all paths that go down. The set U U T> partitions the set of all paths emanating from S. For the moment, we restrict ourselves to examining only the leftmost paths emanating from S. Assume PL(<£) £ T>. Before passing through the line through T perpendicular to r^, PL(<J>) passes through only finitely many vertices of our tiling, say k of them. At each of these vertices, we chose the next vertex to be the leftmost one possible. Thus, we can choose a sufficiently small angle e such that the same k choices would be made for the path PL(4> + e), giving us PL(> + e) G Z>. Therefore, if PL(» € £>, then PL( + e) G X>. So the set (0|P/,(!>) £ T>} is an open initial segment of ( — f , f )• By a similar argument, the set {<£|PR(>) 6 U} is an open terminal segment of ( — f , f). If these open sets intersect, we have an angle > in the intersection whose leftmost path goes down and whose rightmost path goes up. This is an immediate contradiction since PR(>) is bounded from above by PL(<£). Thus the closed intervals must intersect, guaranteeing the existence of an angle 7 <E U H V. The paths PL(j) and PR(I), along with the line through T perpendicular to r^, bound a region (Figure 4) into which any edge path emanating from T and efficient with respect to — r^ must enter. This edge path emanating from T must make steady progress in the direction of — r^, and thus must intersect PL(7) or PR^). Therefore, by way of this intersection, we can construct an efficient path between any two vertices of our tiling. We now handle the case when S and T are possibly not vertices. Regardless of where 6* lies on some edge in our tiling, there is at least one vertex S' adjacent to S either on or to the right of p(S). Likewise, there must be at least one vertex T' adjacent to T either on or to the left of p(T). By the Pythagorean Theorem, \S'T'\ < ^/\ST\2 + (2e) 2 , and by the previous argument, we construct an edge path P' between 6*' and T' of length at
BAGGETT AND BEZDEK
26
FIGURE 4 most sec(f) A /|ST| 2 + 4e 2 . We define the desired path P between S and T as P = 'SS'UP'UT'T, which has length at most \S'T'\ < ^\ST\2 + 4e2 + 2e.
REFERENCES [1 G. Fejes-Toth, Evading Convex Disks, Jour. Studia Sci. Math. Hung. 13 (1978), 453-461. [2] G. Fejes-Toth, New results in the theory of packing and covering, Convexity and its Applications(Ed. by P. M. Gruber and J. M. Wills), 318-359, Birkhauser, Basel Boston Stuttgart (1983). [3] L. Fejes-Toth, On the permeability of a circle layer, Jour. Studia Sci. Math. Hung. 1 (1966), 5-10. [4] J.S.B.M. Mitchell, Geometric shortest paths and network optimization, Handbook of Comp. Geometry (ED. by J.-R. Sack and J. Urrutia), pp. 633-701. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000. [5] C. H. Papadimitriou, and M. Yannakakis, Shortest paths without a map, Jour. Proc. 16th Internat. Colloq. on Automata, Languages, and Programming, Lecture Notes in Computer Science 372, 610-620, SpringerVerlag (1989). E-mail address: E-mail address:
baggedrauburn.edu ''Donald R. Baggett'' bezdeanauburn.edu ''Andras Bezdek''
A SHORT SURVEY OF (r,g)-STRUCTURES
VOJTECH BALINT1 Department of Mathematics, University of Zilina, 010 26 Zilina, Slovakia.
ABSTRACT. This contribution gives a short survey of results on the combinatorial (r, g)-structures as the generalization of many geometrical structures. Theorem 4 gives a new estimate.
Example 1. Let A be a set of n points in Euclidean plane E2. Let B be the set of all the straight lines determined by the points of A. The line / € B is called line of order k if / contains exactly k points from A. The line of order 2 is called ordinary. What is the minimal number of lines determined by n points? What is the maximal number of lines of order kl What is the minimal number of the ordinary lines? (The last question is the well-known Sylvester-Gallai-type one.) These and similar questions for the points and the determined circles, horocycles, planes, unit circles are investigated in many papers. In order to generalize the above problems, we introduce the following combinatorial definition. Definition 1. (See [1], [7].) Let m,n,r,q be positive integers such that n > 3 and r < n. Let M be a set which contains at least n elements. Let A = {ai,a 2 ,... ,a n } C M. Let P(M] be the set of all the subsets of M. Let the set B — {B\. B<2, • •., Bm} C P(M) fulfil the following three conditions: Research was supported by Slovak National grant VEGA 1/7482/2000. 27
28
VOJTECH BALINT
(i) Each element B^ G B for k = 1,2,... ,m contains at least r different elements a^, a z - 2 , . . . , a; r 6 A; (ii) If Oj-j, a z - 2 , . . . , air are r different elements of the set A, then there exist exactly q different elements BJI , Bj2,..., Bjq G B such that for p = 1, 2 , . . . , q we have: a z - 5 G Bjp for each s G {1,2,..., r}; (iii) For every r + 1 different elements a^, a Z 2 , . . . , az'r+1 £/&ere is at most one element B^ G B such that az-s G B^ for each s G {1,2,...,r + 1}. Then the ordered triplet (M,A,B) is called (r, q)- structure. The elements of B are called classes and the elements of A are called points. An element Bj G B is called a class of order k when Bj contains exactly k different points of A. A point a; G A is called a point of degree k, if there exist exactly k different classes of B, which contain this point. The (r^q]-structure (M,A,B^ is called trivial if A G B , i.e. if the system of classes of B contains the class Bj = A. Example 2. Let M = E2. Let A be a set of n points in E"2, no three collinear. Let B be the set of all the circles determined by the points of A. Then (M,A,JB) is a (3,1)- structure. Example 3. Let M = H2, where H2 is the hyperbolic plane. Let A be a set of n points in H2. Let B be the set of all the horocycles determined by the points of A. Then (M,A,B} is a (2,2)-structure. Example 4. Let M = E2. Let A be a set of n points in E2 such that diam(A) < 2. Let B be the set of all unit circles containing at least two points of A. Then (M, A,J9) is a (2,2)- structure. Example 5. Let us take M = E3. Let M be a set of n points in E3 such that no four of them are coplanar. So every triplet of points a^o,, a^ G A determines uniquely a circle with centre Sij,k and radius ^,j,fc- Let us denote n^j^ the line passing through Sij^ and perpendicular to the plane determined by the points a^a^a^. Furthermore, denote 6 = max rjj^ and let us take the number D > S arbitrarily. So every triplet of points a{, aj, ak G A determines exactly two spheres with radius D and with centres on 71,-j^. If B is the set of the above defined spheres, then (M,A,B) is a (3,2)- structure. Example 6. Put A — {01^2,^3,04}. If we consider all its three-element subsets, i.e. B = {{a^c^as}, {ai,a 2 ,a 4 }, {ai,a 3 ,a 4 },{a2,a3,a4}}, we get a (2,2)-structure and a (3, l)-structure, too. As we see many geometric models are (r. q}-structures. It is expected thai taking advantage of the geometric properties one can get stronger results than those, which are proved for the abstract (r^q)-structure. Let us recall
A SHORT SURVEY OF (r, g)-STRUCTURES
29
for example that in [1] the inequality (1)
>n
ra
was proved for any (2,2)-structure (and in [7] for any (r, 2)-structure) and that this inequality is sharp for an abstract (r, fy-structure for n = 4,7,11,16. As a consequence, we have that the number of unit circles (or horocycles) determined by n points is at least n. This bound is significantly smaller than the bound en2 proved by Beck [8] where c is an extremely small). Let us point out that inequality (1) also solves the Problem 3 of [10]. The inequality (2) '
m> ~ "
n
\r/
was proved in [7] for any (r,q)-structure, r > 2, q < r. Theorem 1. ([1], [7]) Let n > 2 points be given in the hyperbolic plane H2. Then every point belongs to at least 1+v|n~ horocycles determined by these points. This estimate is the best possible one for n — J + 2 J+2 ? where j is positive integer. The same (and also the best possible one) estimate was proved in [2] for the unit circles determined by n points (see Example 4). This coincidence was unexpected in view of the following Theorem 2. ([6]) The combinatorial (2,2)-structure from Example 6 can be realized in the model of unit circles from Example 4, but it cannot be realized in the model of horocycles in Example 3. Later [3] it turned out that the bound l+V^n~7 holds for any (2,2)structure. The following is a further generalization: Theorem 3. ([4]) Let A = {ai,a2,... ,an}, r > 2 be an integer. Let (M, A,B) be a nontrivial (r, 2)-structure. Then every (r — l)-tuple of points of A belongs to at least —* ^
— classes of B.
There are lot of results concerning the Sylvester-Gallai-type question; see e.g. [21], [13], [15], [5], [9], [10], [18], [19], [25], . . . . Many of the analogues do not hold for the abstract (r, q)-structures. Example 7. Let us take A - {a-t.a2,a^,a4,arl.ac,o.r}. {02, a4, ay}, {a3, as, 07},}, we get a (2, l)-structure.
If v/e consider
30
VOJTECH BALINT
Example 8. B -
Let us take A — {01,02,03,04,05,06,07}. If we consider
{{Oi,0 2 , 0 3 , 04}, {Oi,0 2 ,a5,a 6 }, {01,03,06,07}, {fll,a 4 , 0 5 , 07},
{02,03,05,07}, {02,04, OQ, 07}, {03,04,05, Og}, }, we get a (2,2)-structure. Notice that neither the (2, l)-structure in Example 7, nor the (2,2)-structure in Example 8 contains a class of order 2. Theorem 4. Let A = {01,02,... ,o n }, r > 2 be an integer and let (M, A,B) be a nontrivial (r, 2)-structure. Let us choose k (E 1 , 2 , . . . , r — 1 arbitrarily.
i /
/
rr^rA
Then every fc-tuple of points of A belongs to at least ^ ( 1 -f- w 1 + 8(™_k) I classes of B. Proof. Without loss of generality we consider the fc-tuple a
k
— [an-k+l 7an-k+2i • • • 7an}•
The number of classes containing the A>tuple cr^ we denote by v; from this v classes one can create (2) pairs of classes. If such two classes contain the A>tuple cr/e, then - in consequence of (Hi) - they can have, besides these k points, at most (r — k) further points in common. Every r-tuple of points of the form { 0 ^ , 0 ^ , . . . , o l r _ f c ; o n _ f c + i , o n _ f c + 2 , . . . ,o n }, ij G { 1 , 2 , . . . , k } for j = 1,2, ...,r — k belongs exactly to two classes containing the chosen ktuple ffki an(l therefore these (r — fc)-tuple belongs to exactly one such pair of classes. So, it must be true that (2) > ("l£)- Hence, zAi/-2(™~£) > 0. From this we get the desired inequality. D However, there remains many open questions; one of them is the following: "What is the sharp lower bound for the total number m of classes for (r, g)structuresT"1
REFERENCES [1] Balint, V.: On a certain class of incidence structures. Prace a stiidie Vysokej skoly dopravnej v Ziline 2 (1979), 97-106. (In Slovak "0 urcitej triede incidencnych struktur", summary in English, German and Russian.) [2] Balint, V.: On a connection between unit circles and horocycles determined by n points. Period. Math. Hung. Vol.38 (1-2),(1999), 15-17. [3] Balint, V.: One combinatorial theorem and two of its geometrical corollaries. In:Research Communications of the conference held in the memory of Paul Erdos, Budapest, Hungary, July 4-11, 1999, 27-29. [4] Balint, V.: Extension of certain combinatorial estimates with geometrical background. Period. Math. Hung. Vol.39 (1-3),(1999), 135-138.
A SHORT SURVEY OF (r, g)-STRUCTURES
31
[5] Balint, V.; Balintova, A .: On the number of circles determined by n points in Euclidean plane. Acta Math. Hungarica 63 (3-4) (1994), 283289. [6] Balint, V.; Branicka, M.; Gresak, P.; Novotny, P.; Stacho, M.: Realizability of combinatorial (r,q)-structures in the geometrical models. Studies of University of Transport and Communications in Zilina 12 (1999), 3-10. [7] Balint, V.; Lauron, P.: Improvement of inequalities for the (r^q]-structures and some geometrical connections. Archivum Mathematicum, Tomus 31 (4) (1995), 283-289. [8] Beck, J.: On the lattice property of the plane and some problems of Dirac, Motzkin and Erdos in combinatorial geometry. Combinatorica 3 (3-4) (1983), 281-297. [9] Bezdek, A.; Fodor, F.; Talata, I.: On Sylvester type theorems for unit circles. Discrete Mathematics Selected papers in honor of Helge Tverberg, 241 (2001), 97-101. [10] Bezdek, A.: Incidence problems for points and unit circles. In: Research Communications of the conference held in the memory of Paul Erdos, Budapest, Hungary, July 4-11, 1999, 33-36. [11] Bezdek, A.: On the intersection points of unit circles. Amer. Math. Monthly 99 (1992), 779-780. [12] de Bruijn, N.G., Erdos, P.: On a combinatorial problem. Nederl. Acad. Wetensch. 51 (1948), 1277-1279. [13] Csima, J.; Sawyer, E. T.: A short proof that there exist 6n/13 ordinary points. Discrete and Comput. Geometry 9 (1993), No.2, 187-202. 3 [14] Elekes, A.: n points in the plane can determine ni unit circles. Combinatorica 4 (1984), 131. [15] Elliott, P.D.T.A.: On the number of circles determined by n points. Acta. Math. Hung. 18 (3 - 4) (1967), 181-188. [16] Erdos, P.: Nehdny geometriai problemdrol. Mat. Lapok 8 (1957), 86-92. [17] Erdos, P.: On the combinatorial problems which I would most like to see solved. Combinatorica 1 (1981), 25-42. [18] Jucovic, E.: Beitrag zur kombinatorischen Inzidenzgeometrie. Acta Math. Acad. Sci. Hung. 18(3-4) (1967), 255-259. [19] Jucovic, E.: Problem 24. Combinatorial structures and their applications, New York - London - Paris, Gordon and Breach, 1970. [20] Karteszi, F.: Intorno a punti allineati di certi reticoli circolari. Rend. Sem. Matem. Messina 9 (1964-65), 1-12. [21] Kelly, L. M.; Moser, W. 0. J.: On the number of ordinary lines determined by n points. Canad. J. of Math. 10 (1958), 210-219. [22] Koutsky, K.; Polak, V.: Pozndmka o postradatelnych bodech v uplnych sestavdch bodu a primek v rovine. Casopis pro pestovani matematiky 85 (1960), 60-69.
32
VOJTECH BALINT
[23] Klee, V.; Wagon, S.: Old and new unsolved problems in plane geometry and number theory. Math. Assoc. Amer., Washington, DC (1991). [24] Moser, W. 0. J.; Pach, J.: Research problems in discrete geometry: packing and covering DIMACS Technical Report, 1993. [25] Motzkin, T.: The lines and planes connecting the points of a finite set. Trans. Amer. Math. Soc. 70 (1951), 451-464. [26] Pach, J.; Pinchasi, R.: On the number of balanced lines. Discrete Cornput. Geom.25 (2001), no.4, 611-628. [27] Sylvester, J. J.: Mathematical question 11851. Educational Times 59 (1893), 98. E-mail address:
[email protected] ' ' V o j t e c h Balint"
LATTICE POINTS ON THE BOUNDARY OF THE INTEGER HULL
IMRE BARANY 1 Alfred Renyi Institute of Mathematics, Budapest PO. Box 127., Hungary, 1364 and University College London Gower Street, London, UK, WC1E 6BT KAROLY BOROCZKY, JR. 2 Alfred Renyi Institute of Mathematics, Budapest PO. Box 127., Hungary, 1364
ABSTRACT. Consider Pr = conv(rBd n Zd) where Bd is the unit ball of Rd. It is known that the number of vertices of Pr is of order r d ( d - 1 )/( d + 1 ). \Ve prove that, besides the vertices, the boundary of Pr contains many lattice points: their number is of order r rf ( rf - 1 )/( rf +i) 5 as well.
1. INTRODUCTION Define Pr = conv(rBd n 1d] where Bd is the unit ball of Rd. Pr is clearly a lattice polytope. It follows from (more general) results of Andrews, Konyagin and Sevastyanov, Schmidt (cf. [1], [8]), and [13]) that the number A;-dimensional faces, fk(Pr) of Pr satisfies fk(Pr) < Here, and in what follows, for functions f,g the notation /
Supported in part by OTKA T 032452 and OTKA T 029255 Supported in part by OTKA T 031984 and OTKA T 030012 33
34
BARANY AND BOROCZKY, JR.
It is proved in Barany and Larman [4] that the above inequality is sharp, apart from the implied constant:
Further, it is shown in [4] (see Remark 1 on page 173) that the number of lattice points on the boundary of PT is
• rd(d-i)/(d+i) ^ on the boundary of Pr that are not vertices of Pr. More formally, we have Theorem 1. \dPr f"l 1d\ - f0(Pr) > r <*(<*-i)/(<*+i). Actually, we will prove the following slightly stronger statement. Call a facet of Pr rich if it contains a lattice point in its relative interior. Theorem 2. The number of rich facets of Pr is > rd(d-i)/(d+i) ^ For d > 3 we first prove Theorem 2, which readily implies Theorem 1. The order is reversed for d = 2: we give a direct proof of Theorem 1. In addition, we show that Theorem 1 yields Theorem 2 in the planar case. We now describe the ideas of the proofs. Let F be a facet of Pr, with outer normal v — vp- We always choose v to be a primitive vector; that is, v G Z such that the greatest common divisor of its components is 1. We will denote by Pd the set of primitive vectors. So F lies in some lattice hyperplane H, orthogonal to -y, and the cap cut off from Bd by H is lattice point free. In case d > 3, the proof of Theorem 2 is based on the fact that for a positive fraction of the facets, the intersection H D Bd is "relatively large"; which forces F to contain at least one lattice point in its relative interior. Here we need an argument from discrepancy theory saying, roughly, that there are >> md~2 lattice points on the boundary of ^/rnBd (when m is an integer and d > 5). This argument cannot be used when d = 2, in which case we have a different and more geometric proof of Theorem 1. The paper is organized as follows. Section 2 contains the proof of Theorem 2 for d > 3 together with the statement of three auxiliary lemmas. They are provided in Sections 3, 4 and 5. The rest of the paper is devoted to the proof of Theorems 1 and 2 in the planar case. We will often make use of the following well-known fact. Fact Let f : [1, oo) —> R+ be a increasing (decreasing) function, and let k be a fixed integer. Ifpi,____vi- are distinct primitive vectors then ^T\ /(|p;|) is minimal (maximal) if and only if the set {pi, ...,£>&} consists of the k shortest primitive vectors.
LATTICE POINTS ON THE BOUNDARY
35
When evaluating certain sums we will apply the following well-known formula, see for instance [9]. Given t > —d,ifh tends to infinity then
\\v\\
where K^ is the volume of the unit d-ball and £(cf) = X^i ~ja (and ~ stands for asymptotic equality). 2. PROOF OF THEOREM 2 WHEN d > 3 We start by stating the auxiliary lemmas. Define first Rd(m}= |{u£P r f
:|H|
Lemma 3. For every d > 2 there exist c > 0 and SQ > 0 depending on d such that for any large T, at least EQ percent of all m with ^T < ^/m < T satisfy Rd(m) > cTd~2. Given v £ P^, we denote by L(v} the lattice VL D Zd, and by fj,(v] the covering radius of L(v). The latter is, by definition (see [11]), the smallest t > 0 such that tB -\- L(v} covers &ff L(v) where B is the unit ball in afTZ(v). Note that the determinant of L(v) is ||v||. Lemma 4. For every d > 2 and every e > 0 there exists c(e) > 0 such that for large enough T, the number o f v ^ F * 1 with \\v\\ < Td~~l and n(v] > c(e}T is at most We will use {x} to denote the rational part of x G R: {x} = x — [x\. Lemma 5. For every £ > 0 there exists a 6 > 0 such that for any a > 0 and for large S, among the m G Z with ^S < ^/m < S all but s percent satisfy
> 6. Proof of Theorem 2 for d > 3. The number of v G P^ satisfying \ Td~l < IHI < Td~l is ;> J1^-1) according to (1). By Lemma 4, very few of them have n(v] much larger than T. Combining this with Lemma 5 with S = Td~l yields the existence of positive CQ, c\ and 6 depending on d such that the following holds. For any a > 0 and for large T, there exist CoTd(d~l) primitive vectors v G Pd such that (i) \Td~l < IHKT^ 1 ; (ii) ji(v) < ClT; 0«) \
36
BARANY AND BOROCZKY, JR.
Proposition 6. Let B be a (d — 1) -dimensional unit ball (centered at the origin) of %RL(v}. If p > 3^(v), and x G aff L(v), then the polytope K = conv{(a; + pB) fl L(v}} contains a lattice point in its relative interior. Proof. By the definition of//, y-\- /J-(v)B contains a lattice point for every y € aff L(v). In particular, there is a z 6 L(v} fl (x + n(v}B}. So it suffices to show that x -f n(v}B C K since then z is in the relative inte rior of K . Assume a point from the boundary of x + n(v}B is not contained in A'. Then a (d — 2)-dimesional hyperplane separates it from A'. This hyperplane splits x + pB into two parts. By the choice of /), both parts contain a translated copy of n(v}B. Consequently, both parts contain a lattice point, even the one disjoint from A', a contradiction. So all boundary points of x + ^(v}B are in A", implying that x + n(v}B C K. n Choose ft > 0 so that
Set T — /3r~d+i and a — l/fid+l, and consider the vectors ^ i , . . . , VAT G F0', N > coT^"1), satisfying (i), (ii) and (iii). Let Hi be the lattice hyperplane farthest in direction of Vi intersecting rB. The equation for HI is xv{ = [r\\Vi\\\, and the cap cut off from rBd by Hi has depth hi = {r\\v% \}/ \\Vi\\. Then the radius of //, n rB is
3ClT > 3//(v t -). In view of Proposition 6, Fi — conv(7/z- n rB n Zd) is a facet of Pr that contains a lattice point in its interior, n 3. PROOF OF LEMMA 3 First we prove that # r f m 2 < T2d~2. It is clearly sufficient to verify that the number of pairs x = (#1, . . . , x^) and y = (j/i, . . . , ^d), x,y eZ,d such that a;? + . . . + xj = yj + . . . + yl
and |.r.-U?/,-j < T is -c y2ci-2_ Setting G; — z; — y^ and 64- = #; + yz-, the problem is translated into the question about the number of solutions of ab = 0 under the condition ||a||,||&|| < 2\/rfT where a = ( a i , . . . , a^) and
LATTICE POINTS ON THE BOUNDARY
37
b = (&i, . . . ,&d). Set R — 1\/dT. Routine estimations show that the number of solution is
=
E
E
\\a\\
1= E i=J
r>d
E
*
\\v\\
\\b\\
\^
n2d-2
>
|U,||-2 ^
f
~ 2d-2
T
,
proving what was promised. To finish the proof, we use a well-known version of the inequality between the arithmetic and quadratic means, which says the following: Assume a i , . . . , a n are non-negative numbers whose average is A and whose quadratic mean is Q. Then A2 < Q, moreover, if cA2 > Q for some c > 1, then at least n/(4c) of the az- satisfy a; > A/2. Now the number of integers m with ^T < T/m < T is approximately f T2. Thus the quadratic mean of the -R d (m) is < 7^-4 The number of primitive vectors v with T/2 < ||v|| < T is > Td, so the average of the Rd(m) is ^> Td~2. So the inequality just cited implies the lemma. D Remark: For d > 4, Lemma 3 is actually the consequence of the regular behavior of the number of lattice points on the spheres ^/mSd~l (see [6]). If d > 5 then R^(m) w y^ ~ holds for any m. Assume that d — 4. If ra is odd then number r^(m) of M 6 Z4 with ||u|| = -^/TO satisfies r4(m) = 8 Y^k\m kWe deduce that if m is odd then # 4 (m) > 4m. If d = 3 then ^(m) can be less than c- 0 even if m is chosen from some arithmetic sequence, so we need arguments as above. ______ J _ n
4. PROOF OF LEMMA 4 Given a (d— 1)- dimensional lattice L, its successive minima are denoted by A;(L) for i = 1, . . . , d— 1. Minkowski's second theorem says (see P.M. Gruber and C.G. Lekkerkerker [7], p. 124, Theorem 6, and also for the definition of the A,-(L)) that Ai(L) . . . A d _i(L) < 2 d ~ 1 det L. It is easy to see that /z(L) < Ai(L) H ----- h A d _!(L) <(d- l)A d _i(L). Since trivially Ai(L) < • • • < \
Ai(L) d ~V( L )< d e t L -
We are going to estimate the number of v € Pd such that ||-y|| < Td~l and /u(f) = n(L(v)) > uT where u will be specified later. (Recall that L(v) = VL n Zd.) Now (2) gives for L = L(v] that \i(L(v)) < cu^T wherp c depends only on d. This means that for such a v there is a u € L(v} with Hull <
BARANY AND BOROCZKY, JR.
38
It follows by (2) with L = L(u) that n(L(u}} < T (since clearly \i(L(u)) > 1). Thus the number of v G L(u) satisfying ||i;|| < Td~l is det(£(w))
|H|
'
This, in turn, shows by (1) that the total number of v 6 Td such that IMI < Td~l and u(v) > uT is
E So this is going to be less than eT if w is chosen large enough,
5. PROOF OF LEMMA 5 2
Proof: Set M = [\S ] and let TV be the largest integer such that M + TV is smaller than S2. Then lim^^oo N/M = 3. Define a by
where a /a is bounded from 0 and oo. As natural in this context, we use the notion of discrepancy. The discrepancy of the sequence .TI, . . . ,xyv with X[ € (0, 1] is, by definition, _
= sup o
TV
By a theorem of Erdos and Turan (see [12], Chap. 2 (2.42)), the discrepancy of the sequence xn — {yn} (n = 1, . . . , TV), satisfies 1 1 In TV + TV
[In AT]
N V^ e2nihyn
h=l
where C is an absolute constant. For 1 < h < In TV and 1 < t < TV, define f ( t ) = ahN*$&>VM + t. Setting yn = f ( n ) = a^fN'I^~^ \/W^n we see that {xn : n — 1, . . . , TV} is <j-i _ _ the same as the set of numbers {aS d+a \frri~} with m £ Z and 5/2 < -y/m < 5. We can apply now Theorem 2.7 from Chap. 1 of [12], stating that N
Consequently, Dyv tends to 0.
LATTICE POINTS ON THE BOUNDARY
39
6. RICH EDGES
In this section d = 2 and so Pr = conv(Z2 D rB2). We write Nr to denote fo(Pr) = fi(Pr), and hence Theorem 1 says that (3)
|<9PrnZ2|-7Vr>r2/3.
Now we start the long process of proving Theorem 1, or, what is the same, (3). Assume, on the contrary, that there is a sequence rn —>• oo such that \dPTn D Z2| - NTn = o(rn' ). To have simpler writing we will say that along the sequence r = rn (4)
\dPrC]Z2\-Nr = o(r 2 / 3 ).
As Nr w r 2 / 3 (see [2]), (4) means that all but a very small fraction of <9P,.nZ2 are vertices of Pr . Set now A(r) — Area(r5 2 \F r ). Using Pick's theorem and the error term in the circle problem [6] we get Area Pr = r2* - A(r) = \Pr n Z2| -
\dPr n Z2| - 1
Thus (4) says that, along the sequence r = rn, (5)
Nr = 2A(r) + o(r 2 / 3 ).
Jarnik's theorem [10] gives Nr < v/2?r(l + o(l))r 2 / 3 < 5.536r2/3. Pr is an inscribed (in rB2) polygon on Nr vertices so it cannot approximate rB2 too well: according to the well-known estimate (see [5] for instance) 2?r3
2
These inequalities do not contradict (5). We will show that, under condition (4) and along the sequence rn (6)
Nr < 5.1803r2/3, and
(7)
A(r) > 2.6744r2/3.
This suffices to contradict (5). The improvement comes from considering short edges of Pr . At this point we have to introduce some notation. Write P = P2 for the set of primitive vectors from Z2 and let p € P. The line with equation px = \\p\\r is tangent to rB2. Define a = a(p) as the fractional part of \\p\\r, that is a(p) = {\\p\\r}. Let Lk(p) denote the lattice line with equation px = \\p\\r — a — k + 1 (k = 1,2,...). Clearly, max (pa: : x £ Pr} is reached on one of these lattice lines and is reached on a segment [a, b] (a, 6 £ Z2) where
BARANY AND BOROCZKY, JR.
40
b - a = X(p)p-L with \(p) 6 {0,1,2,...}. Here pL is the rotated (by 90°, counterclockwise) copy of p. Of course, a = b is possible and then \(p] — 0. We will write Ck(p) for the chord Lk(p) fl rB2. Its length is (8)
\Ck(p)\
2r-
=
k + a — 1\ k + a — I
INI
IN
1bii
=
2r|N|
9 2
as r —>• CXD and fc is bounded, (fc will be 1 or 2 in most cases).
M L2(p)
/ Figure 1 For t > —2, formula (1) states that if h —* oo then
y. in1 = -^(i+
o)
P6IP \\P\\
With the notation just introduced ^ P eP^(^) ~ |^-fVHZ 2 |, and^]p6F x(P)>i Nr. Thus (4) is equivalent to saying that, along the sequence rn
(10)
1=
Define Er = {p G P : \(p) > 2}: this is the set of directions of rich edges. Clearly, by (10), \Er\<
Set p = -y/r/10, Bp = pB2, and
= E A(p) - E l = °(
LATTICE POINTS ON THE BOUNDARY
41
This is the set of "short" minus "rich" directions. It follows from (9) and (11) that, along the sequence rn, \ 2/3
7. DIGRESSION: PROOF OF THEOREM 2 We show now, with a short digression, how (3) implies Theorem 2 in case d = 2. So we want to prove that \Er\ ~^> r 2 / 3 . Assume the contrary: \Er\ = £r 2 / 3 for some e(r) tending to zero (along a sequence rn}. Let [a, b] C Ck(p] be the edge corresponding to p € Er. Then k < 2 as otherwise \Ck-\(p)\ > ||p|| and then Ck-i(p) would contain a lattice point and [a,b] cannot be an edge of Pr. So (12)
AWIbll < Mp)| < 2^^11
=
and A(p) < 4Vf|H|- 32 . Define h by |Pn /i52| = \Er\ = er2/3, so h We can now use the Fact:
4^
+ o(l)) by (9). M-3/2
II
I T7I I
- I-CT!
-(l + o(l))/.1/2 - er 2 / 3 < 7T
This indeed implies (4), or (10) via (11). E We remark that for p £ Er (12) gives the estimate A(p) < 4VF||p||-3/2.
(13)
8. AUXILIARY LEMMAS We need a few simple geometric facts. Lemma 7. Along the sequence rn £
A(p)||p|| = o(r).
Proof. Using (12) and the Fact with \Er\ = £r 2 / 3 (from (11)) we get £
A(p)|b|| < 4VF £
Ibir 1 / 2 < const £ 3 / 4 r. D
Lemma 8. For all p £ Sr, Oi(p) < 1/8.
42
BARANY AND BOROCZKY, JR.
Proof. If the chord C\(p] is longer than 3||p||, then it contains at least 3 integers and p £ 5*7-. Consequently, for p 6 5V, 3||p|| > |Ci(p)| = pi implying C ? . M! . __!_ < £ . J__L_ < I.
n
Lemma 9. For all p G 5*,-, C*i(j?) contains an integer. Proof. Let *||p|| = |C2(p)| = 22r 8r(a
+
l)^ A V
-
-
±. Then
« +n>4/8.10f1_l|> *+M 4r 4r||p||;
So if C\(p) n Z2 = 0, then C^p) contains an edge of Pr with A(p) > 6 and
pi Sr. a Lemma 10. If p,q € 5V and p ^ q, then C
since a < 1/8. Similarly for ^. The area of the parallelogram 0, p, q, p + q is at least one, so 1 < ||p|| • \\q\\ -sin 7 where 7 is the angle between p and 9. We want to show that
z^M
H -- --
2v^M
< ————— < sm 7
INI-lkll"
where the inequality in the middle is equivalent to
This follows from |b||,||g|| < p - {/r/10. n Lemma 11. For all p 6 ST, C2(p) n ^Pr C Z2. Proof. By Lemma 10 the edge (or vertex) [a, b] corresponding to p 6 Sr is contained in C\(p}. Let c be the integer on dPr immediately after b in anticlockwise order. Then c <E Lk(p) for some fc > 1. We will show k — 1. There are two cases.
LATTICE POINTS ON THE BOUNDARY
43
Case 2
Case 1 Figure 2
Case 1. k is odd, k = It + 1 (I > 1). Set x = \(b + c] and let &', x', c' denote the last points on the chords d(p] (i - 1, t + 1, It + 1). As x ± |p 6 Z2, |x' — x| < ^||p|| must hold. Then, a fortiori,
1
> \x'-x\ >
It is easy to see geometrically that the last expression is minimal on the interval a 6 [0,1/8] at a = 1/8, and when a = 1/8, it is minimal for t > 1 if I = 1. Now with a = 1/8 and t = 1
1 ey I \lr\ I
^
But this contradicts
l/\/10 < 0.3163.
Case 2. k is even, k = 21 and £ > 2. Write x (resp. y) for the intersection of the segment [6, c] with CV(p), CV+i(p). The same way as above and with analogous notation \xf — x\ + \y' — y\ < \\p\\ as otherwise either [x',x] or [y',y] would contain an integer. Thus
\\p\\
x -x
\y' -y\> \Ce+l(p)\ + \Ct(p)\ -
- C2i(p}\.
The right hand side is the smallest when a = 1/8, again, and then when t = 2. A contradiction follows after a short computation. D According to Lemmas 10 and 12, Ci(p) n dPr = {c,d} C Z2 for every p € Sr. Assume c, 6, a, d come in this order on dPr. Define T(p] = {[d,o],[o,6],[6 >C ]} and Tr =
T(p).
BARANY AND BOROCZKY, JR.
44
By Lemma 10, T(p) and T(q) are disjoint for distinct p, q G Sr. The boundary of Pr consists of three parts: the first contains the segments in Tr, the second the edges corresponding to p G Er, and the third is the rest. This last group consists of edges [a t -,6j] corresponding to ,- £ P (i — l,...,m) where bi — ai = qf- and qi\\ > p. While the first and second group may have some overlap they are both disjoint from the third.
Figure 3
Lemma 12. For large r (along the sequence rn) 3.8671r
4.2602r.
Proof. The perimeter of Pr is 2r?r( 1+0(1)) and the second group contributes o(r) to it (in view of Lemma 8). So it suffices to estimate ^"L^ \x\\. It is not hard to see that, for p E 5V,
because a < 1/8. Then, by (9),
24 / i —7= ( 1 + - 1 r < 2.4158r. TTx/TO V r
This proves the lower bound. For the upper bound notice that when p £ Sr \d-a\
-c| > \C2(p) C\ Pr\ > \C2(p)\ - 2\\p\\
LATTICE POINTS ON THE BOUNDARY
Thus
45
^ E l(p^ = E l(p^ - E ^
The Fact shows the second sum that it is o(r). So, again by (9), —= ) (1 + o(l))r > 2.0228r. D V5 57T/
9. PROOF OF (6) AND (7) Next we prove (6). The number of edges (or segments) in the first group is at most o 18 / r \ 2 /3 o/o 315VI < 3|Pn/>5 2 | < — ( —] (l + o(l)) < 1.2345r2/3. \10/
7T
The contribution of the second group is o(r 2 / 3 ). Finally, in the third group, m
Ell;||<4.2602r i and the qi are distinct primitive vectors with \\qi\\ > p. Under these conditions m is maximal if the g,- are as short as possible. So choose the smallest p satisfying m < |Pn (pB2\pB2}\. Then = i(p 3 -/> 3 )(l + o(l)).
We get p < \/3A46Qr showing that m < \Tr](pB2\pB2)\ = -(p2 - p2)(l + o(l)) < 3.9458r2/3, 7T
proving (6). Finally we prove (7). Given [i^v] C rB2, the missed area, A( / u,v), beyond this segment is defined as A(u, v) = Areajx e rB2 : [0, x] D [M, v] ^ 0}. It is easy to see that ,
where w, v are close to the boundary of rB2 and M, v are almost orthogonal to 11 — v. For p 6 Sr let [d',c'] = C*2(p) with dr, d, c, c' in this order. It is easy to see (we omit the proof) that A(d',a) < A(d,a) and A(6,c') < A(b, c). Then
46
BARANY AND BOROCZKY, JR.
the missed area beyond the chord C2(p) is
A(d, a) + A(a, b) + A(6, c) > A(d', a] + A(a, 6) + A(6, c') >
where o(l) is uniform in p. Summing this for all p £ 5V shows that the missed area beyond the segments in Tr is 2 3 2 3 ^ z_-/ L ( p , r ) = V L(p,r) - o(r / ) > 2.2478r / HP||
The sum is minimal, under the condition that the ; are distinct primitive vectors with \\qi\\ > p and ^ | qi\ > 3.8671r, if the qi are as short as possible. The by now routine computation reveals that m 3
> 0.4267r 2 / 3 . D
Remark. This proof gives a very small value for the implied constants in Theorems 4 and 5. Computational experience (and [3] as well) shows Nr w 3.45r 2 / 3 and \dPr n Z2| w 12r2/3.
REFERENCES [1] G.E. Andrews: A lower bound for the volumes of strictly convex bodies with many boundary points, Trans. Amer. Math. 5oc., 106 (1965), 270273. [2] A. Balog and I. Barany: On the convex hull of the integer points in a disk, DIMACS Series in Discrete Math., 6 (1991), 39-44. [3] A. Balog and J.-M. Deshouliiers: On some convex lattice polytopes, Number theory in progress, Vol. 2 (Zakopane-Koscielisko, 1997), 591606, de Gruyter, Berlin, 1999. [4] I. Barany and D. Larman: The convex hull of the integer points in a large ball, Math. Annalen, 312 (1998), 167-181. [5] L. Fejes Toth: Lagerungen in der Ebene, auf dem Kugel und im Raum, Springer, Berlin (1953). [6] E. Grosswald: Representation of integers as sums of squares, Springer, 1985.
LATTICE POINTS ON THE BOUNDARY
47
[7] P.M. Gruber and C.G. Lekkerkerker: Geometry of Numbers, North Holland, Amsterdam (1987). [8] S. B. Konyagin and K. A. Sevastyanov: Estimation of the number of vertices of a convex integral polyhedron in terms of its volume, Funk. Anal. PriL, 18 (1984), no. 1, 13-15. (in Russian) [9] G.H. Hardy and E.M. Wright: Introduction to the theory of numbers, Oxford, Clarendon (1954). [10] V. Jarnik: Uber Gitterpunkte und konvex Kurven, Math. Z., 24 (1925) 500-518. [11] R. Kannan and L. Lovasz: Covering minima and lattice point free bodies, Annals. Math., 128 (1988) 577-602. [12] L. Kuipers and H. Niederreiter: Uniform Distribution of Sequences, New York, 1974. [13] W. Schmidt: Integral points on surfaces and curves, Monats. Math., 99 (1985) 45-82. E-mail address: [email protected] ''Imre Barany'' E-mail address: carlosfirenyi.hu ''Karoly Boroczky,
Jr.''
THE ERDOS-SZEKERES PROBLEM FOR PLANAR POINTS IN ARBITRARY POSITION
TIBOR BISZTRICZKY1 Department of Mathematics and Statistics, University of Calgary, Calgary, AB, Canada, T2N 1N4 GABOR FEJES TOTH2 Alfred Renyi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary, H-1053
ABSTRACT. Let A; and / be integers 2 < k < I. We consider the ErdosSzekeres convex n-gon problem for sets S of points in the plane with the property that the convex hull of any k points of S contains at most / points of S.
1. INTRODUCTION Recall the classical theorem of Erdos and Szekeres [2] according to which, for every natural number n > 4, any set of points in general position in the plane with sufficiently large cardinality contains some n points in convex position. A set of points in the plane is in general position if no three points of the set are on a line, and it is in convex position if no element of it is contained in the convex hull of the rest of the points. Let Pn denote the property that a set does not contain any n points in convex position. Another way of formulating the theorem of Erdos and Szekeres is that the cardinality \S\ of a set S of points in general position in the plane satisfying property Pn is bounded. Let f(ri) denote the maximum cardinality of such a set. 1
Supported in paxt by NSERC Operating grant. Part of this research was done while the author was visiting at Western Washington University in Bellingham, WA. Research was also supported by OTKA Grants no. 26358 and 30012. 2
49
50
BISZTRICZKY AND FEJES TOTH
Erdos and Szekeres showed that
The upper bound has been improved recently in a series of papers by Chung and Graham [1], Kleitman and Pachter [7] and finally by Toth and Valtr [10] who established the presently best known upper bound, namely
There still remains a large gap between this bound and the lower bound 2 n ~ 2 , which is conjectured to be sharp for all n. The theorem of Erdos and Szekeres has been generalized in various directions (see [9] for an extensive survey on the subject). Here we give yet another generalization, the starting point of which is the following reformulation of the condition that the points are in general position. A set S in the plane is in general position if the convex hull of any two points from S contains just these two points of 5*. What happens if we weaken the premises in the theorem of Erdos and Szekeres and instead of requiring the points to be in general position, we assume only that the convex hull of any two points from S contains at most I points of 5, where I is some integer greater than two? More generally, for integers k and /, 2 < k < /, we consider sets S with the property 'Ptkj) that the convex hull of any k points from S contains not more than / points of S. The property that a set satisfies both Pn and P(k,i) is denoted by P2 ^ . Is the cardinality of a set of points in the plane with property P?k ^ bounded? As expected, the answer is yes. So it is legitimate to define //J. ^ as the maximum cardinality of a set with property P?k ^. Of course, we have /(n) = /," 2y We shall give upper and lower bounds for f?k ^, some of which turn out to be surprisingly strong. Obviously, //],. n = I for n < k + 1, so we deal only with the case n > k + 1. We need to introduce additional notation in order to formulate some of our bounds. For /, i, j > 2, we define the numbers 9 l ( i i j ) recursively as follows: (1)
0(2,j)=sitt,2) = l
(
(2)
if j is odd,
;2 +1
if j is even,
0i(3,j)=00',3) = < [
(3)
fc^
J>*
9i(i,J)=9i(i-l,J)+9i(iJ-l)
for *, j > 3.
Now we are in the position to formulate our main result.
THE ERDOS-SZEKERES PROBLEM
51
Theorem. We have n
(4)
(5)
£]fl(t,n + 2 - i) < /(»2>0 < 0,(n - l,n) + 1
/(» jZ) = n - 1 + J -
fc
/or 3 < fc < / <
/or / > 2, n > 3;
- 1, / < n;
and (6)
n _i
+ (n-
/or 3 < k < I and k + I < n.
We conjecture that the lower bound in (4) is sharp. It is easy to give the general term of the sequence g^ij}- We have
To see this we note that #2(2, j) = 1 = P'"^4) an^ #2(3, j) = j — I = Pt-2 4 )' that is the equation holds for i = 2 and i — 3. Recalling that (™) = (^i*) + (m~1} we see that also the recurrence relation (3) is satisfied by the numbers g z ( i , j ) = (J^!.^4)- We have
i-5N 1=2
i=
thus the bounds in (4) for //^ 2^ = /(n) are those of Erdos and Szekeres, and Toth and Valtr. We observe that l
-(j - 2) + 1 < 9l(3,j) < l-^(j
- 1),
j > 3.
Using these initial values instead of those given in (2), we get that 2\\ i-2 J for j > 3. Hence (/ + 2)2-4 -
i-3
< /(n2)0 <
-
«-3
s
+X
/«- ^ > 3, n > 3.
As an immediate consequence of (6), we get the following Corollary. If for the integers k, I, and n with 3 < k < I and n > k + 1, both |^5 and ^-^f are integers, then
52
BISZTRICZKY AND FEJES TOTH
We note that there is equality in (6) also when k = I, yielding that f?k k^ = n — 1 for k > 3. This case is covered by (5) as well. We recall the problem of Erdos asking whether sufficiently large cardinality of a set of points S in general position in the plane guarantees that S contains the vertices of an empty convex n-gon; that is n points in convex position such that their convex hull does not contain any other points of S. It turned out that the answer to this question is yes for n = 4 and 5 (see [4]) and no for n > 7 [5]. The problem remains undecided for n = 6. However, Karolyi, Pach and Toth in [6] showed that property 7^(3,4) and sufficiently large cardinality implies for any set that it contains an empty convex n-gon for any n. This result was extended by Valtr in [11] to any k < I.
2. UPPER BOUNDS FOR fjl ^ The upper bound in (4) is easily obtained through a slight modification of the original methods of Erdos and Szekeres [2]. We say that the points (xi, yi), (0:2,1/2), • • • ^ (xrm ym)i xi < X2 < • • • < xmi form an m-cap if
y-2 - yi <"y»o
JL,
—.
nr> -
*^ 1
Vm - ym-i
ya -3/2 T*o
**-' O
'T'o
**-> 2,
T*
^TTl
T*
i
*^77l— 1
Similarly, they form an m-cup if
y2 ~ yi
yi *c ... <, ym
ym—i .
A set of two points is a 2-cap and at the same time a 2- cup. We consider sets S in the plane satisfying property P(2,i) such that no line through two points from S is parallel to the x- or y-axis and, furthermore, S contains neither an ^-cap nor a j-cup. Let gi(i:j) be the maximum number of points in such a set. It is not a mistake that we denote these numbers with symbols already used in the introduction, as they are equal to those defined by the relations (1), (2), and (3). Erdos and Szekeres proved that the numbers defined here satisfy the recurrence relation (3) if / = 2; however, their argument applies without any modification for all / > 2. Obviously, if a set of points contains neither a 2-cap, nor a 2-cup, then it consists of a single point, so the initial value conditions (1) are satisfied. It remains to show that the initial value conditions (2) hold as well. Let S be a set satisfying property "P(2,n which contains neither a 3-cap nor a j-cup. Then all elements of S lie on the boundary of conv S. We claim that ( l-^fl
(7)
if j is odd,
\S\
j>3 ls even
>
THE ERDOS-SZEKERES PROBLEM
53
This holds obviously when 1 = 2. Next we investigate the case / = 3. Consider a set R of 2s + 1 points of S lying on s consecutive sides on the boundary of conv S with each side containing exactly one additional point of S in its relative interior. From R, we choose each second vertex and each point in the relative interior of a side. This gives t = ["^p"] + s points which, when arranged with increasing re-coordinates, form a t-cup. We observe that the ratio r^r is greater than or equal to | with equality only if s = 1, that is \R\=3. We consider the subsets Ri of S consisting of points in a maximal sequence of consecutive sides on the boundary of conv S each side containing an additional point of S in its relative interior. Each Ri contains a tj-cup, Ol 7? . I where ti > -^ unless \Ri\ = 3. These points, together with the remaining 9l 91 vertices of convS1 form a it-cup, where t > -L-1. Here strict inequality holds unless the sets Ri exhaust all vertices of conv S and each Ri contains exactly three points. 2| c| Since S contains no j-cup, we have -^-L < j - — 1, and consequently
151 ^^ 3(J ~ 1) PIS Equality can hold here only if |5| is a multiple of 3 and j is odd. If \S\ is ., 2|S - . even, then -^ < j — 1,-.1hence 2
Finally, we assume that I > 4. Let M be the set of sides of conv S containing at least two points of 5" in their relative interior and let V be the set of points of S which do not belong to a side from M. Then the sides belonging to M, together with the vertices from V, cover the set S. Since each side of conv 5 contains at most / points from S, it follows that
We observe that the set V satisfies property "P(2,3), so it contains a i-cup with t > -^-. We augment this set with |M| pairs of points chosen from the relative interior of the sides from M. The resulting set is a t'-cup with t' > -^ + 2|M|. Since S contains no j-cup, 3
As / > 4, it follows that ?-_i_21H J
\S\
^~
f ^^r1 + \V\<<
(, ^\ ' +1
if j is odd,
if j is even.
54
BISZTRICZKY AND FEJES TOTH
This completes the proof of (7). It is easily seen that this bound is sharp. This is obvious for 1 = 1. If / > 2, then the bound can be achieved if, with the possible exception of one point, all points of S lie on distinct segments, each containing I points. This shows that the numbers defined here indeed coincide with the ones defined by the relations (1), (2), and (3). Obviously, f(2,l)
<9l(nin}-
Using the idea of Toth and Valtr [10], we get that
For the proof of (5), we need the following generalization of Caratheodory's theorem. Lemma. Let S be a set of points in the plane and X a set of i > I points contained in conv 5. Then there is a subset SQ of S containing at most 2i points such that X C conv SoThe proof follows by induction on i. Let p\ and p% be two points in conv S. Let the line p\pi intersect the boundary of conv S in q\ and q%. Then there are points r\, r2, r3, and r\ of S on the boundary of conv 5 such that qi 6 conv{ri,r 2 } and 2 6 conv{r 3 ,r 4 }, hence {p\,p?} C conv {ri,r2,r 3 ,r 4 }. Thus the lemma holds for i = 2. Suppose that it holds for less than i points. Let pi, . . . ,p; be i > 2 points in conv S. By the inductive hypothesis, there are, not necessarily distinct, 2(i — 1) points r i , . . . , r 2 ^_ 2 of S such that {pi,... ,pi-i} C conv{ri,... ,r 2i _ 2 }. Let the ray pi-ipi intersect the boundary of conv S in qi. Then there are two points r^i-i and r^i of 5 the convex hull of which contains %. It follows that {pi,... ,pi} C conv{n,... ,r 2 i}. It is easily seen that the bound in the lemma is sharp: If S consists of the vertices of a convex n-gon with n > 2i and X is the set of the midpoints of i mutually disjoint closed sides of conv 5", then X is not contained in the convex hull of any 2i — 1 points from S. We note that the proof above carries over with obvious modifications to Ed yielding the following statement. // in Ed a set X of i points is contained in the convex hull of a set S, then there is a subset SQ of S containing at most di points such that X C conv SQ. The bound di cannot be replaced by a smaller one. We prove (5) for the case 4 < k < I < [^jf-\ — 1. As we noted above, the case k = /, including the case k = I = 3, is covered also by (6) and will be treated there. Let 4 < k < I < [4£J — 1, I < n and consider a set S of n + I — k points in the plane satisfying property P(k,i)- We note that then S also satisfies
THE ERDOS-SZEKERES PROBLEM
55
property P(kij_f~+k') f°r all k', 2 < k' < k. We have to show that 5 contains n points in convex position. Suppose the contrary. Then, in particular, conv 5 has at most n — I vertices. Therefore, we can pick / — k + 1 points of S which are not vertices of conv S. According the lemma, there are 1(1 — k + 1) points among the vertices of conv 5, the convex hull of which contains these points. Thus 5 does not satisfy property P(2(i-k+i),3(i-k+i))Since 3(/ - k + 1) - 1 - 2(1 - k + 1) = I - k and in view of / < [f J - 1 we have 2(1 — k + 1) < fc, this contradicts our assumption. Thus S does contain some n points in convex position. This shows that / J^ ^ < n — I +1 — k. The example showing that the bound in the lemma is sharp shows that this bound is sharp, as well. Finally, we turn to the proof of the upper bound in (6). Let 3 < k < /, n > k + 1 and let S be a set of points in the plane satisfying property P?k ». Let m be the number of vertices of conv S. Then m < n — I. If m < A;, then 5 has at most / elements which is, for n > k+1, smaller than the upper bound in (6). If m > k, then we decompose conv S into a maximum number of kgons and possibly one convex polygon with less than k vertices. It is easily seen that such a decomposition contains [^zf 1 polygons. Each polygon in this decomposition can contain at most / — A; points from 5" different from its vertices. Thus S contains at most m + (I — k) C^rrf ] < n — 1 + (I — k) [frf 1 points. 3. LOWER BOUNDS FOR f?k » The proof of the lower bound in (4) also follows the original ideas of Erdos and Szekeres [3]. There is a very transparent description of the construction of Erdos and Szekeres in the book of Lovasz [8]. We shall follow the description there. Consider a regular 4(n — 2)-gon inscribed in a circle of radius r centered at the origin. Let v % , . . . :vn be the vertices of it lying in the region: x > 0 and \y\ < re, enumerated in counter-clockwise direction. We note that any line ViVj, 2 < i < j < n, forms an angle greater than 45° with the re-axis. It follows that if r is sufficiently large, then the unit circular discs Ci centered at Vi, 2 < i < n, have the property that any line Pipj, Pi 6 (7j, PJ 6 (7j, 2 < i < 3' < n, forms an angle greater than 45° with the re-axis. We place a set Si of gi(i,n + 2 — i) points into Ci such that it satisfies property P(2,i) such that 5Z- contains neither an i-cap nor a (n + 2 — z)-cup. We assume that no line through two points from Si is parallel to the re-axis and, furthermore, that any line through two points of Si forms an angle smaller than 45° with the re-axis. Clearly, the last condition can be achieved by applying a suitable affinity. We claim that the set 5 = Uf_ 2 5j with Sr=29i(i>n + 2 — i) points satisfies property P?2z^.
56
BISZTRICZKY AND FEJES TOTH
It is clear from the construction that a line connecting two points of S belonging to different sets Si and Sj can contain no further points of S. Since each of the sets <%, 2 < i < j < n, satisfies property P (2,1)1 it follows that so does S. Let S be a subset of S in convex position. We have to show that S contains at most n points. Consider first the case that S is contained in one of the sets Si, 2 < i < n. Let p\ and q\ be the points of S with the least and largest re-coordinate, respectively. Let ^2, • • • ,pj and q^-, • • • ,qk be the points of S above and below the linep\q\, respectively. Then the pointspi^pi, • • • ,Pji
THE ERDOS-SZEKERES PROBLEM
57
FIGURE 1 We note that for any natural number i property T^s+i) implies P(k,k+(k-2)i)Indeed, the convex hull of any A; points from a set S can be decomposed into at most k — 2 triangles. If 5 satisfies property T-^a+j), then each of these triangles contains at most i points of S different from its vertices. Thus, the total number of points of 5" contained in the convex hull of k points is at most k + (k — 2)i. Using the observation above, the general case of the lower bound in (6) follows by constructing a set of n— l + (n— 3) j^ points satisfying property
REFERENCES [1] Chung, F.R.K. and Graham, R.L., Forced convex n-gons in the plane, Discrete Comput. Geom., 19 (1998), 367-371. [2] Erdos, P. and Szekeres, G., A combinatorial problem in geometry, Compositio Mathematica, 2 (1935), 463-470. [3] Erdos, P. and Szekeres, G., On some extremum problems in elementary geometry, Annales Universitatis Scienciarum Budapestiensis, Eotvos, Sectio Maihematica, 3-4 (1960-61), 53-62. [4] Harborth, H., Konvexe Fiinfecke in ebenen Punktmengen, Elem. Math. 33 (1978), 116-118.
58
BISZTRICZKY AND FEJES TOTH
[5] Horton, J.D., Sets with no empty convex 7-gons, Canad. Math. Bull. 26 (1983), 482-484. [6] Karolyi, Gy., Pach, J. and Toth, G., A modular version of the ErdosSzekeres theorem, Studio, Sci. Math. Hungar., 38 (2001), 245-259. [7] Kleitman, D.J. and Pachter L., Finding convex sets among points in the plane, Discrete Comput. Geom., 19 (1998), 457-459. [8] Lovasz, L., Combinatorial problems and exercises, North-Holland, 1979. [9] Morris, W. and Soltan V., The Erdos-Szekeres problem on points in convex position—a survey. Bull. Amer. Math. Soc. (N.S.), 37 (2000), 437-458. [10] Toth, G. and Valtr, P., Note on the Erdos-Szekeres theorem, Discrete Comput. Geom., 19 (1998), 457-459. [11] Valtr, P., A sufficient condition for the existence of large empty convex polygons, Discrete Comput. Geom., to appear. E-mail address: E-mail address:
gfejesOrenyi.hu ''Gabor Fejes T o t h ' ' [email protected] ''Tibor Bisztriczky''
SEPARATION IN TOTALLY-SEWN 4-POLYTOPES
TIBOR BISZTRICZKY Department of Mathematics and Statistics, University of Calgary, Calgary, AB, Canada, T2N 1N4 DEBORAH OLIVEROS Department of Mathematics and Statistics, University of Calgary, Calgary, AB, Canada, T2N 1N4
ABSTRACT. For a totally-sewn neighbourly 4-polytope P, we examine the problem of determining a minimal set Ti. of hyperplanes with the property that for any facet F of P, there is an H 6 H that strictly separates F from a fixed interior point of P. I. INTRODUCTION Let O be an interior point of a convex o?-polytope P C Ed. The Separation Problem is to determine the smallest number s(O,P) of hyperplanes of Ed that are needed to strictly separate any facet of P from O. The importance of the Problem is partly due to the fact that if O is the origin of Ed then s(O,P) is the Gohberg-Markus-Hadwiger covering number for the polar of P; cf. [2] and [6]. In [3] and [4], the Problem was solved in the case that P is cyclic. In [5] and [7], partial solutions were presented in the case that P is neighbourly and four-dimensional. Specifically, it was shown that s(O,P) < 9 in the case that P is a particular type of totally-sewn neighbourly 4-polytope, called semi-cyclic (see definition in Section 2). An edge E of a neighbourly 4-polytope P C E4 with n vertices is universal if the quotient polytope P/E has n—2 vertices. Since P/E is a plane polygon, it follows that E is contained in n — 1 facets, of P. say, PI,P2,... , Pn-2- For any of these P^, there is a point x G E4 with the property that it is beneath each facet P of P (P is a facet of conv(P U {x}}} with the exception of 59
60
BISZTRICZKY AND OLIVEROS
the other n — 3 Pj's, and it is beyond each of those (Fj is not a facet of conv(P U { x } ) } . The polytope P — conv(P U {x}} is again neighbourly and it is said to be obtained by sewing x onto P. If P has u universal edges then there are u(n — 2)P's obtained from P by sewing. If P itself is obtained from a 4-simplex by a series of sewings then we say that P is totally-sewn. If P is cyclic or semi-cyclic then P is totally-sewn. In case of the former (latter), exactly one (n — 2) of the u(n — 2)P's is again cyclic (semi-cyclic). Both a cyclic and a semi-cyclic P is obtained from a 4-simplex by sewings via the same set of universal edges, and so a cyclic 4-polytope is also semi-cyclic. In the following, we show that the vertices of a semi-cyclic P determine certain special pencils of hyperplanes (Theorem 3). Next, the existence of these special pencils allow us to bound from above s(0,P) for each of the u(n — 2)P's (Theorem 4). Finally, we determine which of the u(n — 2) sewings preserve the special pencils (Theorem 5). Specifically, there are at least two such sewings via any universal edge that has a common vertex with an other universal edge. In summary, we establish that s(O,P) < 9 for a class of totally-sewn 4polytopes P that, for the first time, includes polytopes for which there is no explicit description of the facial structure. A solution for all totally-sewn 4-polytopes P will likely require a positive answer to the following: Is each P a subpolytope of a P sewn as above?
2. SEPARATION PROPERTIES We restrict our attention to E4, and assume familiarity with cyclic and neighbourly polytopes (cf. [8] and [9]). As usual, the convex and affine hull of a set X of points is denoted, respectively, by conv(X) and aff(X). For sets X\,X-2,... , Xn and a point x, let [Xi,X 2 ,... ,Xn] = (X^Xz,...
conv(XlUX2(J---(JXn},
,X n ) = aff(Xi U X2 U • ..*„),
[*] = [{*}] and (*) = <{*}}. Henceforth, P denotes a convex neighbourly 4-polytope in J54 with the set V(P) of vertices, the set £(P) of edges, the set U(P] of universal edges and the set F(P) of facets. We recall that P is simplicial, [x,y] € £(P) for any x ^ y in V(P) and (cf. [10]) if |V(P)| > 7 and [x,y] € £(P) then (1) [x,y] € U(P) if, and only if, x and y lie on the same side of every hyperplane determined by a subset of V(P). Let P = [P, x] be obtained by sewing x onto P. Then for some E = [x, y] € U(P] and F = [E,z,w] e ^(P), x is beyond (beneath) each F € .F(P) that
SEPARATION IN TOTALLY-SEWN 4-POLYTOPES
61
is (is not) in
, P, P) =
We say that x is sewn through T(E, F, P), and note that V(P) = V(P) U{x} and (2)
where U°(P) = {E G U(P] \ E n F = 0 or |£n {z,w}l = 1}. If P is totally-sewn then P is totally-sewn, and we may assume that V(P) = {xi, X2, ... , xn}, Pi = [xi, £2, • • • , #i] and P;+i is obtained by sewing Xj + i onto Pi for « = 5, . . . , n — 1. If P = Pn is cyclic then Xj+i is sewn through .F([xi,Xi], [xi,Xi,X2,Xi_i],Pi), and if P is semi-cyclic then Xi+i is sewn through .F([xi,x.;],Pi,Pi) for some PJ G J~(Pi) that contains [xi,Xi], As noted above, we are interested in pencils of hyperplanes generated by the vertices of P. For mutually distinct XJ,XK and x^ and V(P), let
We determine first the connection between the facial structure of P and the arrangements of hyperplanes in H(P, Xj, xjt, Xi) and ?i(P, x^, x^, xm) depicted in Figure 1.
Lemma 1. Let Q = [xj,xk,X£,xu,xv,xw],
Q' = [xj,Xk,xi,xm,xu,xw]
and
1.1. If (A) then [xj,Xjfc,X£J and [xu,xv,xw] are not faces ofQ. 1.2. // (B) and [xk,xi] £ U(Q] then [xk,xt,xv] and [xj,xu,xw] are not faces ofQ. 1.3. If (C) and [xj,xm] €U(Q] then (D). Proof. We recall that [V(Q)j = 6 implies that Q is cyclic, and hence, three vertices of Q span a face if, and only if, the remaining three span one. In c?=e of (A). [xj,Xk,xg] is clearly not a face. In case of (B). [x'K.z".:,x.;] is a face for xr £ {xj,xu,xw}. Thus if [xfc,x^] ^ U{Q) then [xk,xi,xv] is not a face.
BISZTRICZKY AND OHVEROS
62
(B)
(D)
(C)
Figure 1 Assume (C) and that [xj,x m ] G U(Q}. Then [xj,x m ] E U(Q'}, and [xj,xm,xw] is a face of Q'. Hence, [xfc,X£,x u ] is a face of Q', and it follows by 1.2 that [xfc,X£J E U(Q'}. Then QY[xfc,x^] is a quadrilateral with the diagonals determined by {x/^x^x^Xu} and (xfc,X£,x m ,x w ). Thus, we need only to determine the position of xv in (D). We note that Q is also cyclic. Relabel its vertices so that Gale's Evenness Condition is satisfied by the vertex array c\ < c% < • • • < cj < c§ = GI . Then [cj,Cj + i] G U(Q] for i = 1,... , 7, and each 2-face of Q contains some [Ci,Cj + i].
Since [xj,x m ] G l^(Q}^ [xm^v^w] and [xmxv,xw] are not faces of Q and (xj,X)-,X£,xm} separates xv from xu and x^,, it is easy to check that the vertex array is Xm < Xj < xw < x^ < xv < xc. < z.u or x.,, < x.j < xw < x^ < xv < Xfc < xu. In either case, (x m ,Xfc,x^,X£) separates xu from Xj and xw. D
SEPARATION IN TOTALLY-SEWN 4-POLYTOPES
63
Let E — [x0,a;ft] £ U(P}- Lemma 1.3 states that H(P,xa,Xk,xi) completely determines 7Y(P,xj,,x^^xi). We simplify our notation by letting "H(P,E,Xk,xi) denote either one. The T-t(P,E,Xk,xe) that is of particular interest is the one depicted in Figure 2, and called a pentagram. We are assuming that V(P)\{xa,Xb,Xk,xt} is the disjoint union of (some possibly empty) clusters R, 5, T, U and V. We note that a cluster X is always on one side of (xa,Xk,X£,Xi) for any Xi £ X, and for simplicity, we denote X usually by a single x £ X. We say that P has the pentagram property if "H(P,E, Xk,Xi) is a pentagram for each E £ U(P] and all Xfc ^ x^ in V(P)\E. Clearly, if P has at most nine vertices then it has the pentagram property.
Figure 2 Lemma 2. Let E — [xc,Xd] £ M(P), P = [P,x] be obtained by sewing x through JF(£, F,P), E = [xa,xb] £ U(P] nU(P) and H(P,E,xk,xe) be a pentagram. ThenT-L(P,E,Xk-,xe] is a pentagram. Proof. Since E £ U(P], it follows that E ^ E and, say, xt, <£ {xc,Xd}. If [xa,Xk,xi] is a 2-face of P then there is at most one non-empty cluster of 1-i(P,xa,Xk,Xi) on each side of ( x a , X k , x i , X b ) , and the assertion is immediate. If [xa,Xk-,xe] is not a face of P then, say, xc is contained in one of the clusters of 7Y(P, xa,Xk-,Xi^Xb}. Since [x,xc] €&/(P), it follows from (1) that if, say, xc £ S1 then H(-P, 2;a5 ^fc, ^) is a pentagram with S = SU{x} replacing S. D As noted in the Introduction, Theorems 3, 4 and 5 are our key results, and each focuses on pentagrams. The proofs of Theorem 3 and 5 involve
BISZTRICZKY AND OLIVEROS
64
deducing the existence of new pentagrams from known ones, and are based upon the following simple observation: (3) // "H(P, [x a ,Xb],Xfc,x^) is a pentagram (cf. Figure 2) and xm 6 V(P) such that [x£,x m ] € U(P] then 7i(P, [x£,x m ],x a ,Xfc) is a pentagram whenever (x a ,Xfc,X£,x m ) supports R, 5, [7, V or T(J{xb}. Theorem 3. A semi-cyclic 4:-polytope has the pentagram property. Proof. We assume that P = [zi, # 2 , . . . , xn] C E4" is semi-cyclic with respect to the vertex array x\ < x<± < -. - < xn; that is, PQ — [xi,X2,... , zg] is cyclic with respect to x\ < X2 < • • • < zg, and for m = 6 , . . . , n — 1, Pm+i = [Pm, Xm+i] is obtained by sewing xm+1 through J^([xi, x m ],F m , Pm) for some Fm G ^(Pm) containing [xi,x m ]. Then (2) yields that {[xi,x n ], [x n ,x n _i]} C U(P) and U(P}\{[xi,xn}} C {[x m _i,x m ] | m = 2 , . . . ,n}. In [7], it was shown that for x\ < x& < x^ < xn, 7i(P, [xi,x n ],Xfe,X£) is the pentagram depicted in Figure 3 and with the following properties: (4) X; < xi for each Xi £ S U C/, (5) Xj > Xi for each Xj 6 T U V", and (6) if xr < xu and {x r ,x u } ts contained in T or V then (xi,Xfc,X£,x u ) separates xr and xn.
Figure 3 Let E 6 U(P] and xp ^ xg in V(P)\E. We may assume that n > 6 and that 7i(P n _i,£",Xp,x^) is a pentagram for any E' 6 U(Pn-i) and any x^ ^ x^ in V(Pn-i)\E'. Since the assertion is
SEPARATION IN TOTALLY-SEWN 4-POLYTOPES
65
immediate if E — [x\,xn] or [xp,xg] e M(P), we assume that E = [x m _i,x m ] for some 2 < m < n and [xp,x9] ^ ^(P)- Finally, we may assume that Xp "C. Xq.
Case 1. E — [x n _i,x n j. Then x\ < xp < xq < x n _2. If xp — x\ then the assertion follows from H(P,xn-i,xi,xq) = H(P,xi,xk,xt} with (a*,a:*) = (a; g ,a; n _i) in Figure 3. If xp ^ x\ then it follows from "H(P, x n ,Xfc,X£) with (x^x^) = (x p ,x g ), and the fact that (xfc,X£,x n ,x n _i) supports T or V by (6).
Case 1. E- [xm-i,xm] 6 U(Pn-\). Then we may assume by Lemma 2 that {xp,xq} (£ V(P n -i), and hence that xq = xn. Since we have assumed that [xp,x9] ^ £^(P), xp > x\. If xp < Xm-i then H(P,xm-i,xp,xn) = H(P,xn,xk,xi} with (xk,x£) = (x p ,x m _i) and (5) yield that, say, xm e T. By (6), {x m _i,x p ,x n ,x m } supports T and hence the assertion follows via (3). If xm < xp then H(P, xm, xp, xn) = H(P,xn,xk,xe) with (xk,xe) = (x m ,x p ) and (4) yield that S U U C Pp = [ x i , X 2 , . . . ,xp] and that, say, x m _i 6 S. We note that {[x m _i,x m ], [XI,X P ]} C U(Pp] and so, (x T O _i,x m ,xi,x p ) = (xi,Xk,xi,xm-i) supports S. Then (x n ,Xfc,x^,x m _i) = (x m ,x p ,x n , x m _i) supports 5, and the assertion follows. D Theorem 4. Let P = Pn C E4 be totally-sewn with |V(P)| = n > 6, s(P) = max{s(O',P) | O' G intP} < 9 and t/te pentagram property. Let P = [P, x] 6e obtained by sewing x onto P, and O e intP. T/ien s(O,P) < 9. Proo/. Let x be sewn through F(E*,F*,P] with P = [xa, xfc, yi, 2/2, • • • > yn-2, 2/n-i =yi], ^* =fca,a:&],[x a ,x 6 ,yi,y i+ i] e ^"(P) for i = 1,2,... , n - 2 and F* = [x a ,x b ,y n _ 2 ,yi]. Thus, with y\ := [xa,xb,yi]/£;*, P* = P/£* is an (n — 2)-gon with the cyclically labelled vertices y^y^, • • • ^Vn-2We refer to [4] and [7] for solutions to the Separation Problem in the cyclic and semi-cyclic cases, and note that we may assume that O E int P and that there exist l
BISZTRICZKY AND OLIVEROS
66
y\ Figure 4 From the sewing of x and (2), we have that x is beyond exactly [xa,Xb,yi,yi+i\ for i = 1,... ,n - 3 and {[x0,x], [x,x6]} C U(P). It is easy to check that F(P}\F(P} consists of [ x , x a , X b , y i ] , [x,x a ,Xfc,y n _2] and, [x,z a ,y;,y m ] and [x,x b ,^,y i+ i] for i = 1,... ,n - 3. Then with P* = P/[x,xa], P£ = P/[x,Xb] and the self-evident notation, the indicated positions of O* in Figure 5 follow from (11).
Figure 5 For the position of O in P, we use (7), (11) and the fact that 7i(P, [x0, xj,], Uk,yi) is a pentagram. We assume the worst case scenario that none of the
SEPARATION IN TOTALLY-SEWN 4-POLYTOPES
67
clusters R, S1, T, U and V of the pentagram are empty, and as a simplification, we represent R, S and T by single elements.
Figure 6 We verify that s(0,P) < 9 by determining nine hyperplanes HI, ... :Hg in E4 such that for any F e -F(P), there is an # e (#1,... , #9} such that O £ H and jff separates F and O. We note that either x € .F or F G ^(P), and if P e .F(P) then either F C Q or FH (17 U V] = 0 or F intersects both U U F and R U 5 U T. In the case that F contains x, we refer to Figure 5 and choose H 6 {#i,#2,#3,#4} with #1 = (x,xa,yk,yi), HI = (x,xb,yk,yi), H3 = (x,xa,xb,yk) and #4 = (x,xa,xb,yi). In the case that F G ^(P), we refer to Figure 6 and choose H = H$ = (xa,Xb,yk,yt) ifP C Q, andfT e {^1,^2} if Fn(C/"UF) = 0. Let P intersect both C^UV and RuSUT. Then 1.1 yields the choice of H € {^e, #7, #8, ^9} with Jf6 = (xa,yk,yi,y'v), H7 = (xa,yk,yi,y'u), H8 = (xbjyk,ye,yv) and HQ = (xb,yk,yi,yu). If some of the clusters are empty then some of the Hi are superfluous or identical. D Since s(Po) < 9 and Pn has the pentagram property for n < 9, it follows from Theorem 4 that s(Pio) < 9. Our final task is to determine which sewings (onto a Pg or a semi-cyclic Pn) preserve the pentagram property. The following example shows that not all sewings work. Let Pg be the 4-polytope ]V|3 described in [1]. Then U(Po) — {[xs,^], [379,2:4], [xsjXe], [x7,a*8]} and Pg is totally-sewn. Let P = [Pg,.^] be obtained by sewing x through ^"([2:3, x9], [x3, x9, x 6 ,077], Pg). Then E= [x3, x] e U(P) and it is a simple exercise to check that H(P,E,X5,xs] is not a pentagram.
68
BISZTRICZKY AND OLIVEROS
Theorem 5. Let P have the pentagram property, {[x0, X{,], [x&, xc]} C U(P], [x a ,Xb,x c ] C F G ^(P) andP = [P, x] 6e obtained by x through F([xa,Xb\,F, P) . Then P has the pentagram property. Proof. We recall W(P) from (2), choose an ?i(P,£',Xfc,x^) and note that we may assume that [xfc,X£,z] is not a 2-face of P for either vertex z of E1. Let E1 = [x,x a j. Then z = x and the preceding yield that x& ^ {x/^x^}, and so 7Y(P, [x a ,x b ],x f c ,X£) is a pentagram (cf. Figure 2). Since {[x,X(,], [xb,x c ]} C £/(P), it follows from (1) that neither x& and x, nor x& and xc, are separated by any H G H(P, xa,X]-,xg). Hence, either xc G T and (x a ,Xfc,X£,x) supports J RuS'UTU{xb} or x c G {xfc,X£J and 7i(P, x a ,Xfc,X£) has at most two non-empty clusters. In either case, 7i(P, E,Xk,xe) is a pentagram. Since ?i(P, [x a ,x],Xfc,X£) is a pentagram, it follows from [x, x^,] G W(P] that (3) is applicable. Hence, 7Y(P, [x,X{,],Xfc,X£) is a pentagram. Let E = [x u ,x v ] G U(P] HZY(P). By Lemma 2, we may assume that, say, Xfc = x. From above, we are assuming that [x u ,x, X(\ and [x v ,x,X£J are not 2-faces of P; that is, {xa,x;,} D {x u ,x u ,X£} = 0. Since H(P, [xu,xv],xa,X£), 7i(P, [x,x a ],x u ,X£) and ?i(P, [x, xa],xv,xe) are pentagrams, it is easy to check that 7Y(P, [x u ,x v ],x, X£J is one as well. D
REFERENCES [1] Altshuler, A. and Steinberg L., Neighborly 4-polytopes with 9 vertices, J. Combin. Theory Ser. A 15 (1973), 270-287. [2] Bezdek, K., The problem of illumination of a convex body by afnne subspaces, Mathematika 38 (1991), 362-375. [3] Bezdek, K., and Bisztriczky, T., Hadwiger's covering conjecture and low dimensional dual cyclic polytopes, Geom. Ded. 46 (1993), 276-286. [4] Bezdek, K., and Bisztriczky, T., A proof of Hadwiger's covering conjecture for dual cyclic polytopes, Geom. Ded. 68 (1997), 29-41. [5] Bisztriczky, T., Separation in neighbourly 4-polytopes, to appear. [6] Boltyanski, V., Martini, H., and Soltan, P.S., Excursions into combinatorial geometry, Springer, Berlin, 1997. [7] Finbow, W. and Oliveros, D., Separation in semi-cyclic 4-polytopes, to appear. [8] Grtinbaum, B., Convex polytopes, Interscience, New York, 1967. [9] Shemer, L, Neighborly polytopes, Israel J. Math. 43 (1982), 291-314. [10] Shemer, I., How many cyclic subpolytopes can a non-cyclic polytope have?, Israel J. Math. 49 (1984), 331-342. E-mail address: E-mail address:
[email protected]. ca '"Tiber Bisztriczky'' [email protected] ; 'Deborah Oliveros''
ON A CLASS OF EQUIFACETTED POLYTOPES
GERD BLIND Math. Institut B, University of Stuttgart, Pfaffenwaldring 57, D 70550 Stuttgart, Germany ROSWITHA BLIND Waldburgstr. 88, D 70563 Stuttgart, Germany
ABSTRACT. A convex d-polytope is called equifacetted if all its facets are combinatorially isomorphic. Let Bd be the class of those equifacetted dpolytopes where all the facets are isomorphic to the pyramid over the combinatorial (d — 2)-cube (d > 4). We determine the polytopes of Bd with minimal vertex number and we look for gaps in the vertex numbers of polytopes of Bd. It turns out that the situation is quite different for d = 4 and
I. INTRODUCTION A convex d-polytope is called equifacetted if all its facets are combinatorially isomorphic. Common examples are the simplicial and the cubical polytopes. Further classes of equifacetted polytopes (or of equifacetted spheres) have been constructed and studied under various aspects ( see e.g. [6], [7], [8], [9]). Let d > 4. We consider a class Bd of equifacetted d-polytopes "between" simplicial and cubcial polytopes, namely their facets are pyramids over combinatorial (d — 2)-cubes, so in the most interesting case d = 4, the facets are pyramids over quadrangles. Such polytopes are called b- equifacetted. Simple examples are the bipyramids over cubical (d — l)-polytopes. In dimension d = 4, further examples can be constructed as "degenerate bipyramids" as follows. Take as base. e.g.. the 3-polytope K of Figure 1, whose boundary complex is that of a cube with one 2-face divided into two triangles by an additional edge e. Let / be a segment such that I intersects 69
GERD BLIND AND ROSWITHA BLIND
70
the affine hull of K in a single point belonging to the relative interiors of both I and e, that is, / and e are diagonals of the quadrangle spanned by them. Then the convex hull of I and K is a 6-equifacetted polytope, which we call PQ. Note that the boundary complex of PQ is closely related to that of the bipyramid over the 3-cube: Their 1-skeletons are isomorphic, and their 2-skeletons only differ in the position of one quadrangular 2-face. An interesting problem for convex polytopes is as follows. Given a class Pd of convex d-polytopes, determine the minimal vertex number of all polytopes of Pd, and characterize the polytopes with minimal vertex number. Within the class of all polytopes, e. g., exactly the simplices have minimal vertex number, and within the class of cubical polytopes, exactly the combinatorial cube has minimal vertex number (see [I]}. In the following, combinatorially isomorphic polytopes are considered as equal. We have Theorem 1. A b-equifacetted 4-polytope has at least 10 vertices. There are precisely two b-equifacetted ^-polytopes with 10 vertices, namely the bipyramid over the 3-cube and the polytope PQ. Thus in contrast to the situation for simplicial and cubical polytopes, the minimal 5-equifacetted 4-polytope is not unique.
Figure 1: The polytopes K and L. Moreover, whereas gaps exist in the possible vertex numbers of cubical 4-polytopes, namely only even vertex numbers occur (see [2]), this is not
ON A CLASS OF EQUIFACETTED POLYTOPES
71
the case for 6-equifacetted 4-polytopes. In fact, such a polytope with 11 vertices can be constructed as a degenerate bipyramid over the 3-polytope L in Figure 1, and 6-equifacetted 4-polytopes with n vertices, n > 12, can also be constructed as bipyramids or degenerate bipyramids. However, for d > 5, the 6-equifacetted d-poly topes with few vertices strongly reflect the properties of cubical polytopes. Let Cd be the d-cube and let Td be the cubical polytope arising from pasting together two d-cubes along a common facet. For d > 4, within the class of cubical polytopes, exactly Cd has minimal vertex number and exactly Td has the next larger vertex number (see [3], [4] and [5]), and this is transfered to 6-equifacetted d-polytopes: Theorem 2. For d > 5, a b-equifacetted d-polytope has at least 2d~l + 2 vertices and is then the bipyramid over Cd~l. The next larger vertex number is 2d~l + 2d~2 + 2 and occurs only for the bipyramid over Td~l. The two theorems are proved separately. For the proof of Theorem 1, we must change boundary complexes of polytopes. Such changes, however, in general do not again yield a polytope. So we must pass to 6-equifacetted 3-spheres (see Section 2.1). In fact, we prove Theorem 1 for 6-equifacetted 3-spheres. Theorem Ib. A b-equifacetted 3-sphere has at least 10 vertices. There are precisely two b-equifacetted 3-spheres with 10 vertices, namely the boundary complex of the bipyramid over the 3-cube and the boundary complex of PQ.
2. PROOF OF THEOREM IB 2.1. Vertex figures and basic figures. We start with the definition of a 6-equifacetted 3-sphere. A topological pyramid over a quadrangle is the topological image of a pyramid over a quadrangle together with its faces. A finite family P of topological pyramids over a quadrangle is called a topological b-equifacetted complex if the following conditions of a complex are satisfied. (1) Each face of a member of P is itself a member of P. (2) The intersection of any two members of P is a face of each of them. As usual, a member of P is called a face of P, and a facet is a face of dimension 3. Notions using only the inclusion of faces are defined as for usual complexes, e.g., the valence of a vertex or the isomorphism of two complexes. We consider isomorphic complexes as equal.
72
GERD BLIND AND ROSWITHA BLIND
P is a b-equifacetted 3-sphere if in addition to (1) and (2) it satisfies (3) set P is a topological 3-sphere. Let v be a vertex of P. We define the vertex figure P/v of P at v as follows. As usual, let star v be the complex spanned py the facets of P containing v. By (3), set(star v) is a topological 3-ball, so that its boundary is a topological 2-sphere, which is divided up by its intersections with those faces of star v containing v. The resulting family of vertices, edges and 2-faces is a complex and is called the vertex figure P/v of P at v. The fact that P is 5-equifacetted has consequences on P/v. An edge of P/v either stems from a triangular or from a quadrangular face and in the latter case it is called a D-edge. The 2-faces of P/v are quadrangles and triangles, and the triangles fall into pairs with a common D-edge. Removing all the D-edges from P/v, we obtain a net B/v on the 2-sphere, which we call basic figure. It has the property (*) The 1-skeleton of B/v is a complex, and the 2-faces of B/v are quadrangles. In order to prove Theorem Ib, let P be a 6-equifacetted 3-sphere with at most 10 vertices. Let v be a vertex of P and let n be the valence of v, so that 4 < n < 9, and n is the vertex number of P/v and B/v.Then all the possible B/v and P/v are obtained as follows; the results are collected in Table I (In the diagrams of B/v, their base is also a 2-face of B/v. In the diagrams of P/v, their base is either a qudadrangular face of P/v or consists of two triangular faces with a common D-edge, which is indicated by a broken line. The other D-edges of P/v are marked by D.). Since P has at most 9 vertices apart from v, the number of D-edges of P/v is at most 9 — n. Thus for n — 9, the complex P/v has no D-edge and so all its faces are quadrangles, which is easily seen to be impossible. Thus the case n = 9 does not occur. Next, for each n (4 < n < 8) we determine all possible B/v. By Euler's theorem, the number of quadrangles of B/v is n — 2, and then it is easily seen that B/v has a 2-valent vertex for 4 < n < 1. For n = 4, B/v consists of two quadrangles and so is uniquely detemined. For n > 5, by property (*), B/v cannot have an edge with both vertices 2-valent. Thus, if B/v has a 2-valent vertex vj, removing w and the two incident edges yields again a net on the 2-sphere satisfying (*). So for n — 5, 6, and 7, all such nets and so all possible B/v can be constructed inductively. For n = 8, B/v could also have a 2-valent vertex, but the nets so obtained cannot occur as B/v, since each 2-valent vertex of B/v must lie in a D-edge of P/v, of which P/v has at most one. Thus for n = 8, all the vertices of L>IV are o-valent, which uniquely determines B/v.
ON A CLASS OF EQUIFACETTED POLYTOPES
3 <1> S?£ x *o g
«> H0
^ O ro ^ 'W
0)
8.
CD . o o>
i_
C
o> ro E ro CD 3 D -4c cr o
•° -n i
(U 0) £i en
Table 1: The possible basic figures B/v and vertex figures P/v.
73
74
GERD BLIND AND ROSWITHA BLIND
From all possible B/v we immediately get all possible P/v by adding Dedges - not more than indicated in Table 1 - in such a way that a complex arises. Note that each vertex w of P/v is also a vertex of P. Our next aim is to estimate for w its valence as a vertex of P. Comparing P/v with star v we see that the non n-edges of P/v are also edges of P, that w lies in an edge containing v, and that for every quadrangle of B/v containing w and divided by a D-edge of P/v there is one more edge of P containing w. In this way, the fat drawn vertices of P/v in Table 1 have valence at least 6, 7 or 8, respectively, as stated. 2.2. The case n — 8. We will prove Lemma 2.2. // P has an S-valent vertex, then P is as stated in Theorem 16. Proof. According to Table 1, there are two possibilities for the vertex figure P/v. In the left case, v is the apex of all the facets containing v, and star v contains 9 vertices. Since P has at most 10 vertices, all the facets of P not belonging to star v but containing a quadrangular 2-face of star v have a common apex. Thus P is isomorphic to the boundary complex of a bipyramid over the 3-cube. In the right case it is shown analogously that P is isomorphic to the boundary complex of PQ, which proves Lemma 2.2. D 2.3. The case n — 4. From now on we assume that P has minimal vertex number. Then we have Lemma 2.3. P has no ^.-valent vertex. Proof. Assume to the contrary that P has a 4-valent vertex v. Then Table 1 shows that the 1-skeleton of B/v is a quadrangle; we consecutively call its vertices 91,92,9s, 94- The shape of P/v shows that v lies in two quadrangular 2-faces, and we denote their vertices opposite to v by p\ respectively p2- Then these vertices pi, j>2,
ON A CLASS OF EQUIFACETTED POLYTOPES
75
their base contains both q\ and 93 or both q
2.4. The number of 7-valent vertices. By Lemmas 2.2 and 2.3, we may assume 5 < n < 7 for the valence n of each vertex of P. Thus in Table 1, that vertex figure containing an at least 8-valent vertex is not possible, and all the other fat drawn vertices have valence at most 7. Hence P has either no or at least two 7-valent vertices. Moreover Lemma 2.4. P has either no or at least four 7-valent vertices. Proof. Note that the facets of P fall into pairs with a common quadrangular 2-face. Removing these 2-faces, we may consider each such pair of facets as a topological octahedron. The list of all (remaining) possible P/v in Table 1 shows that a vertex of P is 7-valent if and only if it lies in an edge lying in precisely 4 such octahedrons. Thus if an edge of P lies in four octahedrons, then both its vertices are 7-valent, and since a 7-valent vertex lies in only one such edge, 7-valent vertices occur as pairs. For a 7-valent vertex v, the two possible P/v lead to two possible linked complexes link v o f v , see Figure 2; note that the basic face of these diagrams is a quadrangular face / of link v. Let pi and fi (i = 1,2) be vertices and 2-faces, respectively, as indicated in Figure 2.
Figure 2: The possible linked complexes of a 7-valent vertex.
76
GERD BLIND AND ROSWITHA BLIND
Now each fa and / is a base of two pyramidal facets, one with apex v, and the other with apex one of the 9 vertices of link v, namely p\ or p2, since P is a complex. By assumption, P has no 4-valent vertex, so the facet with base fi must have apexp^. It follows that pi or p2 is 7-valent. Thus if P has a 7-valent vertex, it has at least three of them and by the first part of the proof at least four. D
2.5. Completing the proof. As in the proof of Lemma 2.4, noticing that the facets of P fall into pairs with a common quadrangular 2-face, we may consider each such pair as a topological octahedron. Letting x be the number of such octahedra, we determine the number of incidences of vertices of P and octahedra. On the one hand, since an octahedron has 6 vertices, this number is 6x. On the other hand, note that the number of octahedra incident with an n-valent vertex v equals the number of 2-faces of -B/t>, which is n — 2 (see Table 1). Letting vn be the number of n-valent vertices of P (n = 5,6, 7), we thus have (1)
3^5 + 4t>6 + 5i>7 = 6x
Moreover, x is the number of quadrangular 2-faces of P. The list of all (remaining) possible P/v in Table I shows that every 6-valent vertex is the apex of at least one facet of P and every 7-valent vertex is the apex of precisely three facets. Hence (2)
w6 + 3w7 < 2x
According to Lemma 2.4 we now distinguish the cases ^7 = 0 and v? > 4. In case v-j = 0, Table 1 shows that the vertex figures of the 5- and 6-valent vertices are unique and have one respectively two quadrangular faces. Thus instead of (2) we have the equality (3)
v5 + 2v6 = 2x,
which together with (1) yields VQ = 0. So all the vertices of P are 5-valent, which is impossible because of the fat vertex of the corresponding vertex figure. In case v-j > 4, since for a 7-valent vertex v the complex star v has 10 vertices, P has precisely 10 vertices. Hence (4)
v5 + v& + v7 = 10
ON A CLASS OF EQUIFACETTED POLYTOPES
77
Subtracting (2) from (1) and taking into account (4) yields v-j < 30 — 4rr. Together with v-j > 4 this yields 4x < 26 or x < 6. On the other hand, because of (4) and v? > 4, the left side of (1) takes its minimum for vj = 4, VQ = 0 and ^5 = 6, so that 38 < 6x or x > 7, which is a contradiction, so that the case V7 > 4 is also not possible, which proves Theorem Ib.
3. PROOF OF THEOREM 2 Let d > 5, let P be a 6-equifacetted d-polytope and let mo := 2d~l +2 d ~ 2 . Assuming that P has at most mo + 2 vertices we must show that P is the bipyramid over Cd~l or Td~l. Let F be a facet of P and let v be the apex of F. Then v is also a vertex of P. It is easy to see that the facets of P containing v can be labelled F = Fi,...,Fk so that each F;,2 < i < k, has a common (d-2)-face with some Fj, j < i. In particular, the facets F — F\ and FI have a common (d-2)-face containing v, which as face of F is a pyramid with apex v over a (d-S)-cube, and because of d > 5 it follows that v is also the apex of F^. Iterating this argument shows that v is the apex of every Fj-,1 < i < k. Hence the linked complex link v of v is a cubical (d-2)-complex. Thus, by [3], [4] and [5], link v is either the boundary complex dCd~l of some Cd~l, or it is isomorphic to the boundary complex dTd~l of some Trf-1, or it has more than mo vertices. Let / be a (d — 2)-face of link v. Then / lies in two facets of dP, one with apex v and the other with some apex w ^ v. The above argument shows that link w is also a cubical (d — 2)-complex , and that w is not a vertex of link v and v is not a vertex of link w. Thus P has as vertices the vertices of link v and of link w;, which may partly coincide, and at least two additional vertices v and w. Moreover, if link v has a (d — 2)-face not belonging to link w, these arguments also show that then P must have even one more vertex. Since P is assumed to have at most mo + 2 vertices, it follows that both link v and link w have at most mo vertices and so are isomorphic to dCd~l or dTd~l. We first consider the case that link v is isomorphic to dTd~l and so has mo vertices. By the above, since P is assumed to have at most mo + 2 vertices, every (d — 2)-face of link v also belongs to link w, so that link v = link w, and P is the bipyramid over some Td~l, as claimed. It remains the case that link v is some dCd~l, and without loss of generality we may assume the same for link w. Thus link v spans a hyperplane Hv and the vertices of link v are the vertices of the polytope Hv fl P. In the same way, link w spans a hyperplane Hw and the vertices of link w are the vertices of the polytope Hw D P. Recall that link v and link w have
78
GERD BLIND AND ROSWITHA BLIND
a common (d — 2)-face /. Thus, if link v and link w have more common vertices than those of /, then Hv — Hw and P is the bipyramid over some Cd~l, as claimed. However, if link v and link w have only the vertices of / in common, then link v and link w together have mo vertices and, by the above, P has at least mo + 3 vertices, which contradicts our assumption on P.
4. REMARK It can be shown that all 6-equifacetted 3-spheres with 11 vertices arise from those with 10 vertices by a simple operation, namely the inverse operation to that used in the proof of Lemma 2.3
REFERENCES [1] G. Blind and R. Blind, Convex polytopes without triangular faces, Israel J. Math. 71 (1990), 129 - 134. [2] G. Blind and R. Blind , Gaps in the numbers of vertices of cubical polytopes I, Discrete Comput. Geom. 11 (1994), 351 - 356. [3] G. Blind and R. Blind, Cubical d-polytopes with few vertices for d > 4, Geom. Dedicata 65 (1997), 247 - 255. [4] G. Blind and R. Blind, Cubical 4-polytopes with few vertices, Geom. Dedicata 66 (1997), 223 - 231. [5] G. Blind and R. Blind, The almost simple cubical polytopes, Discrete Math. 184 (1998), 25 - 48. [6] J. Bokowski and P. Schuchert, Equifacetted 3-spheres as topes of nonpolytopal matroid polytopes, Discrete Comput. Geom. 13 (1995), 347 361. [7] J. Bokowski, On the construction of equifacetted 3-spheres. Invariant methods in discrete and computational geometry (Curagao, 1994), 301 - 312, Kluwer Acad. Publ. Dordrecht, 1995. [8] J. Bokowski, P. Cara and S. Mock, On a self dual 3-sphere of Peter McMullen, Discrete geometry and rigidity (Budapest 1999). Period. Math. Hungar. 39 (1999), 17 - 32. [9] M. A. Perles and G. C. Shephard, facets and nonfacets of convex polytopes, Acta Math. 119 (1967), 113 - 145. E-mail address: blindQmathematik.uni-stuttgart.de ''Gerd Blind'' E-mail address: Roswitha.Blind9spd-online.de ''Roswitha Blind''
CHESSBOARD RAMSEY NUMBERS
JENS-P. BODE Abteilung fur Diskrete Mathematik, Technische Universitat Braunschweig, 38023 Braunschweig, Germany HEIKO HARBORTH Abteilung fur Diskrete Mathematik, Technische Universitat Braunschweig, 38023 Braunschweig, Germany STEFAN KRAUSE Abteilung fur Mathematische Optimierung, Technische Universitat Braunschweig, 38023 Braunschweig, Germany
ABSTRACT. The chessboard Ramsey number r — r(G,H) is the minimum number r such that every two-coloring (green and red) of the sides of the squares of the rxr-chessboard contains a green G or a red H. The existence is possible only for G being a path P$ or P± and for H being a certain tree. The exact values of r(P 3 ,Pfc) and the values for r(P 3 ,#) and r(P±,H] for all small graphs H are determined and the existence of r(P±,Pk) is proved.
1. INTRODUCTION The n x n-chessboard Bn many times has been the object of problems in combinatorial geometry. Here we will consider the set of sides of the squares of Bn. Then we may ask, for example, for the largest n for which it is possible to remove vertex disjoint edges from Bn such that no path of given length remains. More general, we partition the set of all sides into two color classes and then ask for the existence of certain monochromatic configurations. If Bn is interpreted as the graph Bn with the vertex points of the squares as vertices, and with the sides as edges then we will ask for the minimum number r = r(G,H] such that every two-coloring (green and red) of the edges of BT contains a given subgraph G in green or a given subgraph H in red. That is, we ask for a Ramsey like number where instead of the complete graphs Kn the chessboard graphs Bn serve as 'host graphs'. In 79
BODE, HARBORTH, AND KRAUSE
80
the literature, besides the classical case of Kn [4], for example, complete bipartite graphs [1], cube graphs [2] and octahedron graphs [3] are discussed as other sequences of host graphs.
2. EXISTENCE For the existence of r(G,H) it is sufficient to consider connected graphs G and H, both having at least two edges. A coloring of Bn is called critical if it neither contains a green G nor a red H. In Figures 1 to 4 critical colorings are shown, which can be extended to Bn in general. The chessboard Ramsey number r(P3,Cfc) does not exist, where Pi denotes a path with i vertices and Cj a cycle of length j. If k is odd, Bn does not contain Ck- Otherwise, if k = 2a -f 2 then we have the following critical colorings of Bn. All vertical edges are colored red. In every row the horizontal edges are alternating green and red such that in the columns always exactly a consecutive edges are of the same color (see Figure 1 for n — 5 and a — 2). In this coloring any red Cj enclosing a green edge implies j > 2a + 4 and any other red Cj implies j < la. Hence, a red Ck = C*2a+2 does not occur.
Figure 1. r(P3,C6] does not exist.
Figure 2. r(G7H) exists only if G C C^ or H C C4.
The coloring of vertex disjoint green and red squares (see Figure 2 for n — 5) proves that either G or H has to be a subgraph of €4 if r(G,H) exists. In Figure 3 the vertical edges of Bn are colored red and the horizontal edges alternating green and red, starting with green in the first column. This is a critical coloring of any Bn for r(Pz, H) if H is not a subgraph of L in Figure 5. Critical colorings of any Bn as in Figure 4 for n = 7 prove that r(P±,H} cannot exist unless H is a subgraph of Z in Figure 6. In these colorings the top row of horizontal edges is periodically colored red-green-red-green-redred starting at the left upper vertex. Then in the following rows of horizontal
81
CHESSBOARD RAMSEY NUMBERS
Figure 3. r(P 3 ,#) exists only if H is a subgraph of L.
Figure 4. r(P^^H] exists only if H is a subgraph of Z.
Figure 5. Subgraph L.
Figure 6. Subgraph Z.
edges the periods row by row are shifted two edges to the right. The first two columns of vertical edges are periodically green-red-red. And the periods every second column are shifted down by one. The critical colorings as in Figures 1 to 4 imply the following theorem. Theorem 1. For the existence of the chessboard Ramsey number it is necessary that one graph is PS and the other one is a subtree of L (Figure 5), or one graph is P± and the other one is a subtree of Z (Figure 6). 3. PATHS For paths Pk we determine the exact values of r(Ps,Pfc). Theorem 2.
{
2 3 ff 1 - 1
for k = 3,4,5, for k = 6, for k > 7.
Proof. It suffices to prove the asserted values as lower bounds for k = 3,6, and k = 1i -\- 1, i > 4 and as upper bounds for k = 5 and k = 2i + 2, i > 3. The lower bounds for k = 3 and 6 follow from Figures 7 and 8. The colorings of P»;_i, i > 4, as in Figure 3 for i = 8, neither contain a green Pa nor a red P?i+i so that r(Ps,P2i+i) > i. For the upper bound in the case k = 5 every two-coloring of P>2 without ?. green PS contains a red PS of two horizontal or two vertical edges inside B
BODE, HARBORTH, AND KRAUSE
82
Figure 7. r(P3,P3) > 2.
Figure 8. r(P3,P6)>3.
For k = 1i -\- 2, i > 3, we prove that any two-coloring of B{ without a green P^ contains a red P^i+2- We distinguish the two cases that the red subgraph is connected or not. If the red subgraph is connected then there exists a path from the lower left to the upper right corner of B{ having at least 2i edges. If this path has more than 1i edges then we have a red Pii+i- It remains that every such path has exactly 2z edges which then only uses edges upwards and rightwards. By symmetry we may assume that the first edge of this path is upwards. Then we consider the first horizontal red edge from the bottom in the leftmost column. If this edge does not belong to the path then, using this edge, there is a path with 2i + 1 red edges from the second vertex in the lowest row of vertices to the vertex in the upper right corner (see Figure 9). Otherwise, we obtain a path of 2z + 1 red edges starting at the fourth vertex in the last row or at the third vertex in the second last row of vertices as indicated in Figure 10. This is not possible only if the original path uses the third vertex in the second last row and the third horizontal edge in the last row is green. Then, however, we use a path surrounding the second square in the last row of squares and this path has 1i -\- 2 red edges (see Figure 11).
Figure 9.
Figure 10.
Figure 11.
If the red subgraph is not connected then we can assume by symmetry that all horizontal edges of one column are green since any green edge separating two red components force both parallel neighboring edges within this column to be also green (see Figure 12). We consider one of these columns of separa.rting green oHges and the largest of the two remaining parts of -0Z, say the right one, having a width of at least l^} edges. At the left side of this part we have a red path Pi+s of i
CHESSBOARD RAMSEY NUMBERS
83
vertical red edges and at both ends one horizontal red edge. We can extend this P;+s at both ends by red edges either rightwards or upwards and either rightwards or downwards, respectively. If at each vertex vertical edges are prefered then both extensions of P;+s may meet each other to close a red cycle of at least 2i + 2 red edges, that is, a red P2i+2 exists. This is always the case if another column of separating green edges exists in the chosen part of Bi. Otherwise both extensions end on the right border of P>;. If these extensions use together at least two vertical red edges then we have at least i + 2 [^] + 2, that is, at least 2i + 1 red edges, and a red P2i+2 exists. If at most one vertical red edge occurs then one extension, say the lower one, has to end in a vertex at the corner of Bi. In this case the dashed edges in Figure 13 can be used to obtain a path having the two desired additional red edges.
Figure 12.
Figure 13.
For paths Pj. we prove the existence of r(P^^Pk). Theorem 3. The chessboard Ramsey numbers r(P^Pk) do exist. Proof. A sufficiently large two-colored board Bn without a green Pj and without a red P/- contains green and red components. We choose a red component having the largest geometrical diameter d (which is less than A;). This red component is enclosed by a separating set of green components. This separating set determines a separating curve C through edge-to-edge squares of Bn such that only green edges are intersected. No square can contain a starting point of three separating curves since three green edges of the square determine a green PJ. Thus the red edges outside C and adjacent to the edges of the separating set of green components belong to the same red component. Since Bn is large enough this red component has a diameter larger than d, a contradiction. 4. EXACT VALUES FOR SMALL GRAPHS Besides the exact values of r(Pa, Pjt) and the existence of r(P±, Pk) we used a computer to determine all values r(Ps, H) and r(P4, H] for subtrees H of the
BODE, HARBORTH, AND KRAUSE
84
graphs L and Z, respectively, with up to 8 vertices for H (see Table 1). In this case, both sets of subtrees are identical. In general, we do not know how to characterize the sets of subtrees of L and Z and whether the chessboard Ramsey numbers exist for all these subtrees.
G
H
ft
ft
G
H
r
i r
4
Table 1. Values of r(G,H) for G = P3, G = ft, and all H with up to 8 vertices.
REFERENCES [1] F.Harary, H.Harborth, and L Mengersen: Generalized Ramsey theory for graphs. XII. Bipartite Ramsey sets. Glasgow Math. J. 22 (1981), 31-41. [2] A.Bencziir, H.Harborth, and L. K. J0rgensen: Cube graph Ramsey numbers. Abh. Braunschweig. Wiss. Ges. 47 (1996), 151-157. [3] H.Harborth and I. Mengersen: Ramsey numbers in octahedron graphs. Discrete Math. 231 (2001), 241-246. [4] S. Radziszowski: Small Ramsey numbers. Electronic Journal of Combinatorics (Dynamic surveys), www.combinatorics.org E-mail address: E-mail address: E-mail address:
jp.bode9tu-bs.de "Jens-P. Bode" h.harborthfitu-bs.de "Heiko Harborth" stefan.krause9tu-bs.de "Stefan Krause"
MAXIMAL PRIMITIVE FIXING SYSTEMS FOR CONVEX FIGURES
VLADIMIR BOLTYANSKI Centre de Investigation en Matematicas, A.P. 402, 36000 Guanajuato, GTO, MEXICO. HERNAN GONZALEZ-AGUILAR Centre de Investigation en Matematicas, A.P. 402, 36000 Guanajuato, GTO, MEXICO.
ABSTRACT. We give here a complete classification of compact, convex figures with respect to the maximal cardinality of their fixing systems. This classification generalizes and makes more precise the results obtained by L. Fejes Toth [9], B. Tomor [12], and S. Fudali [10]. Some examples illustrate the text.
1. INTRODUCTION n
Let M C M be a compact, convex body and F be a subset of its boundary bdM. (We use the term body for a convex set if its interior in Rn is nonempty.) A nonzero vector v 6 W1 is said to move the interior intM of the body M off the set F if for every translation of M in the direction of v the interior of the translated body has no point in common with F, i.e., (Xv + intM) n F = 0 for every
A > 0.
Definition 1. Let M C Mn be a compact, convex body. A set F C bdM is a fixing system for the body M if there is no nonzero vector that moves the interior of M off the set F. The fixing system is primitive if no proper subset is a fixing system for M. In other words, F is a fixing system for M if for every vector v ^ 0 there exists a number A > 0 such that (Xv + intM) n F ^ 0. Visually, F is a fixing 85
86
V. BOLTYANSKI AND H.
GONZALEZ-AGUILAR
system if, drifting 'nails without friction' at all points of F, we eliminate the possibility to translate M in any direction. The concepts of fixing system and primitive fixing system were introduced by famous Hungarian mathematician Laslo Fejes Toth [9]. He established (cf. also [12]) that for every compact, convex body M C K2 the maximal cardinality £> max M of its primitive fixing systems satisfies the inequality £> max M < 6, the equality being attained if M is a hexagon with pairwise parallel opposite sides (Fig. 1). Furthermore, S. Fudali [10] showed that these hexagons are the only planar figures for which the indicated upper bound is attained. Evidently, every minimal fixing system F for the body M C Mn (i.e., a fixing system of the least cardinality) is primitive. B. Griinbaum [11] proved that the cardinality £ m i n M of minimal fixing system for M satisfies the inequalities The lower bound is attained, in particular, for n-dimensional ball (see Example 3 below), the upper one being attained for n-dimensional parallelotope (Example 1). In this connection, Griinbaum formulated the following problem: To prove that the upper bound is attained only for n-dimensional parallelotopes.
Fig. 1 Fig. 2 Being based on the result of Fejes Toth, L. Danzer [8] conjectured that for any three-dimensional compact, convex body M the maximal cardinality of primitive fixing system is not greater than 14 where the upper bound is attained for rhombic dodecahedron (i.e., a three-dimensional zonotope analogous to the regular hexagon, Fig. 2). But this conjecture was disproved by B. Bollobas [1] who constructed for any integer k > 4 a three-dimensional compact, convex body M\~ with £> max A/& = k. A simpler construction was offered in [4] (see Example 4 below). To formulate next results, we recall the definition of the functional m,d introduced in [2]. Let M C Mn be a compact, convex body. By mdM denote the greatest integer m such that the unit outward normals po,pi, ...,pm of
MAXIMAL PRIMITIVE FIXING SYSTEMS
87
M at some regular boundary points ao,ai,...,a m are minimally dependent, i.e., (i) there are positive numbers Ao,Ai,...,A m such that \opo + ^ipi + ... + Xmpm = Q(M) any m of the vectors po,pi, ...,pm are linearly independent. In other words, the vectors PQ,PI, ...,pm (emanating from the origin 0 G Kn) are the vertices of an m-dimensional simplex that contains 0 in its relative interior. Remark that 1 < mdM < n for any compact, convex body M C Mn and mdM = 1 if and only if M is an n-dimensional parallelotope. Using the functional mdM, in articles [3] and [6] (cf. also Section 44 in monograph [5]) the following estimates were proved: nH
—- < g . M < 2n + 1 - mdM. mdM ~ min The upper one contains the positive solution of the above Griinbaum's problem. Indeed, if £ min M = n, then mdM = 1, i.e., M is an n-dimensional parallelotope. For n > 3 and 2 < m < n there are compact, convex bodies M C Kn with mdM = m and any large (integer) cardinality of primitive fixing system for M (this was established in [4], see Example 4 below). Even if mdM = 2, the following exact upper estimate is established in [7]: 9 £max^ < ^n + an
where an = 0 an = -3
if n = 0(mod4), if n = 2(mod4),
an = —-
if n = 1 (mod 4),
an =
if n = 3(mod4).
2. MAIN RESULTS In this article we give a complete classification of compact, convex planar figures with respect to the cardinality of their maximal primitive fixing systems. Definition 2. Let M C Mn be a compact, convex body. Boundary points ai,a2 of M are antipodal if there are two parallel (and distinct) support hyperplanes Fi,F2 of M with ai G FI and a 2 G F2. The points ai,a2 are strictly antipodal if the hyperplanes can be chosen in such a way that every hyperplane Fi,F2 has only one point in common with M. The antipodal points £-..02 are semistrictly antipodal if they are not strictly antipodal, but the above support hyperplanes Fi,F2 can be chosen in such a way that one of them has only one point in common with M.
V. BOLTYANSKI AND H.
Fig.
GONZALEZ-AGUILAR
4
In Fig 3, the points a, 6 £ bdM are strictly antipodal. Furthermore, the boundary points a,c are semistrictly antipodal. Finally, the points 6,c are antipodal, not being neither strictly antipodal nor semistrictly antipodal. Definition 3. Let M C En be a compact, convex body and v ^ 0 be a vector. A boundary point a of M is illuminated by the direction of the vector v (or, for brevity, a is illuminated by the vector v) if a+ Xv 6 int M for A > 0 small enough. In Fig. 4 the point a is illuminated by u, whereas 6 and c are not illuminated. Theorem 1. A set F C bd M is a fixing system for a compact, convex body M C Mn if and only if each direction illuminates at least one point of the set F. This Theorem is known (see Theorem 44.1 in [5]). The following three Theorems contain a complete classification of compact, convex planar figures with respect to £> max M. More detailed, Theorems 2, 3, and 4 give a necessary and sufficient condition under which the equality £> max M = k holds for k = 6, 5 and 3, respectively. In other cases £ max M = 4. Theorem 2 (S. Fudali [10]). Let M C K2 be a compact, convex body. The equality £> max M = 6 holds if and only if M is a hexagon with pairwise parallel opposite sides. Before to formulate the next Theorem, we say several words about antipodal vertices of convex pentagons. Definition 4. A convex pentagon P is flattened if there are t.\vo its neighboring vertices which are antipodal points of P.
MAXIMAL PRIMITIVE FIXING SYSTEMS
89
d
Fig. 5
Fig. 6
In Fig. 5 the convex pentagon P has two neighboring vertices a, b for which the sum of corresponding interior angles is less than TT; these points are strictly antipodal, i.e., P is flattened. In Fig. 6 the vertices a and b have the sum TT of the interior angles; these points are antipodal (not being strictly antipodal), and hence P is flattened. Even if for every two neighboring vertices of P the sum of corresponding interior angles is greater than TT, then no two neighboring vertices of P are antipodal, i.e., P is non-flattened. Theorem 3. Let M C R2 be a compact, convex body with £ max Af < 6. The equality £>max M = 5 holds if and only if there is a non-flattened convex pentagon P inscribed in M such that every two non- neighboring vertices of P are antipodal points of the body M. The requirement £ max Af < 6 in Theorem 3 is illustrated by Example 5. Theorem 4. Let M C R2 be a compact, convex body. The equality £ max M = 3 holds if and only if M satisfies at least one of the following two conditions: 1) there exist three boundary points of M every two of which are strictly or semistrictly antipodal points of M; 2) there exists a segment [a, b] C bdM such that a and b are strictly or semistrictly antipodal points of M . The following two Theorems give £ max Af for two interesting classes of planar figures. Theorem 5. Let M be a figure of constant width h. Then 5 Theorem 6. Let
if M is the Realeaux triangle, if M is a Realeaux pentagon, in all other cases.
be the regular polygon with k vertices. Then 3 if k = 3, 4 if k = 4.7,9 or k > 10, 5 if fc = 5, 8, 10, 6 */ Jfc = 6.
90
V. BOLTYANSKI AND H. GONZALEZ-AGUILAR 3. EXAMPLES 71
Example 1. Let M C M be an n-dimensional parallelotope. Choosing one relatively interior point in every facet of M, we obtain a fixing system F for M that consists of 2n points. This fixing system is primitive, and every primitive fixing system for M has that form. Thus QminM = Qm^M = In. Example 2. Let M C R2 be a hexagon with pairwise parallel opposite sides (Fig. 1), and F be its vertex set. Each direction illuminates at least one vertex of M. Hence (by Theorem 1) F is a fixing system for M. This fixing system is primitive. Moreover, F is the only primitive fixing system for M consisting of six points. Example 3. Let M C Mn be a compact, convex body that is smooth] this means that every boundary point a of M is regular, i.e., there is only one support hyperplane of M through a. Furthermore, let po?Pi>-",Pn be minimally dependent unit vectors in Rn. Denote by T C Mn the circumscribed n-dimensional simplex of M with outward normals pQ,pi,...,pn of its facets. Let ao,eti, ...,a n be common points of the facets of T with M (if a facet has more than one point in common with M, we take an arbitrary one of them). Each direction illuminates at least one facet of T, and hence it illuminates at least one of the points ao, ai, ...,a n . Theorem 1 shows that F = {ao,ai,...,a n } is a fixing system for M. This fixing system consists of n + 1 points. Consequently, by Griinbaum's estimates, this fixing system has the minimal cardinality, i.e., £> min M = n + 1. Thus every smooth, compact, convex body M C Mn (in particular, every n-dimensional ball) satisfies Grimbaum's lower estimate. At the same time £» max M = In. Indeed, let P be a circumscribed parallelotope for M and Z/ z -, i = 1, ...,2n, be the facets of P. For every i — 1, ...,2n choose a point a; 6 L{ fl bdM. We obtain a set F = {ai,...,«2n} C bdM. Every nonzero vector illuminates at least one facet of P, and hence it illuminates at least one of the points ai,...,a2 n - Thus F is a fixing system for M. This system is primitive. Consequently £> max M > In. Let now F' = {61,..., 6^} be an arbitrary primitive fixing system for M and Pi, ...,pk be unit outward normals of M at the points 61, ...,6fc, respectively. Then {pi,...,pk} is a positive basis of Rn, i.e., every vector is representable as a linear combination of the vectors pi, ...,pk with nonnegative coefficients (otherwise there exists a vector that doesn't illuminate any point of F'). But every primitive positive basis of Mn consists of no more than 2n vectors (cf., for example, [11]), i.e., k < 2n, and hence £ma][M = In.
91
MAXIMAL PRIMITIVE FIXING SYSTEMS
Fig. 7 Example 4. Let M = conv(B U {a}) C M3 where B is a ball and a is its exterior point. In [4] the equality £ max M = oo is proved; this means that for any integer k > 4 there is a primitive fixing system for M consisting of k points. Moreover [4], for every A; > 4 there exists a zonotope Z^ C R3 with £ max Zfc > k. These examples can be generalized for greater dimensions. In particular, for every n > m > 3 there is a compact, convex body M C Rn with mdM = m and £max.M = oo.
Fig. 10
Fig. 9 2
Example 5. Let M C R be a regular hexagon with vertices a, 6, c, d, e, f (in cyclic order). Denote by p a relatively interior point of the segment [e,/]. Then P = conv{a,6, c,cf,p} is a non-flattened convex pentagon inscribed in M and satisfying condition of Theorem 3. Nevertheless, Qma,xM = 6, i.e., conclusion of Theorem 3 doesn't hold. This shows that the condition £ max M < 6 in Theorem 3 is essential. Let now II be a closed half-plane with {a, 6, c,d, e,p} C intll and / ^ II (Fig. 9). Then M' = M n II is a compact, convex body in R2 with Qm^M' = 5. Indeed, P is an inscribed pentagon for M' satisfying condition of Theorem 3 and, moreover, 0 max M' < 6 (by Theorem 2). Example 6. Let M be the Realeaux triangle (Fig. 7). Every two of the vertices a, 6, c are strictly antipodal points of M. By Theorem 4, £ max M = 3.
V. BOLTYANSKI AND H. GONZALEZ-AGUILAR
92
If II is a closed half-plane containing a, 6, c in its interior, but not containing M (Fig. 10), then M' = M n II is another figure with £ max M' = 3 (again by Theorem 4). However, if we cut the point c by a line parallel to belli (Fig.11), then we obtain a figure N with 6m^N = 4 (see Lemma 4 below or use Theorems 2, 3, and 4). Example 7. Let N C R2 be a semicircle with diameter [a,m]. Then ^max-^ — 3 by Theorem 4. Let now b be a relatively interior point of the segment [a,m] and / be the line through b that is perpendicular to [a, raj. Denote by II the closed half-plane with bdll = / that contains a, and let M — TV D II. Then £> max M = 3 (again by Theorem 4), since the segment [a, b] is contained in bdAf and a, b are semistrictly antipodal boundary points of M.
M Fig. 11
Fig. 12 2
Example 8. For the body M C M in Fig. 12 we have £ max Af = 5. Indeed, the inscribed pentagon P with the vertices a, 6, c, d, e satisfies the condition of Theorem 3.
4. AUXILIARY PROPOSITIONS In the proofs below we assume that the plane R2 is Euclidean, i.e., a scalar product is defined in R2. In particular, it is possible to consider the length /(/) of any segment / C R2 and the angle a between any two nonzero vectors in R2 (with 0 < a < TT). Lemma 1. Let M C R2 be a compact, convex body and F be a primitive fixing system for M. Then F is the vertex set of an inscribed polygon P of M, i.e., no three points of F are situated in the same line. Moreover, if p and q are non-neighboring vertices of P, then they are antipodal points of M. Proof. Assume that three points a, 6, c € F are situated in / n bdM where / is a support line of M. Let b be situated between a and c in /. If a vector e ^ 0 illuminates the point a, then it illuminates b. In other words, there is no direction that illuminates only the point a £ F, contradicting the
MAXIMAL PRIMITIVE FIXING SYSTEMS
93
primitivity of the fixing system F. Thus no three points of F are situated in a line. Let p and q be non-neighboring vertices of P. They divide bdM into two open arcs A and B. There exists a vertex a of P situated in A (since p and q are not neighboring). Denote by g and h the rays emanating from p and <7, respectively, and touching B. Let g and h be their opposite rays. If g and h have a common point (Fig. 13), then it is impossible to illuminate only the point a £ F, contradicting the primitivity of the fixing system F. Thus g n h = 0, i.e., the arc B is situated in a strip with parallel sides through p and , respectively. Analogously, A is situated in a strip with parallel sides through p and q, respectively. This means that p and q are antipodal points of M. m
K
Fig. 13
Fig. 14
Lemma 2. Let G C K2 be a strip with parallel sides K\,K-2. Let, further, a G KI, 6 G KI\ c G G, e G intG where c and e are situated in an open half-plane with the boundary line ab. Then there is no strip H C M2 with parallel sides L\,L-2 such that c G L\,e G L?, and a,6 G #• Proof. Introduce coordinate system x,y with a as the origin, JiTi as the x-axis, and the ray emanating from a through b as positive y-axis. We may suppose that c and e have positive abscissa (Fig. 14). Assume that the strip H exists, and denote by v a vector with positive abscissa that is parallel to LI,LI- Since a G H, ordinate yv of the vector v is nonnegative. Similarly yv is nonpositive, since b G H- Hence yv = 0. But in this case the strip H cannot contain the points a and 6, since e G intG. • Lemma 3. Let M C K.2 be a compact, convex body with £ max M = 5 and F = {a, 6, c, d, e} be a primitive fixing system for M, the points being situated in cyclic order. Then the pentagon P = convF is non-flattened. Proof. Assume that two neighboring vertices of P are antipodal points, i.e., P has the form as in Figs. 5 or 6. In the case of Fig. 5, there are three vertices of P inside a strip with the sides through a and b. respectively. In this case, by Lemma 2, c and e cannot be antipodal points of M, contradicting Lemma 1. In the case of Fig. 6, since c and e are antipodal (by Lemma
94
V. BOLTYANSKI AND H. GONZALEZ-AGUILAR
1), M is situated in the strip with the boundary lines be and ae. Hence the vector v — c — b doesn't illuminate any point of _F, contradicting Theorem 1. • Let M C M2 be a compact, convex body and a be an its non-regular boundary point. Denote by / i , / 2 the rays which emanate from a and touch M (Fig. 15). The angle between the rays is the interior angle of M at the point a. The adjacent angle is the exterior angle of M at the point a. If a is the value of the interior angle at a, then the exterior angle has the value (3 = TT — a. It is known that the set of all non-regular boundary points of M is at most countable, and the sum of values of corresponding exterior angles is not greater than 2?r. m2
Fig. 15
Fig. 16 2
Lemma 4. Let M C R be a compact, convex body. Assume that there are two parallel segments /i, /2 in its boundary with 0 < /(/i) < ^(^2)- If there exists a chord I of M parallel to I\ and I l(Ii), then £> max M > 4. Proof. Let [a, b] be a chord of M that is parallel to I\ and has the maximal length (among the parallel chords). Then there are two parallel support lines m\,m<2 of M passing through a and 6, respectively (Fig. 16). Let c and d be relatively interior points of I\ and /2, respectively. Then F = {a,6,c, d} is a primitive fixing system for M, and hence £> max M > 4. • Lemma 5. Let M C R2 be a compact, convex body. Assume that there exists a segment [a, 6] C bdM such that a and b are strictly or semistrictly antipodal points of M. Then £> max Af = 3. Proof. Let / and m be parallel support lines of M passing through a and 6, respectively. We may suppose that / has only the point a in common with M (since a and b are strictly or semistrictly antipodal points of M). Denote by p the unit vector that is parallel to I and illuminates the relatively interior points of the segment [a, 6] (Fig. 17). Furthermore, let n be the support line of M that is parallel to ab. Denote by q the unit vector such that b = a + Xq with A > 0. Denote by g C bdM the open arc consisting of all points
MAXIMAL PRIMITIVE FIXING SYSTEMS
95
which are illuminated by the vector q. The endpoints of g are a and c G n. Analogously, denote by h C bdM the open arc consisting of all points which are illuminated by the vector — q. The endpoints of h are b and d £ n. It is possible that the points c and d coincide. Let now F be a primitive fixing system for M. Then there is a relatively interior point x of the segment [a, b] that belongs to F (otherwise the vector p doesn't illuminate any point of F}. Furthermore, there is a point y 6 F that belongs to the open arc g (otherwise the vector q doesn't illuminate any point of F}. Analogously, there is a point z £ F D h. We show that the points x,y,z form a fixing system for M. Indeed, if a nonzero vector is situated between p and q or between p and —, then it illuminates the point x. The vector — p illuminates the point y (since the open arc g has no point in common with /, i.e., y £ /). Furthermore, if a nonzero vector is situated between q and —p, then it illuminates the point y. Finally, if a nonzero vector is situated between — q and —p, then it illuminates the point z. Hence every nonzero vector illuminates at least one of the points £,y,z, i.e., {x,y,z} is a fixing system that is contained in F. Since F is primitive, it coincides with {x,y,z}. Thus every primitive fixing system for M consists of three points, i.e., £ max M = 3. •
Fig. 18 Lemma 6. Let M C K2 be a compact, convex body. If there are boundary points a,6,c of M every two of which are strictly or semistrictly antipodal, then 0 max M = 3. Proof. Denote by ia& the open arc of bdM with the endpoints a and b which doesn't contain c. The open arcs tj,c and tca are denned analogously. If at least one of the segments [a, 6], [6,c][c,a] is contained in bdM, then £ max M = 3 by Lemma 5. Thus we may suppose that none of the segments is contained in bdM. Since the points a and 6 are strictly or semistrictly antipodal, there are two parallel support lines lajb of M with a £ /a, b £ /j, such that at least one of the lines / a ,/& has only one point in common with M. By assumption, c ^ /a, c £ /&. Let vc be the unit vector that is parallel to
96
V. BOLTYANSKI AND H. GONZALEZ-AGUILAR
lajb and illuminates the arc i a &. Then the opposite vector —vc illuminates the point c and at least one of the arcs tic,tca (more detailed, if the line la contains only the point a in common with M, then — vc illuminates the arc £ ca , and analogously for the arc i& c ). Similarly we define the vectors va and Vh (Fig. 18). Thus each of the vectors va,Vb,vc, — va, — Vj,, — vc illuminates at least one of the arcs £ a &,£& c , tca. If a vector p ^ 0 is situated strictly between va and — fc, then p illuminates the arc 2&c (and similarly for vectors situated in the interiors of the other five angles). Thus every nonzero vector illuminates at least one of the arcs tab-i thai tea-
Let now F be a primitive fixing system for M. Since the vector va illuminates only the points of the open arc 2& c , the set tbc fi F is nonempty. We choose an arbitrary point a of this set. Similarly, choose points b 6 tca D F and c € tat, n F. Then the points a, 6, c form a fixing system for M (since every nonzero vector illuminates at least one of the arcs 2 a &?4c7*ca and hence illuminates at least one of the points a,6, c). Since F is primitive, it coincides with {a,6,c}. Thus every primitive fixing system for M consists of three points, i.e., £> max M = 3. •
5. PROOF OF MAIN RESULTS Proof of the Fejes Toth estimate. Assume that a primitive fixing system F C bdM consists of seven (or more) points, and let ai,...,a7 be successive vertices of the convex polygon P = convF (Fig. 19). By Lemma 1, ai and 03 are antipodal points of M. Let G D M be a strip with parallel sides Ki^K^ such that a\ € A'i,a-3 G KI- The point 02 is situated in an open half-plane HI with the boundary line 0,1013, and 04, 05, ae, 07 are situated in the opposite open half-plane 112. Maybe 0,7 £ K\ and 0,4 € A'2, but the points 05,05 are situated in the open set 11% n mtG. Then 04 and ag are non-neighboring vertices situated in 112 and, by Lemma 1, they are antipodal points of M. This means that there is a strip H D M with boundary lines through 0,4 and ae, respectively, contradicting Lemma 2. This contradiction shows that £ m a x M < 6. • Proof of Theorem 2. Let £ max M = 6. Assume that F is a primitive fixing system for M consisting of six points a\, a^, cts, 04, as, fle m cyclic order. Let G D M be a strip with the boundary lines K\ and KI through the antipodal points 01,03. If two of the points 04,05,05 are situated in the interior of G, we obtain the contradiction, as in the previous proof. Hence ric. and n-4 should be situated in the lines K\,K
MAXIMAL PRIMITIVE FIXING SYSTEMS
97
i.e., M = P is a hexagon with parallel opposite sides (the primitive fixing system F being the vertex set of the body M). Conversely, if M is a hexagon with pairwise parallel opposite sides, its vertex set is a primitive fixing system for M, and hence £ max Af = 6. • Proof of Theorem 3. The part "only if is contained in Lemmas 1, 3. We prove the part "if. Let P be a non-flattened inscribed convex pentagon of M such that every two non-neighboring vertices of P are antipodal point of M. Denote by F the vertex set of P. Any direction illuminates at least one vertex of P. All the more, any direction illuminates at least one point of the set F C bdM, i.e., F is a fixing system for M. Furthermore, let a be an arbitrary point of F and 6, e be its neighboring vertices in P. Then b and e are antipodal points of M, i.e., there is a strip with the boundary lines through b and e that contains M. Hence there is a direction that illuminates only the point a 6 F. Similarly for other points of F. Thus the fixing system F is primitive. •
'6
Fig. 19
ll
Fig. 20
Proof of Theorem 4. The part "if follows from Lemmas 5 and 6. We prove the part "only if. Let Qm^xM = 3. Then the body M contains nonregular boundary points (otherwise £ max M = 4, see Example 3). Let a be the non-regular boundary point with the greatest exterior angle (or one of the points with the greatest exterior angle if such a point is not unique). Denote by /i,/2 the tangential rays of M emanating from a and by m\,m
V. BOLTYANSKI AND H. GONZALEZ-AGUILAR
98
semistrictly antipodal. Then at least one of the points c, d belongs to M (otherwise £> max M = 4 by Lemma 4). Assume for definiteness that c € M, i.e., b and c are antipodal. If they are neither strictly nor semistrictly antipodal, then the points x, y, z, w as in Fig. 20 form a primitive fixing system for M, contradicting the condition £> max M = 3. Hence b and c are strictly or semistrictly antipodal, i.e., again M satisfies condition 2) of Theorem 4. Thus if b G M, then Theorem 4 holds. Analogously, if d 6 M, Theorem 4 holds. Case 2. None of the points b,d belongs to M and, moreover, a and c are the unique common points of M with the boundary of the parallelogram abed. Denote by /j, 1'2 the tangential rays of M emanating from c. Then l'i C mi and 1'2 C TII^ (otherwise the exterior angle of M at c is greater than the exterior angle at a, contradicting the choice of the point a). Let P be a circumscribed parallelogram of M that contains the points a,c in its interior and x,y,z,w be common points of M with the boundary of P (Fig. 21). We assume P to be so close to abed that x,w are illuminated by the vector c — a and y, z are illuminated by the vector a — c. (Remark that the set of all directions for which there is a support line, having a segment in common with M, is no more than countable, and therefore we may suppose that each side of P has only one point in common with M.) The set F = {x,y,z,w} is a fixing system for M. Indeed, if a nonzero vector is situated between c — a and b — d (inclusively), then it illuminates the point w. Furthermore, if a nonzero vector is situated between a — c and 6 — rf, it illuminates the point z. Similarly for vectors situated between d — b and ±(a — c). Hence any direction illuminates at least one of the points z , y , 2 , w , i.e., F is a fixing system. Moreover, this fixing system is primitive (since each side of P contains only one point belonging to F), contradicting the condition > M = 3. Thus case 2 cannot be realized.
Fig. 21
Fig. 22
Case 3. None of the points 6, d belongs to M: moreover, c, £ M and M has one segment in common with the boundary of abed. For definiteness, assume that the side [a, b] has a segment [a, a;] in common with the boundary of
MAXIMAL PRIMITIVE FIXING SYSTEMS
99
the parallelogram abed. Let P be a circumscribed parallelogram of M that contains the points a, c in its interior and x'', y, 2, it; be common points of M with the boundary of P (Fig. 22). We remark that the point x' may coincide with x or differ from it. As in the previous case, {x',t/,2;, w} is a primitive fixing system for M, contradicting the condition £ max M = 3. Thus case 3 cannot be realized, too. Case 4: b £ M, d £ M, c £ M, and M has more than one segment in common with the boundary of abed. By Lemma 4, M cannot have two segments in common with two opposite sides of abed. For defmiteness, assume that the side [a, b] has a segment [a, x] in common with the boundary of abed and either [a, d] or [6, c] has a segment in common with the boundary of abed. As earlier, we construct a primitive fixing system for M that consists of four points, contradicting the condition £ max M = 3. Thus case 4 also cannot be realized. Case 5. None of the points 6,c,d belongs to M. Denote by b' the point of the set m<2, n M nearest to c and by d' the point of the set m\ D M nearest to c. If b' and d' are not antipodal points of M (Fig. 23), then it is possible to construct a primitive fixing system consisting of four points (with the help of a circumscribed parallelogram P) as in the previous cases, i.e., £> max M > 4, contradicting the condition of the Theorem. Even if b' and d' are antipodal points of M, not being neither strictly antipodal nor semistrictly antipodal (Fig. 24), then Qm!LXM > 4, by Lemma 4, again contradicting the condition of the Theorem. Thus b' and d' are strictly or semistrictly antipodal. The points a and b' are strictly or semistrictly antipodal and, analogously, a and d' are strictly or semistrictly antipodal. Now the points a, b', and d' satisfy condition 1) of Theorem 4. •
Proof of Theorem 5. Let M C R2 be a figure of constant width h. If 6, c are antipodal points of M then they are strictly antipodal and the segment [6, c] has the length h. Furthermore, let a,p, q be three boundary
100
V. BOLTYANSKI AND H. GONZALEZ-AGUILAR
points such that a,p are antipodal and a,g are antipodal, too. Then each of the segments [a,p] and [a,g] has the length h and the boundary arc pq (not containing a) is the circular arc of radius h. Now, according to Theorem 4, if £max^ — 3, then M is the Realeaux triangle, i.e., each of the segments [a, 6], [6, c], [c, a] in Fig. 7 has the length h and every arc ab, be, ca is a circular arc of radius h. Furthermore, if Qm^M = 5 and P — conv{a,6,c,d,e] is the inscribed pentagon as in Theorem 3, then each diagonal of P has the length h and every boundary arc ab,bc,cd,de,ea is the circular arc of radius h. This means that M is a Realeaux pentagon of constant width h (Fig. 8). Even if a body M C K2 is a figure of constant width h distinct from the above ones, then £>max.M — 4 (since the equality Qm^M = 6 is impossible by Theorem 2). Proof of Theorem 6. Let Mk C M2 be a regular polygon with k = 2n+l vertices, n > 2. By Theorem 2, ^ max M^ < 6. Assume £> max M/j = 5. Then there is a non-flattened convex pentagon P inscribed in Mk as in Theorem 3. Let a,b,c,d,e be successive vertices of P. The center of Mk denote by g. Since a and c are antipodal points of Mk, there are two parallel, noncoincident support lines / a ,/ c of Mk with a G la,c € lc- Maybe one of the sides of Mk is situated in la or lc, but 2n (or all 2n + 1) sides are situated in the strip between la and lc. Namely, n (or n + 1) of the sides of Mk are situated in one half-plane with the boundary line ac, and n (or w+1) of them are situated in the other half-plane. This implies that the angle between the vectors a — q and c — q is not less than 2™r\ '^ • Similarly, the angle between a — q and d — q is > 2™ 1 • 27T. Hence the angle between c — q and d — q is — 2n+i ' ^ (independently, whether c and d are situated on different sides of the line ag or not), i.e., every side of P is visible at the angle < 2n+i ' ^ from q. Consequently the chord ac is visible at the angle < 2n2+1 • 2?r from g, i.e., the angle a between the vectors a — g and c — g is < 2 2 l • 2yr. Thus 2 n • 2?r > a > • 27T, 2n + 1 ~ - 2n + 1
contradicting n > 2. This contradiction shows that £> max Af/; 7^ 5. Similarly Qm^Mk ^ 3. Thus if n > 2, then £> max Af2 n +i = 4. Let now Mk C K2 be a regular polygon with k = 2n vertices, n > 5. Then £> max Mfc < 6. Assume that £>max Mk = 5. Then there is a non-flattened convex pentagon P inscribed in Mk as in Theorem 3. Let a,b,c,d,e be successive vertices of P. The center of Mk denote by q. Since a and c are antipodal points of Mk, there are two parallel, noncoincident support lines / a ,/ c of Mk with a G / e ,c G lc- Maybe two opposite sides of Mk are situated in la U lc, but In — 2 (or all In] sides are situated in the strip between la and lc. Namely, n — 1 (or n) of the sides of M\. are
MAXIMAL PRIMITIVE FIXING SYSTEMS
101
situated in one half-plane with the boundary line ac, and n — I (or n) of them are situated in the other half-plane. This follows that the angle between the vectors a — q and c — q is not less than -i^ • 27T. Similarly, the angle between a — q and d — q is > ^^ • 2?r. Hence the angle between c — q and d — q is < ^ • 2?r, i.e., every side of P is visible at the angle < ^ • 2?r from q. Consequently the chord ac is visible at the angle < ^ • 2?r from #, i.e., the angle (3 between the vectors a — q and c — q is < ^ • 27T. Thus 27T > /? > ^—— • 2?r, 2n - ^ ~ 2n contradicting n > 5. This contradiction shows that Qm^Mk ^ 5. Similarly £ max Mfc ^ 3. Thus if n > 5, then £>max-M2n = 4.
It follows from above that£ max M7 = 4, ^ max Mg = 4 and gmAXMk = 4 for A; > 10. It remains to consider the value QmiLXMk for k = 3,4,5,6,8,10. It is easily shown that £ max -Mfc = k for k — 3,4,5,6. Furthermore, let ai,a 2 , ...,aio be successive vertices of MIQ. Then P = conv{a 2 ,a 4 ,a6,a8,aio} is a non-flattened inscribed pentagon of M\Q that satisfies the condition of Theorem 3. Hence £> max Mio = 5. Finally, let ai,a2,...,as be successive vertices of MS. Then P — conv{a2,a4,a5,a7,as} is a non-flattened inscribed pentagon of MS that satisfies the condition of Theorem 3. Hence gm!iXMs — 5.
REFERENCES [1] B. Bollobas, Fixing systems for convex bodies, Studio, Sci. Math. Hungar., 2 (1967), 351-354. [2] V. Boltyanski, Kelly's theorem for .ff-convex sets, Soviet. Math. Doklady, 17 (1976), no. 1, 78-81. [3] V. Boltyanski and H. Martini, Combinatorial geometry of belt bodies, Results Math., 28 (1995), 224-249. [4] V. Boltyanski and H. Martini, On maximal primitive fixing systems, Beitrdge zur Algebra und Geometric, 37 (1996), 199-207. [5] V. Boltyanski, H. Martini, P. Soltan, Excursions into Combinatorial Geometry, Springer- Verlag, Berlin-Heidelberg-New York, 1997. xiv + 419 pp. [6] V. Boltyanski and E. Morales Amaya, Minimal fixing systems for convex bodies, Journal of Applied Analysis, 1 (1995), no. 1, 1-13. [7] V. Boltyanski and E. Morales Amaya, Cardinalities of primitive fixing systems for convex bodies, Discrete and Computational Geometry, 24 (2000), no. 2-3, 209-218. [8] L. Danzer, Review 2942, Math Reviews, 26 (1963), 569-570. [9] L. Fejes Toth, On primitive polyhedra, Acta Math. Sci. Hungar., 13 (1962), 379-383.
102
V. BOLTYANSKI AND H. GONZALEZ-AGUILAR
[10] S. Fudali, Fixing systems and homothetic covering, Acta Math. Sci. Hungar., 50 (3-4) (1987), 203-225. [11] B. Griinbaum, Fixing systems and inner illumination, Acta Math. Sci. Hungar., 15 (1964), 161-168. [12] B. Tomor, The fixing problem for convex figures, Mat. Lapok, 14 (1963), 120-123. E-mail address: E-mail address:
boltianOcimat .mx ''Vladimir Boltyanski ' ' hernanQcimat .mx ''Hernan Gonzalez-Aguilar' '
THE NEWTON-GREGORY PROBLEM REVISITED
KAROLY BOROCZKY1 Eotvos University, Department of Geometry, Pazmany Peter setany 1/c, Budapest, Hungary, 1117
ABSTRACT. The Newton-Gregory problem; namely, whether thirteen points can be placed on the sphere S2 in a way that the spherical distance between any two is at least |, has received much attention since 1694. The first rigorous solution is due to K. Schiitte & B.L. van der Waerden [12], who used their method developed earlier in order to deal with packings of any number of equal spherical circles (see K. Schiitte & B.L. van der Waerden [11]). A simple and elegant solution for the Newton-Gregory problem was given by J. Leech [10]; more precisely, he provided the sketch of his argument. Here we present a complete proof along different lines.
1. INTRODUCTION For k > 4, we write a^ to denote the maximum number with the property that one can place A; points on the sphere S2 so that the spherical distance between any two different points is at least a^. In case of thirteen points on S2, it seems to be out of reach to determine 013. On the other hand, the question whether 013 > | has attracted much attention. The reason is an equivalent formulation; namely, whether thirteen unit balls in E3 can touch a given unit ball without overlapping. Isaac Newton and David Gregory discussed this problem in 1694, and Newton stated that the maximal number of touching balls should be twelve. He was right, but the first and still not complete solutions were provided only in 1874/75 by the physicists C. Bender [4], S. Giinter [8] and R. Hoppe [9]. The first "rigorous proof was given by K. Schiitte &; B.L. van der Waerden [12], and this proof was further simplified by J. Leech [10] to an elegant argument. 1
Supported by OTKA T 029786 103
104
BOROCZKY
The proof by Leech considers the network of segments of pairs of points whose length are less than a prescribed constant (arccos ^), and estimates the area of the resulting possibly non-convex spherical polygons. There is one apriori possible arrangement where the estimates do not work, but this case is eliminated by graph theoretic arguments. The sketch [10] of J. Leech is reproduced in the books M. Aigner and G. Ziegler [1], and Ch. Zong [13]. The paper by J. Leech is only two pages, but it is partially due to the fact that he does not provide proofs for his estimates for the area of spherical polygons. This was acknowledged by M. Aigner and G. Ziegler, say in the preface of the second edition [2] of their beautiful book. In this paper, we prove using a different line of argument THEOREM 1.1. Among thirteen points on the sphere S2, there always exist two whose spherical distance is less than ^. We note that f = 1.047197551 The paper K. Boroczky and L. Szabo [3] in this volume verifies that even a\3 < 1.02746114, while K. Schiitte and B.L. van der Waerden [11] exhibited an arrangement showing that 013 > 0.997223592....
2. THE PROOF OF THEOREM 1.1 We prove Theorem 1.1 by contradiction, so suppose that (1)
«13 > |-
We write | • | to denote the area on the sphere, and d(-, •) to denote spherical distance. In this paper, distance, triangle, eic, always mean spherical distance, spherical triangle, etc. We use the spherical Laws of Sine and Cosine in order to calculate of areas of polygons with given sidelengths and angles. First we recall the notion of Delone triangulations. Let x\,... ,xn be a family of points on S2 that intersects any open hemisphere. We say that a circle is a supporting circle if its interior does not contain any of the points, and the boundary contains at least three of the points of the family x\,... ,x n . The spherical convex hull of the points in the boundary of a supporting circle is called a Delone cell. Now the Delone cells are the radial projections of the faces of the convex hull of the points x\,... , xn as a subset of the Euclidean three space E3. It follows that the Delone cells form a cell decomposition of S2. Any triangulation of this cell complex whose vertices are x i , . . . ,xn is called a Delone triangulation. In addition, the family x\,... ,rr n is called saturated with respect to a distance a < | if on the one hand, the distance between any two of the n points is at least a, and on the other hand, any
THE NEWTON-GREGORY PROBLEM
105
x E S2 is of distance less than a from at least one of #1,... ,xn. We observe that if xi,... ,xn is saturated with respect to a distance a then the circumradius of any Delone cell or triangle is less than a. We write T(a) to denote the regular triangle of side length a. Let us quote the well-known triangle bound due to L. Fejes Toth [5] (see also L. Fejes Toth [6] p. 244): LEMMA 2.1. If T is a Delone triangle for a saturated arrangement of points with respect to a distance a < f then \T\ > \T(a)\. 2
Since a triangulation of 5 with at least twelve vertices contain at least 20 triangles, we deduce that a\2 is the spherical distance between neighbouring vertices of the regular icosahedron (see L. Fejes Toth [5], or L. Fejes Toth [6] p. 227), and hence (2)
ai3 < 012.
Actually ai2 can be characterized with the property that the circumradius of the regular pentagon with side length 012 is also a\<2In order to verify Theorem 1.1, we will prove that if a\z > | then the total area of the Delone triangles is larger than 4?r, what is readily absurd. It is natural to check what the triangle bound yields directly: Let us consider a Delone triangulation for some saturated family of n > 13 points on 52 such that the mutual distances between the points are at least 013. The area of each Delone triangle T satisfies \T\ > \T(al3)\ > T(f )| = 0.551285... according to Lemma 2.1. Since the number of Delone triangles is 2n — 4 by the Euler formula, and 24|T(|)| > 47r, we deduce that n — 13. On the other hand, 22 |T(^)| < 47r, therefore we search for six Delone triangles whose total area is at least 3.8. We can not ensure this fact for any extremal arrangement, but for a one where the number of pairwise distances that are ais attains its possible minimum. We will apply the triangle bound to the 16 remaining Delone triangles, and obtain a contradiction with (1) by (3)
16 |T(|)|+3.8 > 12.62 >47r.
Let pi,... ,pis € S2 satisfy that the pairwise distances are at least aia, and number of pairwise distances that are 013 attains its possible minimum. We colour the spherical segment pipj red if the distance of pi and PJ is a\^. The geometric graph on the thirteen points resulting this way is called the red graph. The maximality of 013 yields that there exist some red edges. Any circular disc whose diameter is a red edge contain no other points from the family than the endpoints, therefore the red edges are edges also in
106
BOROCZKY
the Delone triangulation. Since the number of red edges is minimal for Pi, • • • 5 Pi3> we deduce that • at least three red edges meet at each of the vertices, and • the red edges divide S2 into convex polygons whose sides are of length 013-
Any such convex polygon is either a regular triangle, a rhomb, or a pentagon because a\^ > |. Next we claim that the red graph has no isolated vertex. Otherwise, let P be a red fc-gon, k < 5, which contains an isolated vertex of the red graph. Now P contains at least k triangles in any Delone triagulation, and hence \P\ > k - \ T ( a \ % ) \ . On the other hand, the area of P is at most the area of the regular Ar-gon of edge length 013 according to the isoperimetric inequality for polygons (see say A. Florian [7] p. 183). This is absurd because a\^ < a\^ yields that the circumradius of the fc-gon with edge length aia is less than 013. In turn, the claim follows. For any red rhombi or pentagon, one or two diagonals, respectively, occur as edges of the Delone triangulation. We call these diagonals Delone diagonals. We write S((p) to denote the square of side length ?, and 0:3 ((p) and Oi±((p) to denote the angles of T(c/?) and S(
«3(f)+<*4(f)=7T.
We recall two well-known statements (Facts 1 and 2 below), which are consequences of the following elementary fact: Let pqr be a spherical triangle. Then the set of those points r', which are not separated from r by the line pq, and for which \pqr\ = \pqr'\ is a circular arc that passes through r and the antipodals of p and q. This circle is usually called the Lexell circle of the triangle pqr. We note the last property of the Lexell circle, Fact 1 and Fact 2 are stated as Proposition 2 (vii), Proposition 2 (viii), and Proposition 3 (i), respectively, in the paper K. Boroczky and L. Szabo [3] in this volume. Fact 1. Assume that two sides of a triangle is given, and the angle enclosed by these two sides decreases from TT to zero. Then the third side decreases, and the area of the triangle increases until the center of the circle passing through the vertices is separated by the third side, and the area decrease?, after that position.
THE NEWTON-GREGORY PROBLEM
107
Fact 2. Given a circular arc 7 connecting p and q, moving r along 7 towards the midpoint of 7 increases the area of the triangle pqr. We need estimates on the area of red pentagons, and first we consider certain quadrilaterals: PROPOSITION 2.2. Let Q = pqrs be a convex quadrilateral Leaving the sides of Q unchanged, if we increase /.qps from its minimum then the area of Q increases until the points p, q, r, 5 lie on a circle, and the area of Q decreases after that position. Proof: Fact 1 yields that the angle /.qrs and the diagonal qs increase, while the angles /.pqr and Zjpsr, and the diagonal pr decrease. Thus by symmetry, it is sufficient to verify the following statement: Let us assume that the circular disc whose boundary passes through p, q and s contains r in its interior. If we increase /.qps by any small amount then the area of the quadrilateral pqrs decreases. We write P0)<70) r o ? s o to denote the new positions of p, g,r, s, and QQ to denote the new quadrilateral. Let t be a point on the circle such that r lies in the interior of the quadrilateral P — spqt, and together with Q, we deform P into the quadrilateral PQ = sopoqoto keeping the lengths of the sides of P. Let us consider the points rq and rs in PQ where the triangle qorqtQ (the triangle SQ^O) is congruent to the triangle qrt (the triangle srt). Now Fact 1 yields that d(qo,rs) > d(qo,r0) and d(so,rq} > d(s 0 ,^o) 5 and hence we deduce again by Fact 1 that the interiors of QQ and the triangles qorqtQ and SQrsto are disjoint. In particular, it is sufficient to prove that \PQ\ < \P\. Finally, we write g to denote the radius of the circle passing through p, q and s, and place the circular cap of radius Q on top of each side of PQ. According to the isoperimetric inequality (see say A. Florian [7] p. 183), the union of these four arcs encloses an area which is less than the area of the circle with radius Q, and hence \PQ\ < \P\. QED PROPOSITION 2.3. Let P be a red pentagon. Then (i): | P | > | T ( f ) | + |S(f)| = 1.91...; (ii): if the angle at the common endpoint of the Delone diagonals is at most 3 then \P\ > 2.16. Proof: We denote the vertices by q\,... ,95 where q\ is the common endpoint of the Delone diagonals. Our argument is based on deformation using Proposition 2.2. During the deformations, we keep the properties that side length are of y? = 013, and the diagonals are of length at lerist co. In addition, we keep the Delone diagonals, and keep that the angle at q\ and 9s (at qi and 94) is at least the angle at #2 (at 95).
108
BOROCZKY
We may assume that P is not the regular pentagon since that has the maximal area according to the isoperimetric inequality for pentagons. First we consider (ii). If ? is given and the angle at q\ is at most 3 then the area of P is minimal if the angle at q\ is 3, and the pentagon is symmetric in the perpendicular bisector of a diagonal ending at then we obtain a decreasing family of sets. Therefore the area is minimal if ip = |, and hence P\ = 2.169... . For (i), we allow that an angle of P is possibly TT. If (p is given then the minimal P is a triangle whose two sides are 2ip and one side is (p. Now Fact 1. yields that among these triangles, the area is minimal for (p = |, and in this case P is the union of a regular triangle and a square. OED Fact 1. yields that the Delone diagonal of a red rhombi R connects two vertices where the angle a is at least 0:4(013), and the area of .R is a decreasing function of a. PROPOSITION 2.4. Let y>\, and let the rhombi RI,... ,Rk and the triangles T\,... , T/ form a neighbourhood of a common vertex p without overlapping. In addition, assume that 2k + I > 6, the sides of the rhombi and the triangles meeting atp are of length (p, and the angle atp of a rhombus (triangle) is at least a±((p) (a^(ip)). Then 2k + I = 6, and |fli| + ... + | J R fc | + |Ti| + ... T , | > 2 - T ( f ) | + 2 - 5 ( f ) | = 3 . 8 2 . . . .
Remark: A triangle T{ in this lemma will be either a red triangle, or a triangle that is cut off by a Delone diagonal from a red rhombus or a red pentagon. Proof: We observe that 0:3(?) and a±((p) satisfy that a^((p] < a^((p} < 2 0:3 (<£>). First assume that k < 2. Then the sum of the angles at p is at least 20:3(1) + 2a4(|) = 2?r, therefore we have two squares 5"(f) and two regular triangles T ( f ) . So let k > 3, and hence considering the sum of the angles at p show that k = 3 and I — 0. We cut each Ri, i — 1,2,3, into half by the diagonal that does not contain p, and write T( to denote the triangle that is the half, which contains p. It follows by Fact 2 that the sum of the areas of T{, T^ and Tg is minimal then the angle of the two of the triangles at p are the possibly minimum. In particular, two of the rhombi are squares S((p). Now decreasing ip decreases the areas of the rhombi R\, R<2 and R^. Thus ? = |, and the third rhombus is the union of two regular triangles. OED Now Theorem 1.1 is a consequence of the following improvement on the triangle bound for six of the triangles:
THE NEWTON-GREGORY PROBLEM
109
LEMMA 2.5. Let us consider a Delone triangulation of some 13 points on S2 such that the mutual distances are at least 0^3. If ais > ^ then there exist six triangles of the Delone triangulation meeting at a common vertex whose total area is larger than 3.8. Proof: The Delone triangulation on thirteen vertices has a vertex p\ of degree at least six by the Euler formula. We will find the six triangles for Lemma 2.5 at p\. Case I. There exists no red pentagon such that some Delone diagonal ends at pi. If pi is the vertex of a red rhombus or a red pentagon then this red polygon has a Delone diagonal that cuts off p\\ in particular, cuts off a Delone triangle that is of the same kind as the triangles in Proposition 2.4. Therefore Proposition 2.4 yields Lemma 2.5. Case II. There exist a Delone diagonal of some red pentagon, which ends at pi. If at least two red pentagons meet at p\ such that the Delone diagonals of both pentagon meet at p\ then Proposition 2.3 (i) provides six Delone triangles with total area at least 3.82. Therefore let P be the only red pentagon, such that p\ is a vertex, and has a Delone diagonal that ends at pi. We write p\,... , p^ to denote the vertices of P in cyclic order in a way that the diagonal pips is a Delone diagonal. If pi is the end point of exactly one Delone diagonal then p5p3 is the other Delone diagonal. We write p'3 to denote the vertex of the rhombus R — pip2p'sp5 opposite to p\. Since pipzPz is a Delone triangle, p$ is not contained in the interior of the circular disc determined by P1,P2 5 P3, and hence the point p% lies in the circular disc determined by pi,p2,P5- We deduce that /.p2pip$ > ^4(^13). Next, we observe that p± is not contained in the interior of the circular disc determined by P2,P3,P5 because p^psps is a Delone triangle, which in turn yields that the centre c of the circular disc determined by P2,P3,P5 lies on the same side of the great circle psps as P2. Therefore the triangle P2P3P5 has larger area than the triangle according to Fact 1., and hence the total area of the Delone triangles and PIP3P5 is at least \R\. Now if we replace the quarilateral P1P2P3P5 by the rhombus R then we decrease the total area of the Delone triangles at pi, and R can be one of the rhombi Rj in Proposition 2.4. Therefore we will consider only the rhombus R instead of P, and the analogous argument as in Case I based on Proposition 2.4 yields Lemma 2.5. Finally, we assume that pi is the vertex of exactly one red pentagon P, and Delone diagonals of P end at p\. If the angle of P at p\ is at most 3 then the total area of the three Delone triangles inside together with any other three Delone triangles is greater than 2.16 + 3|T(|)| > 3.81 according to
110
BOROCZKY
Proposition 2.3 (ii), confirming Lemma 2.5. If the angle of P at p\ is larger than 3 then the number of Delone triangles which are not contained in P and meet at p\ is three, and two of these triangles form a red rhombus RQ whose larger angle is at p\. Now the angle of RQ at p\ is at least 2?r — a(|) — 3, and hence the possible minimum of \Ro\ is obtained when the angle at p\ is minimal and all side lengths are |. We deduce that \Ro\ > 1.34. On the other hand, we have already seen that |P| > 1.91, and the area of the sixth triangle at p\ is larger than 0.55, which in turn yield that the total area of the six Delone triangles at p\ is larger than 3.8. Therefore the proof of Lemma 2.5, and in turn of Theorem 1.1, is now complete.
REFERENCES [1] M. Aigner, G. Ziegler: Proofs from THE BOOK. First edition, SpringerVerlag, 1999. [2] M. Aigner, G. Ziegler: Proofs from THE BOOK. Second edition, Springer-Verlag, 2001. [3] K. Boroczky, L. Szabo: Arrangements of thirteen points on a sphere. (see this volume) [4] C. Bender: Bestimmung der grossten Anzahl gleicher Kugeln, welche sich auf eine Kugel von demselben Radius, wie die iibrigen, auflegen lassen. Arch. Math. Phys. (Grunert), 56 (1874), 302-306. [5] L. Fejes Toth: On the densest packing of spherical caps. Amer. Math. Monthly, 56, (1949), 330-331. [6] L. Fejes Toth: Regular Figures. Pergamon Press, 1964. [7] A. Florian: Extremum problems for convex discs and polyhedra. In: P.M. Gruber and J.M. Wills, editors, Handbook of convex geometry, 179-221, North-Holland, Amsterdam, 1993. [8] S. Giinther: Bin stereometrisches Problem. Arch. Math. Phys. J (Grunert), 57 (1875), 209-215. [9] R. Hoppe: Bemerkung der Redaction. Arch. Math. Phys. (Grunert), 56 (1874), 307-312. [10] J. Leech: The problem of the thirteen spheres. Math. Gazette, 40 (1953), 22-23. [11] K. Schiitte, B.L. van der Waerden: Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand eins Platz? Math. Ann., 123 (1951), 96-124. [12] K. Schiitte, B.L. van der Waerden: Das Problem der dreizehn Kugeln. Math. Ann., 53 (1953), 325-334. [13] Ch. Zong: Sphere packings. Springer-Verlag, 1999. E-mail address: boroczkyScs.elte.hu ''Karoly Boroczky''
ARRANGEMENTS OF 13 POINTS ON A SPHERE
KAROLY BOROCZKY 1 Department of Geometry, Eotvos Lorand University, H-1117 Budapest, Pazmany Peter setany 1/c LASZLO SZABO 2 Computer and Automation Research Institute, Hungarian Academy of Sciences, H-llll Budapest, Lagymanyosi utca 11
ABSTRACT. Let a^ denote the maximum number with the property that one can place k points on the unit sphere S2 so that the spherical distance between any two different points is at least a^. The exact value of a^ is determined only for some small values of fc, namely, for k < 12 and k — 24. In this paper we are concerned with the first unsolved case k = 13 which is particularly interesting because of its close relation to several famous problems in discrete geometry. A certain arrangement of 13 points on S2 shows that ai3 > 0.997223592.... On the other hand K. Schiitte and B. L. van der Waerden proved that 013 < ^ = 1.04719755.... In this paper we prove that a13 < 1.02746114. 1. INTRODUCTION Let a,k denote the maximum number with the property that one can place k points on the unit sphere S2 so that the spherical distance between any two different points is at least a/-. The problem of determining the exact value of a/j together with the corresponding extremal arrangements of points was posed by the Dutch biologist Tammes [16] who was led to this problem by examining the distribution of the openings on the pollen grains of different flowers. The problem of Tammes is solved only for some small values of A;, for k = 3,4,6,12 by L. Fejes Toth [4], for k = 5,7,8,9 by K. Schiitte and B. 1
The work was supported by Hungarian Scientific Research Fund No. T029786. The work was supported by Hungarian Scientific Research Fund No. F035117. Ill
2
112
BOROCZKY AND SZABO
L. van der Waerden [14], for k = 10,11 by L. Danzer [3] (and, independently, for k = 10 by L. Ears [10] and for k = 11 by K. Boroczky [1]), and for k = 24 by R. M. Robinson [13]. The first unsolved case is k = 13 which is particularly interesting because of its relation to the so called Newton-Gregory problem. It is known that there was a famous controversy between David Gregory and Isaac Newton in 1694 concerning the following question: How many unit spheres can simultaneously touch a given unit sphere without overlapping each other. Newton conjectured that the answer was 12 while Gregory thought 13 was also possible. Surprisingly, it took more than two hundred years before K. Schiitte and B. L. van der Waerden [15] proved in 1953 that Newton's guess, the '12', was correct. For a more complete picture we note that several "solutions" were given in the physics literature in 1874/75 [8, 11] but these arguments are not accepted as mathematical proofs by the experts. We also note that J. Leech [12] sketched an elegant 2-page-long proof in 1956. Unfortunately, most of the details of that proof are left to the readers and a complete version of the proof has not been published yet. Recently, K. Boroczky [2] has given a new simple proof along a completely different line. The case k — 13 is also interesting from the following point of view. Consider a packing of congruent copies of a convex body K. Two members of the packing are called neighbours if their boundaries have a point in common. Following the terminology of L. Fejes Toth, the maximum possible number N(K] of neighbours of K in a packing of congruent copies of K is called the Newton number of K. A packing of congruent copies of K in which each body has exactly N(K) neighbours is called a maximal packing. Observe that the maximal density lattice packing of unit balls in E3 is maximal. A conjecture of L. Fejes Toth [6] states that any maximal packing of unit balls in E3 is essentially unique, i.e., it is composed of parallel layers of the same hexagonal structure as the layers in the densest lattice packing, and thus must have density —P=. According to L. Fejes Toth, the first step in proving vl8 this conjecture might be to give a "good" upper bound for 013. This paper is intended to complete this first step, namely we prove Theorem 1. a13 < a0 = 1.02746114. We note that one can construct an arrangement of 13 points on S2 such that the distance between any two points of the arrangement is at least 0.997223592... (see [7]). We state two interesting consequences of Theorem 1 for ball packings in E3. Theorem 2. Let B\, f?2, • • • •> -#14 be fourteen different members of a packing of unit balls in E3. Assume that each of the balls B
ARRANGEMENTS OF 13 POINTS ON A SPHERE
113
the ball B\. Then the distance between the centres of B\ and B\<± is at least 2.205279217705. Corollary 1. The distance between the centres of any two non-neighbouring balls in a maximal packing of unit balls in E3 is at least 2.205279217705.
2. PROOF OF THEOREM 1 For technical reason we will use the result of K. Schiitte and B. L. van der Waerden [15] which says that a\z < -|. We will assume, for contradiction, that ao < «i3 < f. First we recall some definitions. Let (p < ^. We say that a point set 'P on S2 is a (^-saturated point set if the distance between any two different points of 'P is at least (p and for any point q on S2 there exists a point of fJ* whose distance from q is smaller than 7 and (p < ^. Consider a set 7 of k points such that the distance between any two different points of IP is at least ip. Let us join two points of y by a segment if their distance is exactly (p. In this way we obtain a graph which is called the graph of 9. Among the sets of k points in which the distance between any two different points is at least
the edges do not cross each other, the edges form a connected system, the edges divide S2 into strictly convex polygons, each vertex is either isolated or of degree at least three.
By the indirect assumption there exists a non-trivial 7aQ > 27T. It is not hard to see that triangles, rhombi, or pentagons of the >p graph cannot contain an isolated point of the
114
BOROCZKY AND SZABO
interior of a hexagon of the (p graph, then this hexagon cannot contain other vertices of the (p graph in its interior and the degree of the isolated point is 5 or 6 in the Delone triangulation of the corresponding (p point set. Suppose that an isolated point of the (p graph is contained in the interior of a hexagon of the , arrange the isolated point in the hexagon, if it is possible, in such a way that its degree is 6 in the Delone triangulation. If it is not possible, then arrange the isolated point so that its distance from the vertex of the hexagon not adjacent with it in the Delone triangulation is as small as possible. Repeat the above process for each isolated point in the (f> graph. Then we obtain a point set which will be called a <^-final point set. Note that the ?-final point set obtained in this way is a ^-saturated point set, but it is not necessarily a (p point set. We will prove in Corollary 2 that the Delone triangulation of the yj-final point set contains two non-adjacent vertices of degree six. We will also prove in Lemma 18 that if the degree of a point is six in the Delone triangulation of the <^-final point set, then the sum of the areas of the six triangles adjacent to this point is at least |iS((^)| + 2|T(<^)| + |.R(?)|, where S(, and R(
1. For each point p in the interior of the circle C of centre o and radius - on S2 let p' denote the point of the segment o*p on S2 for which op' — [i • op. Then for any two interior points p, q of the circle C on S2 we have \L • pq > p'q'.
ARRANGEMENTS OF 13 POINTS ON A SPHERE
115
We will prove that if a curve 7 joining the points p and q on S2 is differentiable and its length is s, then the image 7' of 7 under the above map is also differentiable and for its length s' we have fis > s'. Fix the point p and the angle £opq = a and examine limg_>p 2_2__ If o,p, q are collinear, then, obviously, 2-2_ = fj,. Now assume that 0 < a < TT. Let r denote the point on the half line emanating from o and going through q for which or = op = x. Clearly, lim g _p £prq — lim?_,p £p'r'q' — |. Hence lim ? _ p 2J1 = if^f — v. Since the function sin x is strictly concave on the range 0 < x < TT, therefore sin/ux < yusinx which implies that v < [i. At the same time 2-£- = ^ and lim g _ p £qpr = \a — -|| = /3. Thus n.
lim
tan 2 (3 + 1
From this, using the differentiability property of 7, the assertion follows.
D
Turning to the proof of Theorem 2, let 01, o 2 , . . . , o14 denote the centres of the balls B\,Bi,... ,-814, respectively. Suppose, for contradiction, that oio14 < 2.205279217705. For 2 < i < 14 let pi denote the intersection point of the segment o\O{ with the boundary of the ball B\. Apply the map described in Proposition 1 with o* — p\± and A = ^- for the points Pi,pz,-.. ,^13. Now easy calculation shows that the distance between any two different points of {p^iP^i • • • iPi^iPi^} is at least CQ, a contradiction.
4. GENERAL POLYGONS In this section we prove some properties of spherical polygons. First we introduce some notations. For n = 3,4,5,6, let T(<^), S(ip), P^}-, and H((p] denote the regular spherical rc-gons of side length ?, respectively. For n — 3,4,5,6, let an(
116
BOROCZKY AND SZABO
(ii) Let pqr be a spherical triangle. Now pq = qr if and only if /.prq = /.qpr. On the other hand pq < qr if and only if Lprq < £qpr. (iii) Let pqr be a spherical triangle. Then pq + qr > rp. (iv) // we fix the lengths of two sides of a spherical triangle and we increase the angle between them, then the third side increases. (v) Let o denote the centre of the circumscribed circle of a spherical triangle pqr. Then £rpq -f- A.rqp — £prq — '2£opq if pq does not separate r and o, while £rpq -+- £rqp — /(.prq = — lA-Opq if pq separates r and o in the circumscribed circle. Thus, if we fix p and q and we move r on the circle arc ^pq", then £rpq + /.rqp — £prq remains constant. (vi) The area of a spherical triangle with angles a,/3,7 is a + Q + 7 — TT. (vii) Let pqr be a spherical triangle. Then the set of those points r1 which are not separated from r by the line pq and for which \pqr\ = \pqr'\ is the fixed circle arc p'q' going through r where p' and q' denote the antipodals of p and q on S2, respectively. This circle arc is usually called the Lexell circle of the triangle pqr. (viii) Let pqr be a spherical triangle and let C denote its circumscribed circle. Let t denote the midpoint of the arc "pg" containing r. If we move r toward t on the circle C, then both \pqr\ and £prq strictly increase. (ix) Let pqr be a spherical triangle. Now pq + qr — TT if and only ij £qpr = TT. On the other hand pq-\- qr < TT if and only if £prq-\TT. Especially, if pq,qr < ^, then Lprq < ir — Lqpr. (x) Let pq be a great circle arc and let s be its perpendicular bisector great circle. For any point r of s we have /Lprq > pq with equality if and only if pr — ^. Furthermore £prq strictly increases if pr increases or decreases from -|. We continue with proving some further properties of spherical polygons. Proposition 3. (i) Fix the lengths of the sides pr and rq of a spherical triangle pqr and increase £prq from zero. Then \pqr\ strictly increases while the centre of the circumscribed circle of pqr lies in the interior of the hemisphere bounded by the line pq and containing pqr (i.e. £rpq -f Lrqp — Lprq > Q). The area of pqr attains its maximum if the centre of the circumscribed circle of pqr lies on the side pq (i.e. /Lrpq + A.rqp — £prq = 0). Finally, \pqr\ strictly decreases while the centre of the circumscribed circle of pqr lies in the interior of the hemisphere bounded by the line pq and not containing pqr (i.e. £rpq + £rqp — Lprq < Q). (ii) Let pqr be a spherical triangle which contains the centre of its circumscribed circle. If pq > p'q', qr > q'r', rp > r'p' for some spherical triangle p'q'r', then \pqr\ > \p'q'r'\ unless pqr and p'q'r' are congruent.
ARRANGEMENTS OF 13 POINTS ON A SPHERE
117
Proof, (i) The assertion can be proved easily by Proposition 2 (vii) and the argument used in its proof by the method of decomposition. (ii) By (i), one can decrease the area of a triangle • by decreasing an arbitrary side of the triangle if the centre of the circumscribed circle lies in the triangle, • by decreasing one of the two smaller sides of the triangle. Fix the triangle A' of side lengths a',b',c': and among the triangles A of side lengths a,6,c satisfying the conditions described in (ii) let A be such one whose area is as small as possible. Let a, 6, c denote the sides of A. If A is congruent with A', then we are done. If A is not congruent with A' and the area of A can be decreased by none of the two ways described at the beginning of the proof, then the centre of the circumscribed circle of A cannot lie in the interior of the triangle. Indeed, in this case only the lower bounds for the sides of A prevent the decrease of the area of A, which implies that the corresponding sides of A and A' are equal, i.e., A and A' are congruent, a contradiction. Thus the centre of the circumscribed circle of A lie on the (unique) greatest side, say on a, of A. Since a also cannot be decreased, therefore a = a'. This implies that a' > max(6, c) > max(6',c') and b > &', c > c'. Hence we can obtain a congruent copy of A' by decreasing the two smaller sides of A. From this |A| > |A'| follows. D Proposition 4. A polygon of maximal area among polygons of given side lengths is inscribed in a spherical circle. Proof. This is an immediate consequence of the well-known isoperimetric inequality. D Proposition 5. (i) // <7i3 < ^ and ^919293 — f are fixed and q\q^ decreases in a triangle 919293, then /^9i9s92 decreases, / 9391 92 increases, and q^q^ increases. (ii) If 93^1 < ^ is fixed and 9293 < 9391 < 9i92 in a triangle 919293, then ^9i9s92 > 03(9391) with equality if and only if the triangle is regular. (iii) If q\qi + 9293 < it in a triangle 919293 and q{ and q'3 are such points of the sides q\q<2 and q^q-2, respectively, for which qiq( = g3g3, then (iv) Suppose that the vertices q\ and q? and the sum ^.q-^qiq^ + are fixed in a triangle K> then s = 9193+9392 attains its minimum when q\qz = q^q? and the function s(^.q^q\q2] changes monotonously
118
BOROCZKY AND SZABO
from the symmetric position. We note that if A.q?,q\qi + then s — TT, a constant.
Proof, (i) Consider a triangle gig2gs in which qiq% < q\qi and . Let ^2 and 92 denote the images of gi under the reflections with respect to g2 and g2, respectively. Since gigs = q'2q3 and gig3 = q'2q3 in the triangles q\q3q2 and 9ig3g 2 , respectively, and q\q'2 < q\q'2, therefore £q\q3q2 < ^qiqsq? and thus /gig392 < ^q\q^qi- Recall that qiq3 < f , hence f/i2,293, Z.q3qiq2. Suppose, for contradiction, that £q$q\qi < ^gsgig2- Let g denote the intersection point of the line gsg~2 and the segment q\q 23- Suppose, for contradiction, that q2qs < (the case q^q^ — q^q?, cannot occur because q\qi < qiq^)- Now replacing with g23 and 2<2i with 92^3 in the previous argument we obtain that ^3qi is minimal if and only if q^qz = q$q\- Thus the minimum possible value of £qiq3q2 is a3(q-3qi). (iii) Set Zr/ 2 gir/ 3 = fti and /f/29s 0 where qiq3 - q(q'3 « (cos 0i + cos/33)£ means that lim E _o 9 l g 3 ~' 7 i g 3 _ CQS^J + cos ^3. ^.From this the assertion follows. (iv) We deal only with the case £q3q\q2 + ^3#2 71" can be settled similarly. Now gigs + gsg2 < TT. Suppose that < ^q?>qiq\- Leaving the vertices q\ and q2 and the sum £.q$q\q2 + unchanged, increase £qzq\q
g2gs) = (gig 3 - gigs) + (^q3 - g2gs) ~ -(ggs - gg3 cos «) + (993 - 99s cos a) =
(99s - 993)(1 + cos a). Since gig3 + g3g2 < TT, therefore singig 3 > sing 2 gs (do not forget gigs > 9293) which implies that qq'3 > ggs. On the other hand limj^o^ = ^9i9392 ^ K- Thus (gg3 - gg3)(l + cose) > 0 from which the assertion follows. This completes the proof of Proposition 5. D
ARRANGEMENTS OF 13 POINTS ON A SPHERE
119
The special case of the next lemma when q\qi > q^qz = (73(74 = q^q\ was proved by W. Habicht and B. L. van der Waerden [9]. Lemma 1. Let 91929394 be a convex quadrangle. Leaving the side lengths of the quadrangle unchanged, if we increase A.q±q\qi from its minimum, then the area of the quadrangle increases until the points 91,92,9s, 94 become cocircular and then the area decreases. (The angle ^929394 and the diagonal 9294 increase, while the angles £q\qiq?>, ^9s949i> and the diagonal 9193 decrease, as Lq\q\qi increases.) Proof. The statement in brackets is obvious. By symmetry, it is enough to show that if the circle going through 91,92,#4 contains 93 in its interior and we increase A.q^q\qi by a sufficiently small amount, then the area of the quadrangle decreases. Let rs denote the intersection point of the circle going through 91,92,94 and the angle bisector of the (concave) complement of ^929394. Consider the quadrangle 9192^394- Leaving the vertices 91,92 and the lengths of the sides 9i92,92 r 3, r s94,949i unchanged increase £q\q\q Lq±q\92, hence ^q(r'3q2 > /94^s92). Then £q'4r'3q2 = £q(r'3q% + £q3r'3ql + ^9^392 and thus Zg|r3g2 > ^93^392 and £q3r'3q4 > Z.q3r3q4. This yields that q^q3 > 9293 and q'4q3 > q4q3. Let 3 be the interior point of the triangle 92^394 for which #293 = 9293 and g^ = g4g3. Then 91929394 is the image of 91929394 under the above deformation. Because of the above inequalities, we obtain the point q'3 by rotating the points q3 and q3 around q% and q'^ respectively, toward the segment 9294Hence the concave pentagon qiq\r'^q\q'^ contains the triangle 929394Now, by Proposition 4, we have |9i92^s94| > ki^7"^!- Subtracting the sum of the areas of the triangles r^q^q^ and r^q^q-^ from both sides of this inequality, we obtain [91929394! > |9i9293r39s94l- At the same time I9i929|7>39394l > I9i929 3 9 4 l from which I9i929s94| > |9i929394l follows. D We will frequently use the following consequence of Lemma 1. Remark 1. Let 91929394 be a convex quadrangle whose side lengths q\q<2, 9293?93945949i are fixed and q\qi — 9394. Then \q\929394) is maximal when = ^929394 (and /949i92 = ^9i949s^- If ^9i929s < ^929394, then < ^949i92 and q\qz (< 9294) is the Delone diagonal 0/51929394-
120
BOROCZKY AND SZABO
The special case of the next lemma when P is a pentagon of side length (p was proved by W. Schiitte and B. L. van der Waerden [14] using a result of W. Habicht and B. L. van der Waerden [9]. Lemma 2. Let (p < 012- If P is a convex pentagon of side lengths at most if, then P contains no point whose distances from its vertices are at least (p. Proof. (Indirect.) Let ge be a point in P for which qiq§ > <£, 1 < i < 5. Split P into the five triangles qiq^qe, #2936, 93^496, ?4(M6, q^qiq&- In eacn of these triangles the smallest angle is at the vertex q§. Since the sum of these angles are 2?r, therefore the sum of the angles of P is at least 4?r. This implies that the area of P is at least TT and thus the area of P( |T(?)| with equality if and only ifT andT(
4 and let qiqiqi+i, 2 < i < n — I, be n—2 triangles of the Delone triangulation of a point set. IfY^i=2 ^-QiQiQi+i < TT, then the points qi, 3 < i < n — 1, lie in the circle going through qn,q\,q<2. Proof. Obvious.
D
Proposition 7. Let
<*n((p). Proof. Since the radius of the circle going through qn-,qi-,q2 is a strictly increasing function of £qnq\q2, therefore, by Proposition 6, it is enough to show that we can arrange in only one way the points in the circumscribed circle of S(
ARRANGEMENTS OF 13 POINTS ON A SPHERE
121
Proposition 8. Let (p < a\2- If 9i92 = in a triangle 919293 of the Delone triangulation of a (p -saturated point set, then ^919392 < ^(v?) with equality if and only if 919293 is regular. Proof. Let q'3 be the midpoint of the circle arc q\q2 containing #3. Then ^9i9s92 < ^9i9s92- We know from the regular icosahedron that 2m(ai2) + ai2 = TT. This implies that 2m(<^) + y? < TT for 99 < 012- Hence, by Proposition 2 (x), we have ^919392 < QsC^) unless the triangle 919293 is regular. D Proposition 9. Let (p < Ij- one? consider the Delone triangulation of a (psaturated point set Q = {91,92, • • • ?9fc}(i) If 919293 is a Delone triangle, then ^919293 < 20:3(92). (ii) /fgi9293 and q\q^q^ are Delone triangles and q±q\ = (p, then ^9491 92 > ^9i929s wz£/j equality if and only 2/9293 = y? one? gigs = 9294(iii) If 9192 < d((p), then q\q^ is a Delone edge unless there exist two points of Q, say q% and q±, for which qiq^q^q^ is congruent with S( d((p) with equality if and only if there exist two points of Q, say q$ and q±, for which gi#3g24 is congruent with S(
/3?i2 > ^-qiqiqz- On the other hand, if <7i3 > ?2?3, then consider the supporting circle going through
£q\q\qi = £q\qiqz(iii) First note that four points can be arranged in the circumscribed circle of S((p) only at the vertices of a square. Let h denote the midpoint of the segment 9192- If 9i92 < d((f), then the circle of centre h and diameter d((p) can contain no point of Q other than q\ and q?. Therefore there exist two points hi and h^ on the perpendicular bisector of the segment q\q, and ^949i9s + ^9s9i92 < K, then the centre c of the circumscribed circle of the triangle 929394 lies in the interior 0/^929394.
.122
BOROCZKY AND SZABO
Proof. Assume that 9493 > 9293. Since only the greatest side of a triangle can separate the triangle from the centre of its circumscribed circle, therefore it is enough to show that 9493 cannot separate c from the triangle 929394 (if c G 9s94i then 9493 separates c from 929394, by definition). First examine the case A.q^q\q<2 < 20:3(92). Consider the circle going through 94,91,92- The radius of this circle is at most (p. Let c\ denote the centre of this circle. By Proposition 6, this circle contains the point 93. Since c\q\ < 9491, therefore, by Proposition 2 (x), we have £q$ciqi — ^9iCi92 > asCy). The diameter of the circle sector q\c\qi is 92 and 9293 > 92, hence ^930192 > 0:3(92). Thus A.q^c\q\ + ^910192 + ^920193 > 803(92) > TT which implies that c\ lies in the interior of ^939491. Since c\q\ > 091, it follows that c also lies in the interior of ^939491.
FIGURE 1. The case ^949192 > 2a 3 (<^). Next we deal with the case £.q±q\qi > 1a^((p). Suppose, for contradiction, that 9394 separates c from 929394- Let h be the midpoint of the segment 9493 and let c-2 denote the centre of the supporting circle going through 91,93,94. The situation is shown in Figure 1. Since 92 does not lie in the interior of this circle, therefore hc^ > /ic, and thus (p > 0294 > 094 = 092- This and Proposition 2 (x) imply that ^94092 > /949i92 > 20:3(92). Since 9293 > <£>, we have ^92093 > 0:3(9?), hence Aq^cq^ + ^.q^cq^ > 80:3(9?) > TT, a contradiction. This completes the proof of Proposition 10. D 6. (p GRAPHS Let k > 13 and V3 < f. Consider a set IP of k points in which the distance between any two different points is at least 99. Let us join two points of f by a segment if their distance is exactly
ARRANGEMENTS OF 13 POINTS ON A SPHERE
123
distance between any two different points is at least (p consider one whose graph has as few edges as possible. This graph will be called a (f> graph of k vertices and the corresponding point set will be called a (p point set of k points. It is easy to see that in a non-trivial 13 and
5. Then in a
, then qqn <
q^qs, then If qlq3 = q^qs, then all four of the above inequalities become equalities and gi?2?394?5?6 is centrally symmetric.
124
BOROCZKY AND SZABO
(ii) Let (p < -|. Let 9i929s94959e be a convex hexagon of side length (p and diagonal lengths not less than (p. In each pair of opposite angles of the hexagon consider that one which is not smaller than the other one. Then these three angles are either at the vertices 91,93,95 or at the vertices g 2 ,94,96(iii) Let ip < ^. Let 919293949595 be a convex hexagon of side length (p. If the diagonals q3q& and 9092 of this hexagon are Delone diagonals, then (iv) Let (p < -|. Let 91939495 be a convex quadrangle where 9394 — q&q\ = 9 < 9i94 < TT - Lp and 9193 > q±q&. Then ^.qiq3q4 < Zg 4 g 6 9i. If 91 93 = 9496, then £qiq3q4 = /949e9iProof, (iv) The case of equality is trivial, therefore assume that ^496- The diagonal q\q± splits the quadrangle into two triangles. For the side lengths of these two triangles q^q\ = 9394 and 9194 = 9491 hold, thus /969i 94 < ^939491If we rotate the triangle 959194 in such a way that qe and q\ are carried to 93 and 94, respectively, then g4 is carried to an interior point q\ of the region /34gi, onto the circle C of centre #4 and radius 94^1. Let q'3 denote the antipodal point of q3 on S2 and consider the hemisphere bounded by the line q3q$ and containing q\. Since the point q'3 lies outside C, therefore any line going through q3 intersects C in exactly one point inside the above hemisphere. This implies that £q\q3q$ < £q\q3q± = /.q^qQq\. (i) easily follows from (iv), and (ii) from (i). (iii) Since q3 does not lie in the interior of the circle going through the points g6,9i,Q2, therefore ^.q@qiq2 < £q\qiq3. We may assume that 6#3 > V otherwise £q3q6qi > /Lq\q<2q3 and £q5q6qi > £q3qeqi. Now, using the fact that 5 does not lie in the interior of the circle going through the points 96,92,93, we obtain that Zg3g296 < ^9s9e92 and thus Zg!g293 < ^959e9iThis completes the proof of Proposition 12. D Proposition 13. Let
f an(i 9s9s > 9-,we can apply Proposition 12 (iv) for the quadrangles. Hence ^91^293 < ^9i9e9s an(^ ^9s949s ^ ^939695- Since the greatest angle of the hexagon is ^959691, therefore, by Proposition 12 (ii), we have ^929394 < ^9s9e9i, ^949596 < ^919293, and /9e9i92 < /9s9496- Taking these inequalities together with ^959691 = ^.q^q'6qi into account we obtain
ARRANGEMENTS OF 13 POINTS ON A SPHERE
125
that the sum of angles of the hexagon 9i929s949s96 is at most 4?r, a contradiction. D In the next five lemmas we will examine the structure of the Delone triangulations of (f> point sets of k points for a&+i < (p < ^. We note that these (p point sets are also ^-saturated point sets. This implies among others that the radii of the circumscribed circles of the Delone triangles of these point sets are at most 9. Lemma 4. Let k > 13 and max(|-,afc+i) < ? < -|. Then in a (f> graph of k vertices does not exist an empty convex hexagon q\929394 959e of side length (p with the property that one of the vertices of the hexagon, say q§, is adjacent to all Delone diagonals of the hexagon. Proof. (Indirect.) Suppose that 9692,9693,9694 are Delone diagonals in 9i929394959e- It follows from Remark 1 and Proposition 12 that the greatest angle of the hexagon is ^959591 • Let q'6 denote the image of q6 under the reflection with respect to the diagonal 9195. Proposition 13 implies that 9g9s > (p. We show that min(9692,9694) > <£. By Proposition 11, this proves the lemma. We may assume that 9592 < 9e94- Then ^959192 < ^919594 and thus 9692 < 9694- Therefore it is enough to deal with 9692We prove that, with the given structure of the Delone diagonals, q'6q2 attains its minimum if 929s949s96 is an inscribed pentagon. First assume that 9e929s94 is not an inscribed quadrangle. Fix the points 94,95,96,91 and leaving its side lengths unchanged deform the quadrangle 9i929s94 in such a way that ^929194 decreases. Then 9692 decreases, furthermore 9296 decreases, while 9395 and 9395 increase. This implies that the structure of the Delone diagonals remains unchanged until 9e929s94 becomes an inscribed quadrangle. Thus q'6q2 can be minimal only if 9e929s94 is an inscribed quadrangle. Next, if 9s949s96 is not an inscribed quadrangle, then 9594 < 9395- Fix the points 96,9i,92,93 and leaving its side lengths unchanged deform the quadrangle 93949596 in such a way that ^959693 decreases. Then 9692 decreases, furthermore 9395 decreases, while 9495 and 9492 increase. This implies that the structure of the Delone diagonals remains unchanged until 93949595 becomes an inscribed quadrangle. Thus 9692 can be minimal only if 93949596 is an inscribed quadrangle. Since q'6q<2 attains its minimum, therefore in this case both of the above quadrangles are inscribed quadrangles, i.e., 9293949596 is an inscribed pentagon.
126
BOROCZKY AND SZABO
We have to show that Lq'&q\q 0:3(9?) provided that q^qsq^ 56 is an inscribed pentagon. Since X^2 — j, then 0:3(9?) + 0:5(99) = TT (cf. the tessellation (3,5,3,5)), thus 0:3(9?) + a 5 ( f ) > K f°r 9? > f- This implies that gluing the polygons T(9?) = q'lq^qQ and P((p) — 2(73(?4(?5<76 along their common sides yields a hexagon H' in which there are concave angles at the vertices q'2 and q'6. Comparing the hexagons H' and HQ we obtain that TO > ^5(9?) and q^qe > q'2q'6. Hence /g39i9s = ^qiqe > 0:3(9?) in #o from which q2q'6 > 9? if < f 5 then, by Proposition 2 (x), A.q^q\q-^ > qsqs- Consider again the hexagon H' = T(9?) U -P(9?). Obviously, ^3^5 > 93^5. Set 935 = 2m. The decomposition of P(9?) yields that .
.
27T
.9?
.
. 7T
smm — sm 7-5(9?) sin — and sm —- = sin rs(9?) sin — o ^ o from which sin m = 2 cos fO sin ^. At the same time ^ (
. 03(9?) sm 2
1 2 cos f
Now the desired inequality 2m > 0:3(9?) follows from the inequality \/2
v/5- 1 _
This completes the proof of Lemma 4.
1
D
Lemma 5. Let k > 13 and max(|-,ajt+i) < 9? < f • Then in a (p graph of k vertices does not exist an empty convex hexagon
ARRANGEMENTS OF 13 POINTS ON A SPHERE
127
Let q'6 denote the image of q& under the reflection with respect to the diagonal q\q*>. We show, as in the proof of Lemma 4, that g;6 > q±qi in such a way that X^2 (p. Thus we may assume that during the deformation we reach the position where q§q± = q±q<2 before q% becomes adjacent to the circle going through 92? 4 5 6- Then the structure of Delone diagonals remains unchanged, of course. Fix the triangle q^qiqe and the lengths of the sides of the hexagon <7i<7293<7456 and increase q\q^ in such a way that 6<74 = 4?2 remains true. Now /.qiqsqs decreases and thus 4.q'6qiqe increases. Hence q'6q<2 decreases. Increase the distance q\q$ until q^q^q^q^qQ becomes an inscribed pentagon. Then we can use again the same argument as in the proof of Lemma 4 to show that q'6q2 >
128
BOROCZKY AND SZABO
FIGURE 2. Illustration to the proof of Proposition 14. such a way that for the new positions d[ and d'2 of di and d^-, respectively, /Ld\cd\ — Zc/2cd2 holds. The situation is shown in Figure 2. For i — 1,2, set /.diad'j = Si and /.dibd'j — £;. Then Lad\b — /.ad'fi = /.cadi + £cbdi — A.cad\ — /Lc\)d\ — Si — £i for i — 1,2. To prove Proposition 14 it is enough to show that &\— £\ < S? — e?. Since the arcs did^ and d^d^ are congruent and adi < ae?2, ad\ < ad'2, bd\ > bd%, bd\ > bd'2, therefore, by Proposition 2 (viii), Si < 6-2 and e\ > £2 from which the assertion follows. D Lemma 6. (i) Let (p < ^. There exists a uniquely determined convex hexagon Hn = of side length (p such that in^n^ = ^.n^n^nQ — ^.n^nQUi and = (f> holds for some point n'6 ^ UQ. Setting ip(p) — £n$nQn\ and i^*((p} = A.riQn\n<2,, the function V'Cv) zs strictly increasing while i^*((f) is strictly decreasing. (ii) Let k > 13 and max(^,afc + i) < ^.q^q^q^, then ^56
ARRANGEMENTS OF 13 POINTS ON A SPHERE
129
For 5 = Tij we have ^n'^n'^ni = TT — 03(9?) > 04(9?), hence from the triangle n^n'^n'^. This implies that lA.n-2.n'^n\ + 0:3(9?) < + 0:3(9?) < TT = /rijWgni. Thus 2/712^1^1 — /T^n^ni < — 0:3(9?). For ^5 = n'2 we have ^ < ^.n^nin'^ = /n27i27ii + 0-3(9?) since in the triangle 7iin 2 7Z2 the sum of the two smaller angles is equal to Ln^n^'^- This implies that S2£n-2n'2n\ > TT — 2013(9?). Therefore 2/n2« 2 n i ~ ^n'^n'&n\ — 2/7i27i'2ni - TT + 0:3(9?) > -03(9?). By Proposition 14, the function 2/712^5711 — /dsngTii attains the value — 0:3(93) exactly once. Let 715 denote the position of d$ corresponding to this value. ___ ^ Note that if 0^5 lies in the interior of the smaller arc n27i5, then /.d$n'&n\ < ^.n^n'6n\ and the corresponding value of the function is greater than — a 3 (<^). Now we have 2/711715712 + 0:3(92) = /Ln^n'&n\ for the point 715. Let HQ ^ n'6 denote the point for which HQU\ = UQU^, = 9? and let 714 and 713 be the images of the points n\ and ne, respectively, under the reflection with respect to the midpoint of the segment 712715. It is easy to see that in this way we obtain a hexagon Hn described in Lemma 6 (i). Observe that if we fix the points 7ii,ri2,7i 6 , the hexagon Hn is uniquely determined. Indeed, the greatest angle of the hexagon Hn is at the vertex n6, hence 4.ninf6n5 = /nin 6 7i 5 > 0:6(9?) > 203(9?). Thus /n57i67i2 < 2?r 80:3(9?) < TT. Therefore it is enough to move d$ on the smaller arc n^n^. To complete the proof of (i) it remains to show the monotonicity of ^(9?) and V;*(v?)Since ^(9?) = £n$n6n\ = /TisTigTZi, therefore we will examine the position of the points HI , 712 , 715 , n'Q . Suppose, for contradiction, that ^(9? + ^9?) < t/>(9?) for a suitable small positive A(p. We will change the position of the four points in three steps to reach the position corresponding to 9? + A(f> from the position corresponding to 9?. If ^(9? + Z\9?) < ^(9?), then first rotate 715 around n'6 until ^.n^n'&n\ = ^(9?+Z\9?). Applying Proposition 14 with a = n?, b = HI, c — 7Z6, and d = 715 we obtain for the new position of 715 that 2/711715712 + #3(9?) > If ^(9? + A
holds for the new point n5. Then rotate HI around n'6 until /7ii7i67i2 = 03(9? + ^9?). Now increases, therefore the left hand side of inequality (*) becomes (strictly) greater than the right hand side.
130
BOROCZKY AND SZABO
Leaving the point n'6 and the directions n 6 ni,n 6 n2,n 6 W5 unchanged, increase the lengths of the segments n 6 ni,n 6 n2,n 6 W5 to (p-\-A(f>. Then Ln\n$n'6 and Zn 6 n5iZ2 increase, hence ^nin^n^ also increases. Thus the left hand side of inequality (*) increases again. Now observe that the last position of the points fti,n2,n5,7i6 corresponds to ? + A(p for which inequality (*) must be equality, a contradiction. This proves that VKv 7 ) 'l&a strictly increasing function. Next we examine the function ijj*(. We know from the previous argument that A.n^n'6n\ < Ln$n'&n\ and a 3 (^) < a3((f>-\- A Zn 5 n 6 n 2 . On the other hand Oi^(ip} < a^((p + A(p) < TT — 0:3 (y> + A(fi) < A.n§n'&ni. Therefore the area of the triangle n$n'&n
This proves that V;*(v?) ^s a strictly decreasing function. (ii) Consider an empty convex hexagon 9i(?23456 of side length (p satisfying the requirements of Lemma 6 (ii), i.e., in which g36>3?5,62 are Delone diagonals and ^.q^q^qi > jLq^qy,^- Let q'6 ^ q@ denote the point for which q'6q5 = q'6qi = p. Since ^q^qsqi > ^.q^q^q^-, then, by Proposition 12 (ii), we have Also £q4q5q6 > ^.q3q4q5, by Proposition 12 (iii). Hence Now £q4qsq'6 > £q'6qiq2 also holds, thus q±q'& > If 92^6 ^ V7; then, taking Proposition 13 into account as well. Proposition 11 shows that the number of edges of the ip graph is not as small as possible, a contradiction.
ARRANGEMENTS OF 13 POINTS ON A SPHERE
131
If /56<7i > ^234, then, fix the points 5,6> 92 and leaving its side lengths unchanged deform the quadrangle 2<7345 m such a way that ^234 increases to /.q^qeqi. Now the structure of the Delone triangulation of the hexagon q\q2qzq^q?>q& remains unchanged and the distance q<2q'6 and the angle £q$q§q\ also do not change. Furthermore ^.q^q^qi remains the greatest angle and the the hexagon becomes centrally symmetric. Consider the hexagon Hn with the point n'Q and arrange them in such a way that n'6 = q'6, HI — q\, and the points n2 and q2 are not separated by the line q'6q\. We will concentrate on the points 715, n'6 = q'6, n\ = qi, and n-2 of Hn. Suppose, for contradiction, that ^>(<^) > /Lq$q§q\. Then
hence £n5n'6ni > Consider the point 55 as the point d$ in the construction of the hexagon Hn in (i) which, therefore, lies in the interior of the smaller arc n'^n^ and thus 2Zn 2 5fti - ^.q^n'6ni > -a3(<^). This implies that l^n^q^qi + c*3(v?) > Let 94,93, 9g denote the images of £q$qQq\. In the centrally symmetric hexagon 9i<7234<756 the greatest angle is ^q^qeqij therefore A.q'^q^ > ^.q^q^qQ. At the same time, by the centralsymmetry, gsgi = q'4n-2 and ^5^1 = 42- Thus, comparing the quadrangles qiq5q'4ri2 and qiqsq^q?,, we obtain that Zri2 V? a Thus £q$qQqi > t/>((/?). If ^Lq^q&q\ coincides with ^n. in the hexagon 9i2<734<M6,
contradiction as we have already seen. = tl>(<£>) and 52^6 ^ ^5 then the hexagon Further, since max(/gig2?3?^949596) < therefore gi293456 also coincides with
n-
Now the proof of Lemma 6 is complete.
D
Let j < (f < -|. Let ^ = ii^2^3^4^5^6 denote the degenerated convex hexagon of side length (f> for which trfe =
13 anc? max(|-,afc + i) < in which q^qe^q^q^^qeq^ are Delone diagonals, then min(Z<7234,^56
132
BOROCZKY AND SZABO
If(f>> 0.805153655, then max(Zg6^g34?5) < ^*(v>)- The function $((p) is strictly increasing and TJ)((p) < We note that ^(1.02746114) = 3.092711117 .... Proof. Consider a convex hexagon H = gi2?3456 of side length (p whose Delone tessellation consists of the triangles qiq^qe and 345 and the inscribed quadrangle 2?356, and for which /234 < ^.q^q&qi and A.q^q\q^ — 0:3 (?) hold. Such a hexagon H is symmetric to the diagonal q\q^. For a given ^O Fix a position of Ht and arrange the hexagons Hn and 77 in such a way that ti — HI = ^-t^t^t^ = ^(v 7 )We examine what happens if we move the point 93 / £3 by a sufficiently small amount toward £3 on ^£3. We concentrate on the points ii, qi, 93, 94. For technical reason we change the conditions concerning #4. Instead of requiring that q4 G M4 we require that A-qiq^q^ remains unchanged. Observe that the fact that /23<74 strictly decreases under the original conditions is equivalent to the one that under the new condition q$ is carried into the interior of the region A.tj,t\t^. Consider the instantaneous centre m of the motion of the triangle 2?3#4For this point q^ G mt\ and mq^ _L t\qz- Obviously, q^ is carried into the interior of the region Z/3/^4 if ^_mq±t\ < ^. We show that /Lmq^t\ < ^. By Lemma 6, we know that £mt\t^ < Ln^n\n^ — \
+ 3 cos (p + 2 cos2 (p is a strictly increasing function. We know that as(f) = 1.1070... < 1.2566... = 3p and a 3 (^) = TT < ^, therefore a 3 (<^) < 2^ for f < 9? < ^,
133
ARRANGEMENTS OF 13 POINTS ON A SPHERE
q^ — Q3v^' <
FIGURE 3. Illustration to the proof of
<
.
For i = 2,3,4 let hi denote the midpoint of the semi great circle tiqit'^. Also, let h denote the midpoint of the semi great circle tin^t^. The situation is shown in Figure 3. For a given (p the points h,hz,h4 are fixed and hi moves on the smaller arc hh^. If ^ and q$ = /i3, then let q'4 denote the corresponding position of the point #4. If
Using the fact sin
2 cos
this yields that s'm(tiq'4) =
cos
(f> + 1
cos (p + \
BOROCZKY AND SZABO
134
which is a strictly decreasing function of 9. Since t\q'4 > |-, therefore t\q'4 is a strictly increasing function of (p. Thus tifa > M~4 for \ . We will examine A.Tnq\t\ based on the length of (i) Let q3ti < | (see Figure 4). Then mt\ < f or HI < \. Hence — sLqzlti < \ and thus m' E t\l for the orthogonal projection m' of m onto the semi great circle /i/i 4 /j. At the same time max(m£i,m/) < ^, therefore mm' < ^. This implies that for the point q4 of the semi great circle ii/i^i the inequality £mq4m' < ~ holds from which £mq4ti < ^ follows.
FIGURE 4. The case q3ti < |. (ii) If q~3 — ^3, then m = h^ and I — h±. Since
<
, therefore
(iii) Let q^,t\ > £. Then v7 > f because 2y? > (a) Let f <
< (£>Q. / rb*(u}) We know that Z.mtit4 < 1.9124544.... Since tiq4 > t\q'4 > t i f 4 , therefore Zmg 4 /i < £mf4ti < 1.22913882... < 2'
ARRANGEMENTS OF 13 POINTS ON A SPHERE
135
tl
FIGURE 5. The case q3ti > \.
(b) Let if>o < ¥ < f (see the right hand side of Figure 5). Now each side of the triangle mt^l is smaller than ^, furthermore mt^ > q^t^ and ml > q^l, thus 77194 > q^q^ = ?. We know that ml < h^h^ < hh$ = ^ . Using that V'*(v?) '1Sa strictly decreasing function we obtain mq± > (p > ?o = 0.831011 > 0.8310101 . . . = > ^ W > ml. Concerning the triangle mq^l, this implies that ^ > Thus we proved in all cases that d.mq$t\ < |. Therefore if we move along £1^4 as we have described at the beginning of the proof, then decreases. with equality if and only if H is congruent This yields that A.q^q^q^ > with HI. On the other hand > V^)? by the monotonicity of Z2?34Let tpi denote the value of t for which 713 = ^3 in Hn. Easy calculation shows that ~ for
> <^i with equality if and only if the corresponding points are coincide. Now let #i23456 be an empty convex hexagon of side length (p in a (p graph of k vertices in which q^q&^q^ qs ,?62 are Delone diagonals and •^9? 93 94 ^ ^9.">iQr69i- Then /ge9i92 £ -^939495 by Proposition 12 (ii). We want to prove that ^929394 > ^(v7) f°r V < f an(i ^939495 < ^"(v7) f°r i < < •
136
BOROCZKY AND SZABO
Let q'6 denote the image of qQ under the reflection with respect to the diagonal q\q$. As we have seen at the beginning of the proof of Lemma 6 (ii), if 929e > fi then, by Proposition 11, the number of edges of the
4>((p}- Indeed, if Lq^q&q\ — ^(v?), then A29394 = ^(V>) > ^(V 7 )-
We deform the hexagon 9192 9s 94 9s 9e in such a way that the structure of the Delone triangulation remains unchanged, ^q^q^qi remains the greatest angle, and Z29394 decreases. If 9s9e = 929s and q2q'6 = y? in 9i929s949596, then 9i9293949s96 is a hexagon H (cf. the beginning of the proof) for which we have already proved Lemma 7. If 9396 = 9295 and q2q'6 < p in 9i9293949s96, then 919293949596 is symmetric to the diagonal q\q^ and, further, /#5 ^959193Consider the triangles 9193*74 and q\qsq4. We know that q\q% = 9193, 9394 = 9394, As9i94 < ^9s9i94, and £q3q4qi, £q~3q4qi < |, hence /9i9s94 > ^9i9s94- Thus Z(?2g394 > ^929394 > ^(v] and Zg39495 < -^939495 < ^'"(v)If 9s9e < 9295 in 9i929s949596, then fix the quadrangle qiq^qsqe and leaving the side lengths unchanged deform the quadrangle 92939495 in such a way that ^929594 decreases. Then Z(?i293 and ^.q^q^qs increase while ^q^q^qs and ^929394 decrease. We stop the deformation when 36 = 929s- Thus ^9s9e9i and Zge9i92 remain the greatest and the smallest angle, respectively, of the hexagon. This implies that there is no problem with the lengths of the diagonals. The structure of the Delone triangulation also cannot change in the quadrangle 9s949596- Indeed, if 93^5 and q^q^ become equal during the deformation, then replacing the Delone diagonal 93^5 with the Delone diagonal g4g6 we obtain that all Delone diagonals are adjacent to q@. This yields, as we have seen in the proof of Lemma 4, that g29e > y, a contradiction. Now we are at one of the previously discussed cases where we have already showed that Zg29s94 > $(). Since Z#29394 decreases while d-q^q^qc, increases during the deformation, the first part of the lemma follows. It remains to prove that 4>(^>) is a strictly increasing function. Consider the hexagon Ht, and let t denote the intersection point of the diagonals t\t^ and £3^5. Set a = Zt^i, ft — /^sti, 7 = /(.tt^. Considering the triangle
ARRANGEMENTS OF 13 POINTS ON A SPHERE
137
we obtain that sin 7 =
cos (p COS j
I 2 cos2 y 1 -f COS (£>
from which it easily follows that 7 is a strictly decreasing function of (p. Fixing the hypotenuse of the right angled triangle tt^t^ if 7 decreases, then /3 increases. After that, fixing 7, if the hypotenuse ^3^4 increases, then f3 increases again. This implies that ft is a strictly increasing function of (p. Finally, considering the triangle tt\t^ we obtain that v/2 cos (f> + 1 tan a = --2 -- 2 cos (p — I
from which it is easy to see that a is a strictly increasing function of (p. Thus $(¥>) = a + (3 is a strictly increasing function of (p. This completes the proof of Lemma 7. D Lemma 8. Let k > 13 and a^ + i < (p < -|. If in a (p graph of k vertices a convex hexagon (p for 1 < i < 6, then the degree of q? in the Delone triangulation of the corresponding y point set is 5 or 6. Proof. Obviously, the degree of q-r can be 6 and it also can be 5 if 024. Note that if, say, the segment q?qQ can be a Delone edge in no Delone triangulation of the point set, then, by Proposition 9 (iii), we have Obviously, the point q-r is of degree at least three. Suppose that only three Delone triangles are adjacent to 97. If the vertices different from q? of one of these triangles are consecutive vertices, say q\ and 92? of the hexagon and ; 7^ ^.q^q-rq^ and /.qrqsqe > ^qsqrqi from which 4.q4q5q6 > 2?r On the other hand, Lq^q^q\ < 2as(<^) < TT, by Proposition 9 (i),
138
BOROCZKY AND SZABO
if 7 is of degree 3, while, by Proposition 8, if q7 is of degree 4. Thus ^?456 > TT, a contradiction. It remains to deal with the case when q7 is of degree 4 and either 97 is adjacent to four consecutive vertices of the hexagon or q7 is not adjacent to a pair of opposite vertices of the hexagon. If, say, the vertices 95, ge are n°t adjacent to 57, then, by Proposition 8, we have Lq^q-iqi + Z^rtfs + /gs?794 < 3a3(v?). Thus £qiq7q4 > 2yr - 3a3(<£>) > 2«3((p) in the Delone triangle 919754, a contradiction by Proposition 9 (i). Now assume that, say, 93 and q@ are not adjacent to 97. Obviously, one of the two regions /.q^qiqQ is convex. Let ft denote the other one. We may assume, without loss of generality, that q4 and 95 are contained in ft. Let q'5 and q'4 denote the points in ft with the property q'5q$ = q'5q7 — q'4q7 = q'4qs = if. Since q7q5 > q7q'5 and g794 > qiq'4, therefore /.q5q&q7 > A^etf? and ^4<737 > ^?4?37- Hence, having in mind the convexity of the hexagon, we have q'4q'5 < q4q5 = (p. On the other hand, min(g3g7,g 6 g 7 ) > d(ip) which implies that ry i [ (Q j
-
Therefore £q4q7q'5 > TT — a4((f>} > a^((p] and thus q'4q'5 > (/?, a contradiction again. D We turn to the preparation for the proof of the main result, Lemma 9, of this section concerning the number of isolated points in convex hexagons of (p graphs. First we prove some technical propositions. Proposition 15. Let qiq^q^qi be a convex quadrangle such that q\q^ = #394 and a = Zgi^gs < ^?2394 — ft- Let q denote the intersection point of the lines q\q<2 and q^q4 for which the triangle qq4q\ contains the triangle qq^qiFix the vertices q>z,qz, the side lengths q\q^ — ?34, and the sum a + /3. Then the function q\q4 of a is increasing if qq\ + qq4 < TT and is decreasing if qq\ + 4 > K- If we fix the length of the side q\q4 instead of a + ft, then the function a + ft of a is increasing if qq\ + qq4 > TT and is decreasing if
qq\ + qq* < K. Proof. The two statements of Proposition 15 are equivalent, therefore we prove only the latter one. Let a < ft and increase a by a sufficiently small Act. Then ft decreases, say, by Aft. Now q is the instantaneous centre of the motion of the segment q\q4. Let Aq\ and Aq4 denote the amounts of the corresponding moves of qi and 94, respectively. Then Aq\ : Aq4 w ^ing^ : sin qq4. If qq\ + qq4 < TT, then Aq\ < Aq,i a.nd thus Aa < A3 taking 91^2 — 93^4 into account. Therefore the sum a-}- ft decreases. Similar argument shows that if qq\ + qq4 > TT, then a + ft increases. D
ARRANGEMENTS OF 13 POINTS ON A SPHERE
139
Let z\ denote the unique real root of the equation 8z3 — z2 — 4z — 1 = 0. Set 2 arccos Zl = fa = 1.041344073 .... Proposition 16. Let v7 < f ana let P = 9i929s949s be a convex pentagon of side length in which a = ^Lqiq^qz < ^929394 — ft(i) If (p < fa, then there does not exist a pentagon P described above in which a + ft > 27T — o^y?). If (p — fa, then there exists exactly one pentagon P — PI described above in which a + ft > 2?r — a^((p]. Now q\q± = 2 fa and a = ft = T r - ^ M inPlf (ii) If fa < ct( 2<^. This implies that if a -f ft > 2?r — a.^((f>}^ then q\q± > 2(p even holds for the polygonal line <7i23?4 and thus it is impossible to complete the polygonal line as required. Therefore in the whole range of ? it is enough to deal with the case when a + fl = I-K - a^((f}. We know that a3((p) -f a4(if) < TT for (f < |. Set 6 = TV — a3(ip) - a4((p}. We will define two special pentagons. Consider the convex pentagon P = q\qiqzq^q5 of side length y in which 345 is a regular triangle and q^qiq^qz is a square. Let 77i2 and 7713 be those two points on the line <723 for which ra22 — <73m3 = if and the points m2, 92? 3>"^3 are in this order on 23- Further, let be the point outside P for which 2) - 2<5 in P. Let Ps = 51^2935455 be a degenerated convex pentagon of side length (p in which 3i5~4 = 2y> and 9355 = (p and which is not separated from P by the line 9293- Then ^35455 is a regular triangle and 51^29355 is a rhombus in which ^Si923 = ^93«s5i = cx4(if>) + 8. Set Z555i2 = ^2^5 = ^(v7) - #i • Since the area of the rhombus 51^29355 is smaller than j,9( 8. Now Zm3<7354 = 6 + #1, hence a + ft = 2?r - a3(v?) - 8 - #1 in Ps- The situation is shown in Figure 6.
BOROCZKY AND SZABO
140
m2
FIGURE 6. The pentagons P and Ps.
Let P = in which a-\-ft — 2?r — 0:3 (v?) and which is not separated from P by the line q^qs- If q\q$ = 2 TT - 6. Then /.q5q3m3 < Z^s^ms, and thus Z ? also holds, since 2«4(?) <« + /? = 2a4(7)4-a3( < f') + 2^ in the quadrangle qiq^q^q^- Also in the quadrangle a3(
ARRANGEMENTS OF 13 POINTS ON A SPHERE
141
Let Q = riq2q3r4 be a convex quadrangle in which r\q2 — 9293 — 937-4 =
Sis4 = 2<^ in this quadrangle Q' = r(q2q3r'4. We will use the notions a = ^-Tiq2q3 and ft = ^92^3^4 in the quadrangle Q as well. We note that the quadrangle Q (and thus the pentagon P) does not exist for (p < 0.74614 since for these values /.r(q2q3 > ^49392, although a < ft. This follows from the monotonicity of as() and a4((p). We will not use the above numerical value in the course of the proof. We will use, however, that if 4.r(q2q3 > ^54^3^2, then in the case of strict inequality no quadrangle Q exists, while in the case of equality Q is congruent with Q' for which there does not exist a corresponding pentagon P. Thus we may assume that ^.r(q2q3 < 4.s4q3q2. Let Q° — r^q2q3r^ be the convex quadrangle in which r^q2 = q2q3 = 93^4 = <£>, ^r^q2qs = ^^293^4 = TT - aY ', and which is not separated from Q by the line q^qz- Let q denote the intersection point of the lines r\q<2 and r43 for which the triangle qr\r^ contains the triangle g23- If we decrease ^.r^qzq^, i.e., we deform Q from Q' to Q°, then, by Proposition 15, the segment r\r^ increases if qr\ + gr4 < TT, while decreases if qr\ + qr± < TT (the point q changes as the quadrangle Q changes). Now qri + qr4 = 2 < ^7-4 in the whole range, hence the pentagon P also does not exist. If r^7-4 < 2). If we decrease ^.r.\q^q2 from the position corresponding to Ps, then ri 7*4 becomes smaller than 1(p and thus we obtain the pentagons P =
142
BOROCZKY AND SZABO
If ^949392 decreases in the pentagon P = 9192*739495 (where r$ = 94), then the diagonal 9194 (= 7^4) decreases. (3) qr^ + q$4 > TT. Then r^ decreases in the whole range as ^49392 decreases. The argument is the same as in (2). We obtained that appropriate convex pentagons P — 9i9234*?5 of side length (p in which a + (3 = IT: — a^^p) exist if and only if r°r^ < 2tp. If r°r% = 2(p, then P = Ps = r£ 9293^55 is a degenerated pentagon. If r^r^ < 2
Thus r^r^ < 2ip holds if and only if . . sin (p >^ cos 99 sin -- .\- sin (p cos — cos
Set z = cos ^. Using the fact
2
\r
4 cos2 f'
we obtain that 0 > 8z3-z2-4z-l = f ( z ) . The equation 8z3-z2-4z-l = 0 has a unique real root z\ and f ( z ) < 0 for z < z\. This implies that r\r\ < 2ip if (p > tpi and r^r^ ~ 2(f> if (p = tp\ (recall that ^i = 2arccos^i). To complete the proof of Proposition 16 it remains to prove that the function cx((p) — As\q<2(b introduced in (ii) is strictly decreasing. For a given ty\ < (p < ^, let Ps = 519293*455 be a degenerated convex pentagon described in (ii). Consider the convex quadrangle Q — 9192*7394 for which 9192 = 9293 = 9394 = (p + Atp with a sufficiently small Z\<£, the points 5i and 93 lie on the segments 9291 and 9293, respectively, and ^929354 = We will show that 9194 — 5^52 < 1.7 A^p < 2Atp which implies that a(y>) is a decreasing function. Let (3\ — ^92^154 and /?4 — £.q-$s±s\. Since min(9255,93S5) > 9?, hence Let 9 denote the point for which 939 = (p-\- A(p and 54 lies on the segment Examining the increase of s^s^ at the points si and 54 we obtain that 919- 5i54 w (cos/3i+cos/3 4 )Z\<£ < 2cosa3((p0}A(p < Q.7A
ARRANGEMENTS OF 13 POINTS ON A SPHERE
143
Z4#3<72 and qqz = 94^3, therefore qq4 < q^qz = Atp. Hence q\q4 — s\s4 < . We construct the degenerated convex pentagon P* = s^^qss^s^ of side length (f> + A(f described in (ii). Start with the quadrangle Q — . In this way we have constructed the desired pentagon P* and Zsi<723 = ^] is a strictly decreasing function. This completes the proof of Proposition 16. D Proposition 17. Let ip < ^. If a convex hexagon H — qiq^q^q^q^Q of side length (p contains at least two points qi, i > 7, in its interior for which qiqj >y,i>l,j>l,i^j, then • the diagonals of H are greater than (p, • any line connecting two interior points qi, i > 1', goes through interior points of two opposite sides of H, • any segment connecting two interior points qi, i > 1, is a Delone edge of the Delone triangulation in the hexagon. Proof. If a diagonal of H is not greater than 7 (for pentagons cf. Lemma 2). Thus the diagonals of H are greater than d(tp}. We will examine q'rq'8. It is clear that q'7q'8 < 3?, since q'7 and q'8 can be connected on the boundary of IT by a polygonal line of length at most 3
144
BOROCZKY AND SZABO
The distance of #7 from the line q\q-z is at least m(<^), hence qrq'7 > m((p}. We obtain similarly that qsq'8 > ^(92). Thus q'7q'8 > 2ra(<^) + d( 3?, which is a contradiction. Since
it is enough to prove that —^ and -^ 1 Then
are increasing functions. Set x =
l 1+ x andA J( d ((£>)\ = ,_ V4 - : which are increasing functions. This implies that m((p] and d((p) function from which the assertion follows. This completes the proof of Proposition 17.
are convex D
Proposition 18. Let(p < ^. Consider a convex pentagon P — \P,\, (ii) |Ps| is a strictly increasing function of (p.
Proof, (i) According to Lemma 1, we can deform P to Ps by such kind of deformations in which three consecutive vertices are fixed and the remaining two change in such a way that P remains convex, its sides remain of length 92, its diagonals remain of length at least ?, and its area decreases. It is enough to verify that during the deformation P cannot have two diagonals of length (p and P cannot become a triangle. Observe that if two diagonals of P are of length >, then the angle of P at their common endpoints is 80:3(92) > TT, a contradiction. Also observe that if P becomes a triangle, say the triangle (p, I < i < 8, 7 < j < 8, i ^ j.
ARRANGEMENTS OF 13 POINTS ON A SPHERE
(ii)
(iii)
145
Let
13 aracf
We note that assertions (i) and (ii) remain true with qiqj > (f for (f < ty\ and V, 1 < « < 8, 7 < j < 8, i ^ j. Suppose, for contradiction, that H contains 2 + / points, / > 0, in its interior in such a way that this 2 + / points together with the vertices of H form a (^-saturated point set in H. Then H consists of 8 + 2/ Del one triangles. We will show that the sum of the area of 8 triangles among them is greater that \H(
Now/(z) = 48arcsmf-12arcsin^-47r. I f O < y < f , then 1 < x < -^. Since
24 therefore /'(x 2 ) = 0 for a:2 = y 52/45 while f'(x) > 0 for x < x2 and f'(x} < 0 for x > x-2- This implies that as x (and 1, and = 2 arccos ± = 0.94912607 .... This yields that f ( x } > 0 for 1 < x < x?, which proves that the hexagon H cannot contain two points with the required properties for
146
BOROCZKY AND SZABO
and from the vertices of H are at least < | and let # = \ (> (/?) denote this maximum value. Let us join two points by a segment if and only if their distance is exactly tpi. In this way we obtain a graph. Among these graphs consider one in which the number of edges is as small as possible. This graph will be called a scarlet graph (with scarlet edges). Obviously, an interior point is isolated or is of degree at least three in the scarlet graph and at least one of the interior points is not isolated. It is also obvious that the edges of the scarlet graph divide H into convex polygons of side number at most five. This implies, by Lemma 2, that no interior point can be isolated and no diagonal of H can be a scarlet edge. Observe that two interior points, say q-j and gs, cannot be joined to the same vertex of H by a scarlet edge. Indeed, if, say, q\qj and q\qs are scarlet edges, then the scarlet edges adjacent to q\ divide /g2 |, by Proposition 5 (ii), a contradiction. According to Proposition 17, let q'7 and q'8 denote the interior points of opposite sides, say q\q ^49893 in the triangle q^qs, since Ar^s in the triangle qzqiqs, since q^qs > ^q^q^qi. At the same time 0:3(99) > Zg4g85 > ^4<M8> by Proposition 8, and /237 > 0:3(^1), by Proposition 5 (ii). Hence Z237 > ^-q^q&q's taking 0:3(^1) > o^v3) into account. This implies that TT > /^2?394 > ^78#8 — ^ a contradiction. Thus 53 is adjacent to neither g7 nor q$ in the scarlet graph. On the other hand, each of g7 and gs must be adjacent to at least one of the vertices g2,gs,g4 by a scarlet edge, therefore q^qj and q^qg are scarlet edges.
147
ARRANGEMENTS OF 13 POINTS ON A SPHERE
Note that the point qz is not adjacent to qg (if it exists) in the scarlet graph, since q-^qs is a Delone edge, by Proposition 17, each scarlet edge is a Delone edge, and the Delone edges do not cross each other. Hence the polygon of the scarlet graph containing q% must be the pentagon 723(?48 which yields that q^qg is also a scarlet edge. Summarizing the above observations, if H contains only two interior points 7,8 ? then the scarlet graph consists of the edges #i7,#2?7?978>98?45895 and H is divided into two symmetric triangles and two convex pentagons. On the other hand if H contains three interior points 7,8,<79, then H is divided into the regular triangle qrqsqg of scarlet edges and three convex pentagons <72<73<748
q4<
q5
FIGURE 7. Scarlet graphs for two and three isolated points. Note that (f>i < ai2 = arccos 4= = 1.1071 ---- Indeed, since q'7q7 > m(ipi) and q'8q8 > m(y?i), therefore q'7q'8 = q'7q7 + q?qs + qsq's > 2m( 2ra(ai2) + a\2 = TT if y>\ > a\2 which contradicts to the fact that H is contained in an open hemisphere. We prove that the hexagon H cannot contain three isolated points from which Lemma 9 (ii) follows. Let V's < ^ < f • Suppose, for contradiction, that there exists a convex hexagon H = qiqiq^q^qsqe, of side length ? with the regular triangle q-rqsqg of side length y>\ in its interior corresponding to a scarlet graph. Let n denote the centre of #78<79- Let t\,tQ be the points on q?qs for which t\qi = qst^ — (f>\ and the points ti,7, qs^te are in this order. Let £3,^7 be the points on 7<79 for which £397 = qgt-j = (f>\ and the points £3, 97,^9,^7 are in this order. Let /4,/n be the points on 89 for which i.^qs — qgtg =
BOROCZKY AND SZABO
148
and angle 013(^1). The situation is shown in Figure 8. By Proposition 17, the vertices 2,4,96 are interior points of ^1/3,^4^6,^7^9, respectively.
t6
t4
t8
t9
tl
FIGURE 8. Illustration to the case ^3 < ? < |. We may assume that y\ < ^. Indeed, if f , then nt\ > ^ and thus min(ng2, wg4,n -| which implies that the triangle 246 contains the closed hemisphere of centre n, a contradiction. We will deform the hexagon H . If ? < ?i, then fix 92,94,6 an(l deform q\q^q^ until 77 becomes a (not necessarily convex) hexagon of side length (pi. The new hexagon contains the old one, and thus the triangle qrqsQg as well. The new hexagon will also be denoted by // with vertices gi, 52,93,94, 5, q&- Since the perimeter of the hexagon remains smaller than 2?r during the deformation, therefore the radius of the circumcircle of the hexagon (i.e. the smallest circle containing the hexagon) remains smaller than 77. Of course, if (p = <^i, then the radius of the circumcircle of the original hexagon is also smaller than ^. From now on, let H = #i2934<7596 be a (not necessarily convex) hexagon of side length (p\ whose circumcircle is of radius smaller than |, whose vertices 52,^4,^6 lie in the interior of the arcs t^s, £4^6, ^9, respectively, and which contains the regular triangle 789 of side length
ARRANGEMENTS OF 13 POINTS ON A SPHERE
149
(1) Rotate ge around 99 to t$. Then q2q4 remains unchanged, q4qs decreases, and #26 increases but 2^8 < ^8?4 < 64 < 2<^i. Thus, in what follows, let q6 = t8. (2) Rotate q2 around q7 to t2. Then #46 remains unchanged, q2q4 decreases, and <72i) + v?i > ^3(^3) + ^3 = 1.6473... > f. Next assume that each of the pairs (^3,^5), (Me? Ms), (^8^95*1^2) contains exactly one point among 2,4,6- By symmetry, we may assume that 92 € M2, #4 € Ms, 9e G ^7^8, and that 92^2 < min(q4t5,q6t8). We deform H until 92^2 = 94^5 = gets(la) Let 4i5 > g6^8 and set q'4 € 94^5, q'4ts = ^e^s- Rotate g4 around q8 to g^. Then 62 remains unchanged, q4qQ decreases, and 52^4 increases, but 24 < 94^6 < ?4?6 < 2(^i (this can be easily seen by rotating the whole figure around n by ^). Thus, in what follows, let q4 = q'4. (Ib) Let 94^5 < i. Thus, in what follows, let q6 = q'6. (2) If q2t2 = q4t5 = qet8 does not hold, then q2t2 < q4t5 = q&t8. Set q'2 € M25 ?2^2 — 6^8- Rotate q2 around q7 to q'2. Then ^4^6 remains unchanged, q$q2 decreases, and 52^4 increases, but q4q'2 = q@q4 < 1tp\. Thus let q2 = q'2. Hence we may assume that H has a 3-fold rotation symmetry with centre n. Note that the radius of the circumcircle of H remained smaller than |. Next we deform H in such a way that 92^2 = <Ms = 6^8 decrease until 92 — ^25 4 — ^5> 6 — ^8- During this deformation the pentagons <7234897? 9495?699985 6 r3(?/'3) + ?i-3 > |, This proves that for which can contain three points in its interior with the property that the
150
BOROCZKY AND SZABO
distances of these three points from each other and from the vertices of the hexagon are at least (p. We continue the proof of Lemma 9 with the examination of hexagons with two isolated points. Recall that such hexagons do not exist for (p < ^2 = 0.949126. Suppose, for contradiction, that there exists a convex hexagon H of side length tp with two isolated points for some (p > fa. For a fixed ?, consider the set of such hexagons. This set is compact, therefore it contains a hexagon of minimum area. Let Hm = 919293949596 denote such a hexagon of minimum area. Arrange the interior points q7, q& in H in such a way that the minimum of the distances of these points from each other and from the vertices of H is as large as possible. Let
9i97, 92 97, 97 q&, 9s 94, 9s 95 We will distinguish two cases: (p and (p\ — (p. First assume that
(p. Then we can decrease the area of Hm unless Hm is a regular triangle of side length 2
, <£,2
)• Then Zg2949e = ^(K). Obviously, O^K) is an increasing function of ip, therefore S(K) = ^q^q^qz = \(K — OL^(K}} is a decreasing function. Let us define the kernel of the triangle qiqsqs as that part of the triangle q\q^q^ which is covered by none of the interiors of the circles of radius
arccos -4= let #1,93,95 denote those points in the interior of the triangle q2q4q& for which q{q2 = q(q& = 9s96 = 9s94 = 9s94 = 9392 = VThe kernel of the triangle 919395 is contained in the regular triangle 9^9395 whose diameter is 9^93. If /.q(q2q'3 < ^(v) then q(q'3 < 9?, hence Hm exists only for greater value of (p. Since 8 is a decreasing function, therefore Z.q'lq2q'3 = TT — 4^ is an increasing function of
ARRANGEMENTS OF 13 POINTS ON A SPHERE
151
Let fa = 1.0257. Then S(fa) > 0.486955. Hence, for arccos -4 for fa < < faNext consider the case fa < , 1 < i < 6. Since nsi = nsj, 1 < i,j < 6, therefore the circle of centre n and radius ns\ contains the kernel. Thus it is enough to show that nsi < ^. Since q^n < q\n, therefore £s\nq\ < \^q^nq\ = f • At the same time £s\q\n — az'2^' — as(y) < f ~ f — f? hence £ns\qi > ^. Let s denote the point of the segment s\q\ for which sqi = fa. Since £.ns\q\ > ^j- and nq\ < f, therefore nsi < ns. We prove that ns = u(
) = ^((f>] is an increasing function. Since 1 — cos < 1 + 3 cos v? + 2 cos2 (f>
is a strictly increasing function, hence the value °^2 ' — a'3(fa) > 2.5 bounds 77(v?) from below on the interval fa < y> < fa. Now, as
) < u;(Vi) < 0.499561 < 0.51285 = \ < f, which implies that it is not possible that Hm is congruent with T(2<^) for ^>^ < ^> < fa since the diameter of the kernel of T(2<^) is smaller than ? in this range. Let us continue the examination of the case when Hm is congruent with T(2tp) for fa < (f < ^ and for point sets described in Lemma 9 (iii). Since the (/^-saturated point set consists of at least 13 points, therefore there are at least 5 points and thus at least 14 Delone triangles outside H. Hence, by Lemma 3, for the area of the whole sphere we have 4vr > |T(2
)| > \T(2fa)\ + 14|TOi)| > 13 > 4?r, a contradiction. In the remaining part of the proof we deal with the case when (p > fa, the value
152
BOROCZKY AND SZABO
adjacent to the side qrqs is at least 2?r — «3(v) and thus, by Proposition 16 (i), we have (p > t^i. This completes the proof of Lemma 9 (i). Now, let -01 < V < f • Consider the degenerated convex hexagon Hr — of side length tp which contains the points 97,93 and for which = 2tp, r\r<2q-r and r^r^q^ are regular triangles of side length ?, and P3 = r^T^T^q^qj and P± — r^QTiq^q^ are degenerated convex pentagons of side length (p. Since the quadrangle rir^r^r^, is centrally symmetric, therefore the hexagon Hr is also centrally symmetric. Hence £r\q7q8 + ^9798^5 — ^49s97 + ^9897^2 = 27T — 0:3 (>), and thus the pentagons PS and Pj are congruent with the pentagon Ps denned in Proposition 16 (ii). We may assume that a((p) = £riq7q8 — /.r4q8q7 < £q8q7r2 = ^9798^5 =fl(<+>)•We may also assume that for the pentagon PI in Hm we have ^.qiqjqs+^qrqsqs > 2?r - a3((f>) and Z £riq7q8. If qi = ri, then q5 - r5, q4 = r4, and q2 = r2, hence Hm - Hr. If q\ ^ n, i-e., ^.qiq-rqs > £riq7q8, then qir5 > r^s = 2y, which implies that /?598?7 < £r5q8qr. Let P[ = #i7856 ^e ^ne degenerated convex pentagon of side length q& with the degenerated quadrangle qiqsq'sq'e- This implies, by Remark 1, that |Pi| > \P{\. Also by Remark 1, we have \P{\ > |P4|, since these degenerated pentagons are quadrangles. Hence 2|Pi| > 2|Pi| from which \Hm\ > \Hr\, a contradiction. Thus Hm = Hr if £q\q7q8 + £q7q8qs = 2?r - a 3 (<^)Next assume that Z.q\q7q8 + /.q7q8qs > 2?r — a^((p) in the pentagon PI. Deform PI in such a way that it remains a pentagon of side length y>, the sum ^ and ^9^9798 < Applying Proposition 16 (iii) for Pj% we obtain that /.r\q7q^ < hence /.riq7q8 < £qiq7q8. Then girs > firs = 2<£>, which implies that ^9s9s97 < -^^59897- At the same time /Lr^q^q-r < £q
ARRANGEMENTS OF 13 POINTS ON A SPHERE
153
Since /gi#78 < ^785 in PI, therefore ^.q^q^qi < / \P^\ > |P4| and |P2| > IP^I > I A | where P{ = #i<778?56 and P2 — q^qiq^q'?, denote the degenerated convex pentagons of side length ? in which qiq'5 = q^q'2 = 2y>. This yields that |Pi| -f \Pi\ > 2|Pi| from which \Hm\ > \Hr\, a contradiction again. This proves that Hm = Hr. Let ^5 = 1.045 and let v]>\ < (f> < ^5. We give a lower bound for the area of the pentagon Ps(vO - r^r^r^q^q-r. Let Ps = 5152535455 be the degenerated convex pentagon of side length and 5355 = (p. Then /5i525s = TT — as(v?) < TT — as('0i) < 1.9131.... Let P3(>} = ^2r3r4^8?7 denote the degenerated convex pentagon of side length (f> in which r'2r'4 = 2(p and Lr'^q^q-i = a(tps) = 2.1345 . . . (cf. Proposition 16 (ii)). Since the corresponding sides of the quadrangles 51525354 and T^q^q^r'^ are equal and ^515253 < Z.r'4qsq7, therefore 0:3(93) = ^535455 < 4.q7r'2r'3 from which (p < qrr'3. This means that the median q?r'3 corresponding to the greatest side r'2r'4 of the triangle r'2r'4q7 is greater than the half of this side. This implies that the triangle r'2r'4q7 contains the centre of its circumscribed circle. We show that IP^y?)! is an increasing function of (p. Fix the point q$ and the directions q$q7 and qsr'4 in P3(
by a sufficiently small Ay>- Let P^((f + A(p) = T2r3rf4q8q'7. Obviously, the triangle r'4qsq'7 contains the triangle r'4q%qi and r'4q'7 > r'4q-r since
\r4q7r'2\. This implies that \P3(
|P^(v)| from which \P3(p}\ > \P3(^i}\ follows. At the same time ^.r^q^qj = a(tp) > a(tp^), by Proposition 16 (ii). Thus |Ps(^)l > 1^(^)1, by Remark 1, which implies that |P3(^)| > |Ps(^i)|. This yields that \Hm\ = 2|T(^)| + 2|P3(v)l > 2|r(^)| + 2|P^)| > 5.2995. Consider a point set described in Lemma 9 (iii). Then there are at least 14 Delone triangles outside H. Hence for the area of the whole sphere we have 4?r > \H\ + 14|T(
|J7m| + 14|T(^)| > 12.8775 > 4?r, a contradiction. Finally, let ^5 < (p < ^. Now Hm is divided into two regular triangles of side length
\Ps(ip)\ > |PS(^5)|, i — 1,2. Thus \Hm\ = 2|T(V)| + |Pi| + |P2| >
154
BOROCZKY AND SZABO
Consider again a point set described in Lemma 9 (iii). Then there are at least 14 Delone triangles outside H. Hence for the area of the whole sphere we have 4w > \H\ + 14\T()\ > \Hm\ + 14|T(t/>5)| > 2|P S (V> 5 )| + 16|T(^5)| > 12.5791 > 47r, a contradiction. This completes the proof of Lemma 9. D 7. (/P-FINAL GRAPHS
Let k > 13 and max(^r,a/; +1 ) < (p < ^ and consider a (f> graph of k vertices. If the (p graph is non-trivial, then the faces of the graph are regular triangles, rhombi, pentagons, and hexagons. Polygons of side number greater than six cannot occur. The triangles, rhombi, or pentagons of the
ARRANGEMENTS OF 13 POINTS ON A SPHERE
155
If 9i97 = 9597 — ¥>> then on the one hand ^959691 = /.qiqrqe < ot^( V9? tnen again /.q7qiq2 < 7T-a 4 (v?) < a 4 ( graph with some Delone triangles inside. We claim that ^.q^q^q^ < a 4 (v?). First, leaving gi, 97,94, 9s, 96 unchanged, decrease #297 until #297 — ¥> by moving qi and q$ in such a way that q\q-2 = 293 = 9s94 = - Then /Lqtq^qz increases. Secondly, leaving 91,92,93,94,97 unchanged, decrease q^q-r until 95959197 becomes an inscribed quadrangle by moving 95 and qe in such a way that 94^5 = q^q^ = ge^i = ?. Now ^794(73 remains unchanged. Thirdly, leaving 9i,92 5 97 unchanged, decrease Z274 in the rhombus q^qsq^q? and thus 95^7 in the symmetric convex pentagon qiqrq^qsqe of side length y? until 95^7 = (p. Then ^97^493 increases again and in the final position it equals to the smaller angle of the rhombus of side length graph together with the new red edges (of length
13 and max(^,afc + i) <
-final point set of k points where and q^q^ are edges of the corresponding if -final graph. Set ft = (i) If (3 is the angle of a quadrangle in the if -final graph, then ft < ot^ip}. (ii) If ft is the angle of a convex pentagon in the (p-final graph, then ft < (iii) If ft is the angle of an empty convex hexagon in the ip- final graph, then ft < <>*(0.805153654) < a 4 (y>). (iv) If ft is an angle in the ip- final graph not listed in (i)-(iii), then ft <
Proof, (i) Obvious. (ii) The statement is true for P((p). Suppose that a convex pentagon 7192935455 m the
156
BOROCZKY AND SZABO
whose symmetry axis goes through q?. Since /Lq\q^q4 < £q\q?,q'4, therefore the points q'4 and q'5 lie outside the circle going through 9i,?2)?3Increase ^qiq^q^ in the symmetric convex pentagon of side length ?, and thus the radius of the circle going through *(y) < ^(0-805153654) < a4(0.70767526) < a4( 13 and max( ^r,a/j + i) < (p < ^. Let q\q^q^ be a triangle in the Delone triangulation of a ip-final point set of k points where q\qi and q^q?, are edges of the corresponding (p-final graph. Set ft = (i) If ft < a^((f] ana #i394 zs a Delone triangle, then |\ > ki^^^^sl where qiq^q^q'^ is a symmetric convex pentagon of side length (p and its symmetry axis goes through either q'4 or q'5. (iii) For a fixed ft, the functions |#i234l ana l?i 92^394 9s I introduced in (i) and (ii), respectively, are strictly increasing functions of if on the ranges where these polygons exist. Proof, (i) If gi3 = v?, then the assertion is obvious by Lemma 3. If V? then and qq'4 — q\qy,i i.e. for which the triangles gi2g3, qsq'^qi, q'^qzq are congruent. Now ^qsqi + ^9i?3g4 + £q'4q3q > TT since the left hand side equals to the sum of the angles of the triangle \qiq3q'4\ with equality if and only if q4 = q'4. (ii) We have seen in Lemma 10 that ft > cx.4(tfi) may occur only if the Delone triangle qiq^q^ is the part of a convex pentagon <7i2<73<745 of the
ARRANGEMENTS OF 13 POINTS ON A SPHERE
157
<£>-finaI graph. We may assume that (73*75 is a Delone diagonal in the quadrangle 91 939495. Then the point 95 does not lie in the interior of the circle going through 91,92,93- Fix the points 91,92,93 and deform the quadrangle 9i 939495 in such a way that q3q4 = q4q5 = q5qi = (p until 9s, 9i, 92, 9s become cocircular. Let q'4 and q'5 denote the new positions of q4 and 55, respectively. Then #295 = 9i9s > <£ and q3q'5 > (p since ft > a4( 9294- Now, by Remark 1, the area of 91939495 decreases, from which |9i 9293949s! > |9i 92939495! where the symmetry axis of qi 92939X goes through q'4. Equality may occur in the above inequality only if q4 = q'4 and 95 = 95(iii) First we examine the function 1 9192 9394) • Let 91 929394 be a rhombus of side length
) < ft < a4(
, If ft > a3((p), then increase
a3(
) < ft < a^((p). If ft = 0:4 (<£>), then (p cannot be increased and the pentagon is divided into a regular triangle and a square of side length ?. If ft > 04(^7), then increase
a4((p + A
+ Arcas^, hence qiq~2 > q3q'4. Let ^4 be the point on the ray emanating from c and going through q'4 such that 9s94 = 9i92- Then q4q > q'4q. Since the triangle 9i92C is contained in the triangle 9i92C, therefore | = £cqiq2 < A.cq\q
158
BOROCZKY AND SZABO
g~5 around g~2 and g~i, respectively, toward each other until the angles at the vertices q^ and q\ in the symmetric convex pentagon of side length
g^g. Arrange the pentagons 9192939495 and q^q^q^q^q" in such a way that 9i92 C gig^ 9 ~ g' and both pentagons are contained in the same hemisphere bounded by the line gig2- Let 5 denote the centre of this hemisphere. Consider the points gi? and q^ on the segments g^g" and g2ga, respectively, such that g^gg = g^g^ = (p. Then sq'5 = sq% — sq£ — sgg, since the angles at the vertices 91,91,92,92 *n ^ne pentagons are ft. On the other hand ^9559s < ^95593, hence the distance of q'5q^ from s is greater than the distance of q^q^ from s which is greater than the distance of g^g^ from 5. This implies that 91929395 C gi929s9s- Taking the inequality 994 < gg" into account we obtain that 9192939495 C gig^s^'^s which proves the monotonicity of the function Iqiq^qsq^q'slThis completes the proof of Lemma 11. D For further reference we summarize some properties of y-final graphs in the next remark. Remark 3. Let k > 13 and max(^y : ,a; c +i) < then the pentagon q\qiqzq^q^ is either a convex pentagon of side length (p, or it can be obtained from a convex hexagon of side length (p by cutting off a Delone triangle from this hexagon. Lemma 12. Let k > 13 and max(^ L ,afc + i) <
<£, therefore the radius of the supporting circle going through g2,96,93 is greater than the radius of the supporting circle going through 92,ge,9i- Hence the segment g29e separates the point q\ and the centre of the supporting circle going through 92,96,93- The radius of the circle going through g2,ge,9s is greater than the radius of the supporting circle going through g2,ge,gs, hence the segment
ARRANGEMENTS OF 13 POINTS ON A SPHERE
159
26 separates the point q\ and the centre of the circle going through q^i q&i ?5Thus, if we rotate q6 around q5 toward 2, then, by Proposition 3, the area of the triangle 6<75(?2 decreases. It remains to prove that if we rotate q§ around q& toward 52, then q^q^ becomes (f> before q^qe becomes (p. Note that the greatest angle of the hexagon is ^q5q&qi or Zg2?304First suppose that Lq$q§q\ > ^.q^q^q^. Let q'6 denote the image of the point ^>(y) > ^(1.02746114) = 3.11663278... > 2.461918835... = 2a 3 (f) > 2a3(v?) for 1.02746114 < (p < f and Z$20394 > V'(^) > V'(f) = 2.455117551... > 2.446054045... = 2a3(1.02746114) > 2a3(^) for f < ip < 1.02746114. Thus Z(7234 > 2a 3 (y>) for | < if < | from which ^.q^q^q'^ < «3 (?)• Since q3q5 >
«3(<^)Consider the semicircle on the circle of radius 9 and centre 94 whose one endpoint is #3 and which contains q$. If a point q moves on this semicircle from 93, then the area of the triangle 34 first strictly increases and then strictly decreases (cf. Proposition 3). Let q and q* denote those points of the semicircle for which ^q^q^q = «3(v) and /Lq^q^q* = 2a3(v?), respectively. It is known that |g 3 qf4<Sf| = |3<74g*|. The angle inequalities obtained before show that the points #3 , 3 , ,
= ^-5
<
which yields that ^2^4 < V- Thus ^g lies on the arc qeq'6 of centre 95 again from which q£qs > q'6qz > ty follows in this case as well. This completes the proof of Lemma 12. D Lemma 13. Let ip < |. Let q\qiq?, and q\ q^q^ be two triangles of the Delone triangulation of a (^-saturated point set in which q\q {qiqzQsq^ where (Mi = 9392 = 9 and A.qzq^q\ < as(v?) for the point q3.
160
BOROCZKY AND SZABO
(iii) // 91929394 is an inscribed quadrangle then [91929394! > | ^(y)! where q^ ^ qi, q^q^ = , and qiq^q^q^ is an inscribed quadrangle. The function \q\929394! is a strictly increasing function 0/^949192Proof. Let c and r denote the centre and the radius, respectively, of the circle going through 94,91,92- By Proposition 6, the point 93 lies in the circle going through 94,91,92- Fix the points 94,91,92- We may assume that 9493 > 9392(i) In this case r < (£>. Let 93 ^ q\ and 93 ^ q\ denote the points for which 9394 = 9392 = Sotsfa) > TT. Hence, by Proposition 3, we have 1^492931 > 19402£31 which proves (i). (ii) In this case r > (p. The vertex 93 of the triangle 949293 of minimum area lies either on the circle of radius if and centre 91 or on the circle of radius
q3a
FIGURE 9. Illustration to the proof of Lemma 13 (ii). If 93 lies on the circle of centre 91 and radius c^, then, obviously, [9492931 > |949293| with equality only if 93 = 93 since 9493 > 9293If 93 lies on the circle of centre 92 and radius cr. then it is enough to show that the area of the triangle 949293 decreases as 93 moves from 93 to 93. By Proposition 3, this follows from the inequality ^939492 + ^949^92 > ^949293-
ARRANGEMENTS OF 13 POINTS ON A SPHERE
161
If O3(9p)-f/ TT for the point GI, then, using the fact that qi lies outside the circle of centre c\ and radius 92, we have ^.c\q^q^ > /.ciq^q^ /Lc\q^q-2 > Zci245 and l^ciq^q^ > 0, from which the assertion follows. Now let 03(92) + ^ TT and /3 < TT — 03(9?), therefore a > 03(92). We also know that ft > 03(92). In the triangle q^c\q^ we have 9401 = c\q^ = 92, and /.q^ciq^ > 203(9?), thus, by Proposition 3, the area of this triangle is less than the area of T((p). This implies that 26 + a + 03(92) < 303(92) < /? + 203(92) from which a - £ < (ft — 8} + (03(95) — 6 — e) follows. This proves (ii). (iii) In this case q^c — r. Since r is the radius of a supporting circle, therefore r < 9?. With fixed qi,q2,Q4 the quadrangle gi 234 is obviously of minimum area. Now c is an interior point of the triangles q^q^q^ and q^q\q^ because | > A.q±cq\ — / 03(9?). We increase /g4gig2 and ^.q\qiq^ in the inscribed quadrangle 13 anc?max(^r,afc+i) < 9? < -|. Let P — q\qiq-$q±q$ be a convex pentagon of side length 9? in a 92 -final graph of k vertices in which q,q^q^ of minimum area. (i) If /4<jf59i < 03(95) + 04(90), then P is symmetric to either the perpendicular bisector of q\qi or the perpendicular bisector of q^q^. (ii) If ^.q^q^qi > 03(9?) + 04(92), then the smaller Delone diagonal of P is of length 9?. (iii) The area of P is a strictly decreasing function of £q±q*>q\. (iv) Let Ps = si 52533455 denote the degenerated convex pentagon of side length 9? in which 3481 = 2y and 5355 = (p. Then \P\ > \PS\(v) With fixed ^.q^q^q\ the area of P is a strictly increasing function of (p. Proof. We may assume that £q*>q\qi > ^.q^q^q^. It follows from Remark 1 that #35 = 9? or 5
162
BOROCZKY AND SZABO
(iii) First assume that Aq^q^q\ < 013(y>) + a4((p). Then P is symmetric to the perpendicular bisector of 9192- Fix the points #3, #4,95 and deform the quadrangle 93959192 in such a way that ^.q^q^qi increases but q$qi — q\q^ — 929s — <Pand ^94959i < ttsC'tO + Q^^) remain true. Then, by Remark 1, the area of the pentagon decreases. Next fix the points 94,95, q\ and deform the quadrangle 94919293 in such a way that §1^2 — #293 = 9s94 — f remains true and ^q^q^qi increases to £q4q5qi. By Remark 1, the area of the pentagon decreases again. Secondly assume that A.q^q^q\ > 03(9?) + ct4((p). Then q^q^ = 9 in P. This means that 93^4^5 is a regular triangle and 93959192 is a rhombus. If ^949s9i increases, then the greater angle of the rhombus increases, thus its area decreases. (iv) is an immediate consequence of (i), (ii), and (iii). (v) First assume that Zg45 be a sufficiently small positive number and consider the pentagon P( + Atp] = 9i92939495 °^ s^e length (f + Ap in which £q'4q'5q'l - £q'4q'3q'2 = ^qsQi- Obviously, (9495911 = |234| < |4<75 tnus 7 by Proposition 3 (ii), we have |<7i24| < ki^^l- This implies that \P((p)\ < \P( + A(p)\. Secondly assume that A.q^q^,q\ > as((/?) + 0:4(>). Then 93^5 = (p in Let Z\? be a sufficiently small positive number for which ^.q4q^q\ > a Zi(^) + a4((^+Zi^) also holds. Consider the pentagon P((p+A(p) = of side length (/? + A(f> in which 4.q'4q'5q'i = Lq±q$q\ and ^3^5 = ? + Atp. Obviously, l^s^gsl < k/39495l- Since a 3 (<^) < a3(p + Z\(/?), therefore ^939591 > 4.q'3q'5q{. Fix the side length in the rhombus 93959194 and decrease ^939591 to ^.q'^q'^q'^. Since ^q^q^qi is the greater angle of the rhombus, hence the area of the rhombus increases. Next fix /.qzq^qi in the (new) rhombus 93959194 and increase the length of its sides to (f> + A(p. Then the area of the rhombus increases again. This implies that |P(y)| < |P(v + A ^939295- If we fix the vertices 91,92,95 and increase ^919293, then the sum of the areas of the rhombi decreases.
ARRANGEMENTS OF 13 POINTS ON A SPHERE
163
We note that Remark 4 can be proved in a much simpler way as well. Indeed, it is enough to observe that the area of the triangle q\q$qz decreases as /) > ^?293?4 ^ ^973<72' If we fix the vertices q\,qi,q*> o-nd decrease then the sum of the areas of the polygons decreases. Proof. If /9i<723 decreases, then ^<7325 increases. This implies that |. Split this pentagon into the triangles q^q^q'^ q'^q&i q^qeqr- Let q denote the midpoint of q^qs. Fix the points q$ and q§ and increase /#325- Then Lqiq$q§ and ^.q^q-^qj decrease. Now q'3q as well as q'3q$ decrease, hence Z#3<j'25 decreases, too. This implies that the areas of all three triangles 2<753> ?3?5?65 367 decrease. Thus the area of the concave pentagon 925673 decreases as ^ ^325- We will reach the points 93,^4, 6,7,3 in two steps. First we fix the point q'3 in the rhombus 23<77<73 and decrease ^.q^q^q^ until 93 reaches its final position ^3. Then 97 is carried to the position q'7. Since / kiftM^ + l^^kslSecondly deform the rhombus 2373 into the rhombus 23<773- Now the greater angle of the rhombus increases, hence its area decreases. From this \q\qiqzq4\ + l^s^tol > kiMa&l + Ift^Msl follows. This completes the proof of Lemma 16. D Lemma 17. Let <-p < ^. Let P = <7i234?5 be a symmetric convex pentagon of side length (p in which the symmetry axis goes through the vertex q\ and /5
BOROCZKY AND SZABO
164
function of £q4q$qi while q\q4 > | (for 0.90455689431 < (p < | this always holds). Proof. Let q denote the midpoint of q3q4. Set £q4q*,q\ = a, £q$q4q\ — A49i?5 = ft, £q4qiq = 1, £qiq±q - & and qiq4 = a > |. As we have seen in the proof of Lemma 14 (iii), the area of P is a strictly decreasing function of a. Furthermore, it is easy to see that ^qsqiqz = 2((3 + 7) and /Lq^qj,q4 = £q?,q4q5 = ft + 8 decrease as a increases in P. We will prove that both (3 + 7 and ft -\- 6 are strictly concave function of a while a > |-. (i) Fix the vertices #3 and q4 and decrease 4.qsq4qs = ft+8 in the symmetric convex pentagon P by a sufficiently small positive A. Then a increases by, say, Aa. Let P' = |, therefore 7 increases but ft -f 7 decreases. We determine the limit lim^_+o -
qi
FIGURE 10. The rotation of the triangle q^q\q4 around q4. Rotate the triangle q$q\q4 around q4 until q$ = q'5. Let q\ denote the new position of q\. The situation is shown in Figure 10. Then £qiq'5q{ = Aa. Since £q\q4q\ = A, therefore q\q\ w Zisina, q$q'5 w A sirup, and q\q( w Aa sirup. Now A.q\q\q^ w ^ and the angle of qiq[ and ^1^5 also tends to | as zA tends to zero, hence ^.qiqiq'-^ w /?, 4.qiq[qi ~ ^ — (/? + 7), and 77 + 7 in the triangle q\q\q'i. Thus cos(ft + 7) cos 7 from which lim
7)
sm a cos 7
ARRANGEMENTS OF 13 POINTS ON A SPHERE
165
To prove that /3 + 6 is a strictly concave function of a it is enough to show that si^ocos *s a strictly increasing function of a which is obvious by the previously mentioned monotonicity properties of ft + 7, a, and 7. (ii) Fix the vertex q\ and the symmetry axis and decrease ^.qq\q^ = /3 + 7 in the symmetric convex pentagon P by a sufficiently small positive A. Then a increases by, say, Aa. Let P' = <7i293?45 denote again the symmetric convex pentagon of side length
^, therefore 6 > .
qi
q4
FIGURE 11. The rotation of the triangle q$q\q4 around q\. Rotate the triangle q4q$q\ around q\ until q$ — q'5. Let q4 denote the new position of q4. The situation is shown in Figure 11. Then £q4q'5q'4 = Aa and q~4 lies in the region ^.q\q^q. Since ^.q^q\q^ = A, therefore q±q± w zAsina, q$q'5 ~ Asiiap, and 94^4 w Z\o;sin(^. Now 4.qq4q'4 w ^ because the distance of the point q'4 from the line g#i is j. At the same time £q4q4q\ w ^ and the angle of 94^4 and 94^5 also tends to ^ as A tends to zero. Hence £q4q4q'4 « /?, TT — (^3 + 7), and £q4q4q'4 w 6 in the triangle q±q4q'4. Thus sn <
from which lim
7)
sin a sin 6
To prove that ft + 7 is a strictly concave function of a it is enough to show that g|"qj^g is a strictly increasing function of a which is obvious by the previously mentioned monotonicity properties of ft + <5, a, and 6 (do not forget a > f and ft + tf > <5 > \).
166
BOROCZKY AND SZABO
This proves Lemma 17 for a > ~. Since a > 05(9) and sin | — sin 9 sin ^, therefore a > | for sin2 9 > ^1, i.e., for 9 > 0.90455689430.... D Proposition 19. Let k > 13 and max(^ L ,a/,. +1 ) < (p < |. // 603(9) > 2?r around this point, or at least one blue edge is adjacent to this point in which case 2?r > 04(92) + 403(9) > 04(024) + 403(024) = 2?r around this point, a contradiction in both cases. D Let R((p) denote the rhombus of side length 9 which has an angle 2ir — 20:3(9) - 0:4(9)- Arrange the polygons S(
) in this order around a common vertex of them without overlapping each other such that the angle of R(
13 and max(0.90455689431,aA+1) < 9 < f. // the degree of a point q is six in the Delone triangulation of a (p-final point set of k points, then the sum of the areas of the six triangles adjacent to q is at least \Hs(
ARRANGEMENTS OF 13 POINTS ON A SPHERE
167
We know that the angle between two consecutive red edges is at least 03(9) and we also know from Proposition 7 that the angle between two red edges in the pattern red-blue-red is at least 04(9). At the same time the angle between two consecutive red edges is less than 04(9) and the angle between two red edges in the pattern red-blue-red is less than 203(9). Indeed, if the angle between two consecutive red edges is at least 04(9), then 2?r > 03(9) + 304(9) > ^3(024) + 3o 4 (a 2 4) > 6.3343 > 2?r, while if the angle between two red edges in the pattern red-blue-red is at least 203(9), then 2?r > 4a3() > 40:3(024) + 0-4(024) = 2?r around 9, a contradiction in both cases. Leaving the colour pattern of the edges adjacent to q unchanged we will deform the hexagon q\929s94959e in order to decrease its area. Let q'4 and q'& denote the images of 9 under the reflections with respect to the lines 9395 and 9591, respectively. Since max(/93995,/9599i) < 203(9), therefore, by Lemma 13 (i), we have |993949s| > |993949s| and |99s969i| > 1995964i I-
In what follows we examine the hexagon 9i9293949596 instead of the hexagon 919293949596Decrease ^91992 and ^92993 to 03(9) in the hexagon 9i929394959e m such a way that none of ^93995 and ^95991 decreases. Obviously, 04(9) < ^93995 < 203(9) and a4(
)l(b) Assume that the two blue edges are consecutive edges in the cyclic order of the edges around 9 in the Delone triangulation. Without loss of generality we may assume that 995 and 995 are the blue edges. Then, by Remark 3, the pentagon 994959591 is either a convex pentagon of side length 9, or it can be obtained from a convex hexagon of side length 9 by cutting off a Delone triangle from this hexagon. In the latter case if 994959e9i is not a convex pentagon of side length 9, then replace 994959591 with a convex pentagon of side length 9 whose area is less than the area of 994959e9i and in which the Delone diagonals are also adjacent to 9 (cf. Lemma 12). Thus we may assume that 9495 = 9595 = 9e9i = 9We know that ^91994 < 27r-3o3(9) < 27r-3o3(a24) = O3(a 2 4)+O'4(a24) < <23(<^) + a4((t>) in the pentagon 994959591 of side length 9. Since ^91994 > 05(9), therefore the angle between two consecutive red edges is less than 04(9). Indeed, if the angle between two consecutive red edges is at least 04(9) for some 9 > 9* = 0.84814272, then 2?r > 203(9) + «4(v) + ^(v) > 203(9*) + Ct4( 6.28318534 > 2?r around 9, a contradiction.
BOROCZKY AND SZABO
168
Replace qq^q^q&qi with a symmetric convex pentagon qq^q^q&q\ of side length if. We know from the proof of Lemma 14 (i) that the area of qq^q^q^qi is not greater than the area of qq^q^q&q\. By Lemma 14 (iii), the area of the pentagon qq^q^qi increases if £q\qq± increases. Now decrease £q\qq-, ?3??4, respectively, to a^ip). Then the areas of these triangles and the above pentagon decrease. This implies that the sum of the areas of the six triangles adjacent to q is at least 3 T((p)\ + |P C (<£>)| where Pc(v) 'ls the symmetric convex pentagon of side length (p whose two greatest angles are 2?r — 3a3(<^). Arrange the polygons P C ((^),T((/?),T(?),T(?) around a common vertex of them without overlapping each other such that the angle of Pc(<^) at the common vertex is 2;r — 80:3(<^). Let Hp(}\ > \Rs((p)\. As a first step, we show that both \Hp(
) in the symmetric convex pentagon P c (v)- Then, by Lemma 14 (iii), the area of the pentagon increases. Secondly, leaving the greatest angle 2vr — 303(1^ + Atp} unchanged increase the side length (p to
\Hs((p)\ follows from the next table.
V 7T/3
1.01091770670 0.98181291240 0.95785375082 0.93773682084 0.92058198917 0.90577007057 0.89285051676 0.8814861579ft 0.87141864083 0.86244598312
\H. \HP 3.82126647249803 . . .4.25023082951690 . . . 3.50146649194088 . . .3.82126647256370 ... 3.25456862549919 ... 3.50146649194355 . . . 3.05848758575130 ... 3.25456862555406 . . . 2.89916943157644 . . .3.05848758580918 . . . 2.76729350927521 ... 2.89916943164899 ... 2.65644890911128 . . .2.76729350929594 ... 2.56208489037588 . . .2.65644890915333 . . . 2.48088210916607 . . . 2.56208489041388 . . . 2.41036177505207 ... 2.48088210921272 ... 2.34863451519861 ... 2.41036177510203 ...
ARRANGEMENTS OF 13 POINTS ON A SPHERE
169
(ii) Assume that three red and three blue edges are adjacent to q in the Delone triangulation. By Remark 3, the three blue edges are not consecutive edges in the cyclic order of the edges around q in the Delone triangulation. (a) Assume that no two blue edges are consecutive edges in the cyclic order of the edges around q in the Delone triangulation. Without loss of generality we may assume that qq\, qq$, and qq$ are the red edges. If the angle between two red edges, say Lq\qq^^ is at least 203(92), then, by Lemma 11 (ii), we have \qq\qiq-3\ > Iqqiq^sl where q'2q = q'2q\ = <£> and the line q\q% separates q and q'2. Hence |qiq?q%q±q$q&\ > |
I-^X^)! from which the assertion follows. Thus assume that the angle between any two red edges is smaller than 203(99). Replace the points q2,q4,q& with the points q'2,q'4,qQ, respectively, such that qiq'2 - q3q'2 = q3q'4 = q5q'4 = q5q'6 = qiq'6 = ki^s^s^l- Applying Remark 4 to the rhombi separated by the red edges, we obtain that the sum of the area of these three rhombi is minimal if the greatest one is 203(99) while the smallest one is 04(92) among the angles ^)\. (b) Assume that two blue edges and two red edges are consecutive edges in the cyclic order of the edges around q in the Delone triangulation. Without loss of generality we may assume that qq\, 593, and qq$ are the red edges. We will examine the triangle qqeqi, the quadrangle qqiq^qz, and the pentagon 3456- In order to obtain a lower bound for the sum of the areas of the six triangles adjacent to g, leaving the structure of the Delone edges unchanged, we will deform these polygons in such a way that the sum of the areas of the six triangles adjacent to q decreases. Since the point set is (/^-saturated, therefore /6 203(92) cannot occur, because, by Proposition 7, in this case 2-rr > 2as((/?) + 04(99) + a>$(i£>) > 2a3(?*) + 0:4(99*) + 0:5(92*) > 2?r around the point , a contradiction. Also note that if during the deformations one of 2 5 4 5 6 decreases to 99, then we are done, since we are in a situation examined in (i). If ^.qiqqs > 203(99), then, by the same argument we used at the beginning of case (ii)(a), we are also done. If ^.q^qqe > 03(99) + #4(92)? then, by Remark 3, Lemma 12, and Lemma 14 (ii), we can replace the pentagon qq^q^q^qQ with a convex pentagon qq3q'4q'5q6 of side length 99 whose area is smaller than the area of qq^q^q^q^ and in which the Delone diameters are qq'4 and qq'5 one of them is of length 99. In this way we are again in a situation examined in (i).
170
BOROCZKY AND SZABO
Thus, in what follows, assume that ^91993 < 2a3(p) and ^93995 < Let q' and q'2 denote the images of the point q under the reflections with respect to the lines q\ qe and 9193, respectively. By Lemma 13 (i), the area of the rhombus 99i929s is not greater than the area of the quadrangle g Ai993 (> «4(v)), then replace the triangles q&qqi,q\ qq'2 ,92993 with the triangles q6qq',q'qqi-,qiqq3- The six triangles around q obtained in this way remain of type described in (ii)(b), the only difference is that now qq' is the blue edge instead of qq'2. At the same time, this replacement decrease the sum of the areas of the triangles around q since |9i9293| = I9i99s| > I9i99e| = \qiq'qe\- Thus we may assume that /699i < Aqiqqz, i.e., the angle of the triangle at q is not greater than the angle of the rhombus at q. Fix the vertices of the pentagon and examine the sum of the areas of the triangle q\qqe and the rhombus 9i9293 as q\ rotates around q toward q&. Consider the quadrangle 36 0:4(92)) increases. At the same time |9i939e| also decreases since q\ moves on the circle of centre q going through the points 93,9i,ge and £q6qqi < ^9i99sWe may rotate q\ around q toward q@ until either £q\qq3 = 2a3(ip) which has already been examined in (i), or q\qQ = if. Next consider the pentagon qq^q^q^q^. By Remark 3, Lemma 12, and Lemma 14 (i), there exists a symmetric convex pentagon qqsq'^qe of side length
ARRANGEMENTS OF 13 POINTS ON A SPHERE
171
the Delone edges remained unchanged. ^From this I follows. (iii) Assume that six blue edges are adjacent to q in the Delone triangulation. Then (p, I < i < 6, and qqi, 1 < i < 6, are the Delone edges in q\q2q^q^q?>q&- We prove that \Hm\ = \H.()\. Since Hm is of minimum area, therefore, fixing four consecutive vertices and the side lengths of Hm, we cannot move the remaining two vertices of Hm in such a way that the greater one of the angles at these two vertices increases. Only the point q can prevent this increasing, in such a way that either the distance of q from some vertices of Hm are (p or some triplets of consecutive vertices of Hm together with q form inscribed quadrangles. If Hm is of minimum area, then it is clear that these conditions fix the position of q in Hm . We know from Proposition 9 (iii) that qiqj > d((p), 1 < « < .7 < 6. We will distinguish four essentially different cases. For convenience, if qi-iqiqi+iq, 1 < i < 6 (go — <7e> 7 —
2|%>)| + 2|r(y>)| > |%»)| + |fl(vO| + 2|r(y>)| = l#.(v»)l(b) The point q is a vertex of two inscribed quadrangles corresponding to two consecutive vertices, say q\ and q-z, of Hm. Then 6) < TT. Therefore the move of q into the region ^.q^qqe is prevented by the condition qq$ — qq@ = (p. This implies that ^qsqqe = otsfo). Thus we have 2?r < a5((/?) + 3a3(vp) < a 5 (ai 2 ) + 80:3(012) = 2?r around the point q, a contradiction. (c) There are at least three vertices of Hm whose distance from q is
) < TT, therefore the move of q into the region £q<2qq& is not prevented by the presence of ^3,^4,95 themselves. Thus at least one of qq^ = (p and qqe — ^ hold. Al the same time the move of the points 93, #4, 95 is prevented
172
BOROCZKY AND SZABO
by at least one of the conditions qqs =
. We distinguish two subcases. (dl) Assume that qq% = qq§ — (p. Then q&qiqiq is congruent with S(<£>). If 994 = <£>, then we have a situation already examined in (i)(a) or (ii)(a). On the other hand, if qq$ > 92, then qq% — qq$ —
(f> (the case 992 —
-> then we can rotate q around q$ into the interior of the circle going through 9e?9i,92 5 a contradiction. Thus 9e9i92939 is a symmetric convex pentagon of side length (f>, hence /9e99s < a 3 (<^) + « 4 (^) < TT. On the other hand, the move of the points 94,95 is prevented by at least one of the conditions qq^ = (p and qq5 — (f>. Therefore we have a situation already examined in (i)(b) or (ii)(b). This completes the proof of Lemma 18. D We close this section with two lemmas which give information about the possible vertex degrees in Delone triangulations of <^-final point sets. Lemma 19. Let k > 13 and max(1.01427543570,afc+i) < y < f. There exists no point whose degree is at least seven in the Delone triangulation of a (p-final point set of k points. Proof. Set (f>0 = 1.01427543570. A point of degree at least seven in the Delone triangulation is a point of degree at least three in the <^-fmal graph. By Remark 3, it can be only at most two blue edges between two consecutive red edges. Thus, by Proposition 7, the average of the angles of the Delone triangles at their common vertex between two consecutive red edges is at least 0:3(y), a4.^ , or Q5^ if the number of blue edges between the two red edges is 0, 1, or 2, respectively. Since o^v?) > 0:3(^0) > 1.217864400 > |, oiM > 2i^£ol > 0.942310624 > f, and ^M > ^1 > Q.788239891 > \, therefore there does not exist a point of degree at least eight in the Delone triangulation. Suppose, for contradiction, that there exists a point, say gg, of degree seven in the Delone triangulation. Let 9i9892,929893,939894,949895,959s96,969897, 9?989i be the Delone triangles adjacent to gg. By Proposition 19, the degree of qs, in the >final graph is three or four. (i) Assume that qs is adjacent to four red and three blue edges. If no two of the blue edges are consecutive, then, by Proposition 7, we have 2?r > as(<^) + 30:4(92) > QJ3((£>0) + 30:4(^0) > 6.871728145 > 2?r around gg, a contradiction. If there are two consecutive blue edges, then, again by Proposition 7, wo hove 2;r > 2a3((f>) + a4() > 2a3(^o) + «4(^o) + a 5 (^o) > 6.806628942 > 2?r around gg, a contradiction again.
ARRANGEMENTS OF 13 POINTS ON A SPHERE
173
(ii) Assume that q$ is adjacent to three red and four blue edges. Note that three blue edges cannot be consecutive. We distinguish two cases. (a) Assume that no two of the red edges are consecutive. We may assume, without loss of generality, that q\q%, 38? and q$q& are the red edges. By Proposition 7, we have 4.qsq8qi > as( 2?r, therefore £qiqsq$ < 2?r — Thus, in view of Remark 3, Lemma 12, and Lemma 14 (i), we have Iqiqsqsqeqrl > ^iq&qsq'M where q\q8q$q'&q'7 is a symmetric convex pentagon of side length
)-\-Oi^((f]-\- Oi$((p) > 2 ?r, hence ^.qiqsqs < 2?r — a 5 (y?) < 2a3(v?). Similarly, Z^stfs < 2a3(p). Hence, by Lemma 13 (i), we have \q\qiqzqs\ > |<7i<72<73<78| and Iqsq'^qsqsl where the quadrangles qiq^qsqs and qsq'^qsqs are rhombi. This implies that \qi q-2q3q^q^q&q7\ > ^iq^^^'MWe may assume that 4.qiq$q3 < ^.q^qsqs. Our lower and upper bounds for the angles between the red edges remain true while the degree of q$ remains seven in the Delone triangulation, i.e., the structure of the Delone edges around q$ remains unchanged. Fix the pentagon qiq^q^q^q'-^ and the structure of the (/7-final graph, and increase ^.q^q^q^ until the quadrangle qiq^qsqs becomes congruent with S(tp). By Remark 4, the sum of the areas of the rhombi qiq^qsqs and qsq'^qsqs decreases during this deformation. Also 4<7s > V remains true since ^.q^q^q^ < 2a^((p) holds during the deformation. Let qi&Qsqs and q^q^q^qs denote the new rhombi (here <7i2(?38 is congruent with S(y>)). Then Iqiq'^qsq'^q'M > kiMs^s^T-lFix the square qi&qsqs and move the point q$ in such a way that qs^qsqs remains a rhombus and 567?i8 remains a symmetric convex pentagon of side length (p whose symmetry axis goes through q\. By Lemma 15 and Lemma 17, |3<7458| + ksQe^z^i^sl is a concave function of ^.q^q^qs- This implies that |3458| + |56(?7(7i8| can be minimal if Zg358 is either minimal or maximal. Hence Iqs&qsqsl + |567)Let S(S,S,p) = <7i23456#7 denote the heptagon corresponding to the previous case, i.e., where ).
174
BOROCZKY AND SZABO
Thus |9i929394959697l > min(|5'(5', S,p}\ , \S(S, r, P)|). At the end of the proof we will show that both \S(S,S,p)\ + 15|T(»| > 4?r and |5(5,r,P)| + 15|T(y>)| > 4?r hold, a contradiction. (b) Assume that there exist two consecutive red edges. We may assume, without loss of generality, that 9193, 929s, and 9593 are the red edges. By Proposition 7, we have ^919392 > «3(^) and min(Zg 2 85, as(?). At the same time we know that 2?r < 2as(^) + ^(y) + hence /929s9s < 2x - a^V3) - c*5(v?) < «s(^) + «4(^)- Similarly, We may assume that ^929395 < ^959391. In view of Remark 3, Lemma 12, and Lemma 14 (i), we have 1929394959s! > |9293949598| and |g596979i98| > 1 9596 ^ki 9s | where q2q'3q'4q5q8 and q5q'6q'7qiqs are symmetric convex pentagon of side length y? whose symmetry axes go through q5. Thus Iqiqiqsqiqsqsqrl > ^iqiq'^h^'MOur lower and upper bounds for the angles between the red edges remain true while the degree of gg remains seven in the Delone triangulation, i.e., the structure of the Delone edges around q$ remains unchanged. Fix the triangle q\q^qs and increase ^q^q&qi in such a way that q^q^q^qsqs and qsqQq'^qiqs remain symmetric convex pentagon of side length if> whose symmetry axes goes through 95. By Lemma 17, the sum of the areas of the two pentagons is a strictly concave function of /.q^qsqi- The sum of the areas of the two pentagons is maximal in the symmetric position, i.e., where /.q^qsqs — ^.qsqgqi, hence the sum of the areas of the two pentagons decreases as /.q5qsq\ increase and attains its minimum where ^q^q^qi is maximal, i.e., where 929s949598 is congruent with P(
\9i 929.394 959697 1-
Now /9i9892 < 2?r - 2a 5 (
). If 9192 > ?, then fix the pentagon 929,3949598 and decrease ^919392 until 9192 = V7 in such a way that q'^q'^q^qi q& remains a symmetric convex pentagon of side length
), and 9596979i98 is a symmetric convex pentagon of side length (£> whose symmetry axis goes through q'5. We know that 1 91929394 9s 9697 1 > \S(T,P,p)\. We will show that |5(T,P,p)| + 15|T(^)| > 4?r, a contradiction. To finish the proof we show that 4?r — 15|T(<^)| < min(|5'(5<, 5*,p)|, \S(S,r,P)\,\S(T,P,p)\) for ^ <
ARRANGEMENTS OF 13 POINTS ON A SPHERE
175
First we show that \S(S, S»|, \S(S, r, P)\,\S(T, P,p)\ are increasing functions of (p. We know that |T(<^)|, |6*(<^)|, |P(<^)| are increasing functions of The greater angle ^.q^qsq^ = 27r — &$(<£) — as(^) is a strictly decreasing function while the sides are strictly increasing functions of
D
Lemma 20. Let k > 13 and max(l. 02029547044, ak+l) < y < f . There exists no point whose degree is three in the Delone triangulation of a p-final point set of k points. Proof. Set ^9s9i94 > ^949192- Set Zg29i9s = fti, ^9s9i94 = #2, ^949i92 = fa- We know from Lemma 10 that ft < a 5 (y?) < a5(|), hence /?3 > 27r-2a 5 (^) > 27T-2a 5 (|). On the other hand /32 > 2x - ft - f32 from which / 3 2 > 7 r - § - > 7 r > 1.93566 > a4(§) > a 4 (v») (> By Lemma 11 (ii), for j = 1,2, there exists a symmetric convex pentagon j(/3j,q>) of side length
176
BOROCZKY AND SZABO
Now /2 | Mj(/3j, ?)!, j = 1,2. Let 2<M5 be the Delone triangle adjacent to the Delone triangle qiq^q^ along the side q^q^. If fa < 0:4(93), then let Q and M'z(fa,(p) denote the quadrangle qiq^qsq^ and the rhombus q-2q\q^q^ of side length 92, respectively. By Lemma 11 (i), wehave|Q|>|M 3 G3 3 ,¥>)|. If /?3 > 0:4(9?), then the quadrangle qiq^q^q^ is a part of a convex pentagon PS of side length 9?. Then, by Lemma 11 (ii), there exists a symmetric convex pentagon MS ($3, 9?) of side length 9? in which two adjacent angles are fa and Let Ti,T2,... ,T 2 /c_4 denote the triangles of the Delone triangulation of the 9>final point set. We may assume that 1 < n < 8 for the triangles Tn contained in the polygons Pi,Pz,Q and that 1 < n < 9 for the triangles Tn contained in the polygons Pi^P^^P^For j = 1,2,3, if we fix /9j, then the function \Mj(flj,(p)\ is a strictly increasing function of 9? while Mj(flj, 04(97) holds, then Mj(/3j,ipi) also exists since 04(97) > 04(9?!). If we fix /?3, then the function \M'z(f3^^(f>}\ is a strictly increasing function of 9? while M'^(ft^^(p) is a rhombus, i.e., while fa < 04(97). We will decrease 97 to (pi. Note that M^(fa^(f>] remains a rhombus in the whole range if fa 5: 04(97}). If fa > 04(971), then there exists a value 971 < 97' < 97 such that fa = 0.4(97'). Hence \M^(fa^}\ + |T(y»)| > |M^(/3 3 V)I + I?V)I = Thus we obtain that (i) if fa > 04(97), then
n=10
(ii) if 04(921) < fa < 04(97), then
ARRANGEMENTS OF 13 POINTS ON A SPHERE
177
(iii) if 03 < 0:4(921), then 2
2Ar-4 n=9
The function jMg (,$3,921)1 is a strictly increasing function of $3 since if we decrease the smaller angle of a rhombus, then the area of the rhombus decreases. For j — 1,2,3, the function |Mj(/3j,?i)| is also a strictly increasing function of 0j. Indeed, we know from Lemma 14 (iii) that the area of a symmetric convex pentagon is a strictly decreasing function of its greatest angle if the angles on the side of the pentagon perpendicular to the symmetry axis are less than 0:5(901). We also know that the greatest angle of such a pentagon is a strictly decreasing function of /3j. Thus if we decrease ftj, then the area of the pentagon decreases. For the existence of the pentagon ftj > 0:4(951) must hold. We have seen that f3\ > 02 > 0-4(921). If we decrease (3% to such a 0'3 for which #, > o 4 (y?i) > P'3, then |M 3 (/3 3 , l^3(«4(Vi)>Vi)l = 15(^)1 + ^(^)1 - |^(o 4 (^),^)| + |T(^i)| > IM^^OI + ir^!)!. Now we distinguish two cases. (a) Assume that fti>^-. We have seen at the beginning of the proof that & > ft = 2?r - 2a 5 (i). Hence IMi^,^)! + \M3(^^\ > |M3(^,^i)| > |M^,v»i)| + |T(v>i)|, and \M3(03,¥i)\ > Thus in all cases (i)-(iii) above we have 4?r > 2|Mi(^,9?i)| + \M3(03,if>i)\ + 14|T( 12.74423472838 > 4?r, a contradiction. (b) Assume that f}2 < %j-- We have seen at the beginning of the proof that fa > ftZ = TT - a5 (^/ 3 ). At the same time 83 = IK - fa - fa > ,#T = f -a 5 (f). Hence |M1(A,9l)| + |M 2 (/9 2 ,^i)| > (M^f and M3
178
BOROCZKY AND SZABO
Thus in all cases (i)-(iii) above we have 4?r > |Mi(3f, 12.56637061459 > 4?r, a contradiction again. This completes the proof of Lemma 20. D 8. A GRAPH LEMMA
In this section we concentrate on the combinatorial structure of Delone triangulations of (/>final point sets of exactly 13 points. Lemma 21. Let G be the graph of the Delone triangulation of a set of 13 points on S2. Suppose that each vertex of G is of degree four, five, or six. Then G contains two non-adjacent vertices of degree six. Proof. Let {pi,p2> • • • 5 £>is} denote the vertex set of G. As usual, the cycle formed by the edges pilpi2iPi2Pi3i • • • iPii-iPinPiiPii °f G will be denoted by (pi1,pi2,... ,pi,). If (piiPjiPi) bounds a face of G, then this will be denoted by \pitPjiPi]- If (pi,PjiPi) does not bound a face of G, then this will be denoted by ] p i , p j , p i [ . First we prove that every cycle of length three in G bounds a face of G. Suppose, for contradiction, that, say, }PI,P2,P3[- Split G into the graphs GI and G% of vertex number v and 16 — v, respectively, along the cycle (pi,p2,Ps) in such a way that (P\,P2,P3) belongs to both G\ and GI, i.e., \P\iPiiPz] holds in both G\ and G-2- We may assume, without loss of generality, that 4 < v < 8. The cycle (pi,p2,p3) will be called the boundary of GI and G<2, the remaining parts of G\ and G? will be called the interiors of G\ and 6*2, respectively. It is clear that only the boundary can contain vertices of degree three, the interior vertices are of degree at least four. This immediately implies that v = 4,5 cannot occur, otherwise we have an interior vertex of G\ of degree three. Thus we may assume that 6 < v < 8. For i = 1,2, at most one of the vertices P1,P2-,P3 can be of degree three in Gi since a triangulated planar graph of at least five vertices cannot contain two adjacent vertices of degree three. Hence, for i = 1,2, at most one of the vertices pi,p2->P3 can be of degree three and at most one of the vertices P\,P2,P3 can be of degree five in G;, the other vertices among pi,p2,Ps are of degree four in G;. Assume that the degree of p\ is as large as the degrees of p% and p$ in GI. Simple case analysis show that • for v = 6 there are two essentially different triangulated simple planar graphs, exactly one of them is suitable as GI, • for v = 1 there are five essentially different triangulated simple planar graphs, exactly one of them is suitable as GI, • for v = 8 there are fourteen essentially different triangulated simple planar graphs, exactly one of them is suitable as G\.
ARRANGEMENTS OF 13 POINTS ON A SPHERE
FIGURE 12. The triangulated simple planar graphs for v = 6,7,8.
179
BOROCZKY AND SZABO
180
Figure 12 shows the possible triangulated simple planar graphs for v = 6,7,8. In this figure each graph is stereographically projected from one of its vertex of maximum degree. The graphs suitable as G\ are boxed in Figure 12. For v — 8, the graph GI also has eight vertices, hence it is identical - up to a cyclic permutation of the vertices P1,P2-,P3 - to GI. This means that Pi is of degree at least seven in G, a contradiction. For v = 7, the vertex p\ is of degree three. Let p4 denote the third neighbour of p\ different from p2 and p^ in G<2- Now the cycle (P4,P2,P3) splits G into two graphs each of which is of eight vertices. But this is impossible as we have already seen. For v — 6, if a vertex, say p1? is of degree three in 6*2, then, denoting by p4 the third neighbour of p\ different from p2 and ^3 in G^-, the cycle (P4,P2,P3] splits G into two graphs of seven and nine vertices, respectively, which is impossible. On the other hand, if each oip\,p2,p$ is of degree four, then let Pi^-, Pi2 •, Piz denote the interior vertices of GI for which \pi-L,Pi,p?\, \Pi2iPiiP3\-, and \piz,Pi,p2\ hold in (72. Now Pil,pi2,piz are pairwise distinct and they form a cycle which splits G into two graphs of seven and nine vertices, respectively, a contradiction again. This proves that every cycle of length three in G bounds a face of G. Next we prove that if G contains a vertex of degree five whose neighbours are also of degree five, then G is uniquely determined. Namely, G contains exactly one vertex of degree four, two of its neighbours are non-adjacent vertices of degree six, and the remaining ten vertices are of degree five.
p9
plO
FIGURE 13. The (first and second) neighbours of p\ in G. Let pi be the vertex of degree five whose neighbours are also of degree five. I- t P2,p3iP4iP5iP6 be the five neighbours of p\ in the cyclic order of vertices around p\ in G. Finally, let pil-,pi2-,Piz-lPi±-,Pi$ be the vertices of G different from pi for which lpil,p2,p3],lpi2,P3,P4],[pi3,P4,p5},[pii,p5,P6},[pi5,P6,Pi] p
ARRANGEMENTS OF 13 POINTS ON A SPHERE
181
hold. It is easy to see that 21,^2,23,^4,^5 are pairwise distinct and each of them is at least seven (do not forget that each cycle of length three in G bounds a face of G}. Set ij = j + 6 for 1 < j' < 5. Now the vertices P7,P8,.P9,P10,P11 form a cycle (p?,.P8,P9,Pio,Pii) in G. The situation is shown in Figure 13. The remaining two vertices, pi2 and ^13, lie in the pentagon bounded by (p7iP8,P9,PiOiPu)- Since p^ and ^13 are of degree at least four, therefore there exists a vertex among p7,pg,;P9,Pio,Pii, say p?, which is adjacent to both pi2 and ^13. The degree of p-? is at most six, hence we have - up to symmetry - that [pr,p8,Pi3],[p7,Pi3,Pi2],b7,Pi2,Pn]- Now consider the triangulated empty hexagon bounded by (p8,P9,Pio,Pii,Pi2,Pi3) in G. Then either [^9,^13,^12] or bio, Pis, ^12] holds otherwise p12 or p^3 is of degree three. We may assume, again by symmetry, that bio,Pis,^12] holds. Since pio is of degree at most six, therefore p\s is adjacent to p$. From this the assertion follows. Now Lemma 21 can be proved as follows. The last observation implies that G contains at least two vertices of degree six. Indeed, by Euler theorem, we have CQ — €4 — 1 where cn denotes the number of vertices of degree n in G. Hence, if CQ = 1, then 05 = 12. However, in this case G contains a vertex of degree five whose neighbours are also of degree five, thus G contains two vertices of degree six, a contradiction. First assume, for contradiction, that CQ = 2 and the two vertices, say Pi and £>2, of degree six are neighbours. Now the neighbours of p\ and p% form a cycle (p3,p4,p5,pe,P7,P8,P9,Pio) of length eight where the vertices Ps,P4,P5,P6,P7 are incident to p% and the vertices p7,Ps,P9,Pio,Ps are incident to pi. The situation is shown in Figure 14. The octagon bounded by (P3,P4,P5,P6,P7,P8,P9,P10) contains the vertices pii,pi2,Pis- We know that G contains a vertex pi of degree four. We will distinguish three different cases. p4
p3
p7
p8
FIGURE 14. The neighbours of p\ and p? in G. (i) i = 3,7. We may assume, without loss of generality, that i = 3. Then P4 and PIQ are adjacent in G. Now pu is of degree five and its neighbours
182
BOROCZKY AND SZABO
are also of degree five, thus G contains two non-adjacent vertices of degree six, a contradiction. (ii) i — 4,5,6,8,9,10. We may assume, by symmetry, that i — 8 or i — 9. It is easy to see that p4 is adjacent to one of pn,pi2,Pi3, say to pn. If i = 9, then pii is adjacent to p8 and pw and the cycle (p3,P4,P5,P6-,P7,p8,Pii,Pio) separates the vertices PI,P2,P9 from the vertex p\^- Now p\2 is of degree five and its neighbours are also of degree five, thus G contains two non-adjacent vertices of degree six, a contradiction again. (iii) i = 11,12,13. Consider the octagon bounded by the cycle (^3,^4,^5, P6-,P7,P8->P9iPio) and containing the vertices pn-,Pi2,Pi3- Let Pj denote the fifth neighbour of p^ different from pi,p2,P4,Pio- Since G is simple and the vertices P3,J>4,£>5,P6,P7,P8,P9,£>10 are of degree five, therefore j > 11. Set j = 11. Similar argument shows that the fifth neighbour of pi different from pi,p2,p6,p8 is either p\i or pis, say p^. Also, the fifth neighbour of P4 different from p^^Ps^Ps^Pn must be ^13. Now consider the triangulated empty octagon bounded by the cycle (p5,p6,Pi2-,P8,P9,Pw,Pu-,Pi3)- Note that from each vertex different from pn of this octagon starts at least one diagonal of the octagon belonging to the triangulation. However, this is impossible since in any triangulation of a polygon we can always find at least two vertices which are incident to none of the diagonals belonging to the triangulation. Next assume, for contradiction, that c& — 3 and the three vertices, say pi, P2-, and ps, of degree six are pairwise neighbours. Now the neighbours of pi, p2, and p3 form a cycle C = (p 4 ,P5,P6,J>7,P8,P9,Pio,Pi 1,^12) of length nine where the vertices P4,p$,p6,p7 are incident to ^2, the vertices p7,ps,.P9?Pio are incident to pa, and the vertices £>io,;Pii,Pi2,P4 are incident to p\. The situation is shown in Figure 15. The nine-gon bounded by C contains the vertex 13.
p6
p9
p5
plO
pll
FIGURE 15. The neighbours of pi,p2,Ps in G.
ARRANGEMENTS OF 13 POINTS ON A SPHERE
183
The neighbours of pis form a cycle C' = (pinPi2, • • • ,p 2i ) of length either four or five in G. Observe that if a vertex pi of C belongs to C", then at least one of the two neighbours of pi in C also belongs to C", otherwise Pi is of degree at least six in G. This implies that either p^, p; 2 ,... ,pi{ are consecutive vertices in C or p^,^, • • • ,p;( can be partitioned into two groups of cardinalities 2 and / - 2, respectively, so that the vertices in each of these groups are consecutive vertices in C (do not forget / < 5). Now the remaining 9 — / vertices of C are also either consecutive vertices in C or they can be partitioned into two groups so that the vertices in each of these groups are consecutive vertices in C. Thus there exist at least two but at most five consecutive vertices in C which do not belong to C'. By symmetry, we may assume that these points are p e ? - - - ,Pm where 7 < m < 10. We may also assume that p$ = p;2 and pm+i — Pi3 • This means that there exists a triangulated empty polygon P in G bounded by the cycle (ps,... ,p m+ i) of length at least four. Since both p$ and p m +i are of degree at most five, therefore they can be adjacent to none of the diagonals belonging to the triangulation of P. However, p$ and pm+i are neighbouring vertices of P, therefore at least one of them must be adjacent to a diagonal belonging to the triangulation of P, a contradiction. This proves that if CQ — 3, then there exist two non-adjacent vertices of degree six in G. Finally, if CQ > 3, then trivially exist two non-adjacent vertices of degree six in G. This completes the proof of Lemma 21. D Lemma 19, Lemma 20, and Lemma 21 imply Corollary 2. Let max(1.02029547044,ai4) <
REFERENCES [1] Boroczky, K.: The problem of Tammes for w = 11. Studia Sci. Math. Hungar. 18 (1983), 165-171. [2] Boroczky, K.: The Newton-Gregory problem revisited. This volume. [3] Danzer, L.: Endliche Punktmengen auf der 2-Sphare mit moglichst grofiem Minimalabstand. Habilitationsschrift, Universitat Gottingen, 1963. (English translation: Finite point-sets on S2 with minimum distance as large as possible. Discrete Math. 60 (1986), 3-66.) [4] Fejes Toth, L.: Tiber die Abschatzung des kiirzesten Abstandes zweier Punkte eines auf einer Kugelflache liegenden Punktsystems. Jber. Deutsch. Math. Verein. 53 (1943), 66-68.
184
BOROCZKY AND SZABO
[5] Fejes Toth, L.: On the densest packing of spherical caps. Amer. Math. Monthly 56 (1949), 330-331. [6] Fejes Toth, L.: Remarks on a theorem of R. M. Robinson. Studio, Sci. Math. Hungar. 4 (1969), 441-445. [7] Fejes Toth, L.: Lagerungen in der Ebene, auf der Kugel und im Raum. Zweite Auflage. Springer Verlag, Berlin-Heidelberg-New York, 1972. [8] Giinther, S.: Ein stereometrisches Problem. Archiv Math. Physik (Grunert) 57 (1875), 209-215. [9] Habicht, W., van der Waerden, B. L.: Lagerung von Punkten auf der Kugel. Math. Ann. 123 (1951), 223-234. [10] Hars, L.: The Tammes problem for n — 10. Studia Sci. Math. Hungar. 21 (1986), 439-451. [11] Hoppe, R.: Bemerkung der Redaktion zu 'Bender, C.: Bestimmung der grossten Anzahl gleicher Kugeln, welche sich auf eine Kugel von demselben Radius, wie die iibrigen, auflegen lassen. Archiv Math. Physik (Grunert) 56 (1874), 302-306.' Ibid. 307-312. [12] Leech, J.: The problem of the thirteen spheres. Math. Gazette 40 (1956), 22-23. [13] Robinson, R. M.: Arrangement of 24 points on a sphere. Math. Ann. 144 (1961), 17-48. [14] Schiitte, K., van der Waerden, B. L.: Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz? Math. Ann. 123 (1951), 96-124. [15] Schiitte, K., van der Waerden, B. L.: Das Problem der dreizehn Kugeln. Math. Ann. 125 (1953), 325-334. [16] Tammes, P. M. L.: On the origin of number and arrangement of the places of exit on the surface of pollen grains. Rec. Trav. Bot. Neerl. 27 (1930), 1-84. E-mail address: [email protected] ''Karoly Boroczky' 1 E-mail address: lszaboQilab.sztaki.hu ''Laszlo Szabo''
ON POINT SETS WITHOUT k COLLINEAR POINTS
PETER BRASS1 Institut fur Informatik, Freie Universitat Berlin, TakustraBe 9, D-14195 Berlin, Germany
ABSTRACT. In the following we discuss two problems on sets of n points in the plane, in which no k points are collinear: • the maximum number of k — 1-point lines (generalized orchard problem), and • the largest cardinality of a subset with no k — 1 points collinear. For both problems we present a slight improvement of the current bounds. We also give a simpler construction that reaches the same asymptotic bounds as Ismailescu's recent construction, which in turn improved Grunbaum's long-standing lower bound.
1. INTRODUCTION A classical general-position restriction for point sets is 'no three points on a line'. Many problems and results exist for such point sets, especially all problems dealing with 'order types' like the Erdos-Szekeres convex polygon problem, the halving lines problem, the maximum crossmatching problem etc. There is now even a complete list of all possible order types of point sets of up to ten points with no three points collinear [1, 2]. Much less is known about the point-line incidence structure in sets 'no four points on a line' or more generally 'no k points on a line'. Several problems were stated in literature for such sets, but not much progress has been made up to now, and it is even nontrivial to construct interesting examples of such sets. It is the aim of this note to collect the results and point out several small improvements for two such problems, the generalized orchard problem, and the general position subset selection problem. Supported by DFG Heisenberg grant Br 1465/5-2. 185
186
BRASS 2.
THE GENERALIZED ORCHARD PROBLEM
The classical orchard problem asks for the maximum number of lines containing three points that can be spanned by a set of n points with no four points on a line. This problem has quite a long history, which is surveyed in [4], but is traditionally known as Sylvester's orchard problem, although earlier references exist. There is a trivial upper bound of
since each pair of points can belong to at most one three-point line, and each three-point line contains three pairs; and it was shown, using a construction based on points selected from a cubic curve [4, 14], that this trivial bound is asymptotically best possible. The currently best bounds are
where the upper bound follows from the existence of at least -^n two-point lines ('ordinary lines') [5]. Exact values were determined in [4] and again in
[16]. /(n)\
5 6 7 8 9 10 11 12 13 14 15 16 6 8 10 13 16 20 37
Thus the classical orchard problem is, up to a small gap, essentially solved; it might still be interesting to look for a characterization of the extremal sets (are they necessarily on a cubic curve?), but we do understand the asymptotic behaviour of the extremal numbers. The situation is quite different if we ask for the maximum number i£ rchard (n) of Appoint lines in a set with no k + 1-points collinear, for k > 4. This seems to be a natural generalization, but although it was mentioned many times by Erdos [6, 7, 12, 13], it received less attention since it is much more difficult. This problem was first stated by Erdos and Karteszi in two papers written in Hungarian 1962/63. Some progress was made by a nice construction of Griinbaum [17], and very recently, an even better construction of Ismailescu [18]= There is again a trivial upper bound ££ rchard (n) < ^-i) O(n2}, by counting pairs, and in the 'Handbook'-article [13] Erdos and Purdy even wrote 'For k > 3 there are no nontrivial upper bounds. For example, tf chard (n) < ^n2 is trivial, but not even ^ rchard (n) < ^(1 - e)n 2 is known.' But indeed this can be reached by a very simple improvement of the counting of pairs: Proposition. £f chard (n) < —n2 + O(n).
POINT SETS WITHOUT k COLLINEAR POINTS
187
Proof: Melchior's inequality [19] (a simple consequence of the Euler formula) for the numbers ti of z'-point lines states <2 > 3 + *4 + 2*5 + 3t6 + • • • if tn = 0.
Thus *2 > *4, so 7*4 «2
+ 6*4 < (2) and *4 < ±n2.
D
Thus by adding a very small amount of geometry (Melchior's inequality holds also for pseudoline arrangements) we can improve the upper bound. But the true challenge is to find a subquadratic upper bound, or a good lower bound. It is simple to construct an Q(nlogn) lower bound by iterated Minkowski sums. The lattice cube {!,... , k}d (or any projection of this set into the plane) is a set of n = kd points, no k + 1 -of them collinear, which spans | ((A: + 2)d —fcd)lines with k points each, which gives a lower bound of
But real progress was made only by Griinbaum [17], who found recursive construction, which obtains from a set X of n points, no k + 1 of them collinear, and containing ra lines of k points each, and an integer parameter <7, a set of qn + m points, no k + 2 of them collinear, and containing qm lines of A; + 1 points each. For this he chooses a family ( t £ [0,1], intersect in a single point. The family <^(z,y) : = (t,+(l_y^l~^x(l_t}r t*+(1J'$+%~t+I<,_t})) has this property. Then the new set consists of the union of all projective copies , i = 0,... , — 1 and for each line / spanned by X the intersection
BRASS
188
point of the image lines ( p 0 ( l ) , . . . , ^ and choosing q = n^^ gives Grunbaum's lower bound t°,n, TchaTd (n) > ckn1+^. ^ ' rv
It is simple to see that one can improve the lattice cubes by adding some further points, but Ismailescu found a tricky combination of several cubes that even has a better exponent. He reached with n — kd — 1 points a total of k I
^
'
I
V
v
'
/
"
'
k +1
2
k,
,
collinear fc-tuples without k + 1 collinear points. So t°k a (n) > c^n lo « fc 3 which gives for k = 4 the same order ^l(n^) as Grunbaum's bound, but for 5 < k < 35 it is better; and since Grunbaum's bound is a recursion in fc, this improves the lower bound for all k > 5. Thus the currently best lower ,
,
,
,
bounds are if chard (n) > c 4 n2, ^ rchard (n) > ckn orchard
>
for k
for 4 < k < 18 and
>
Ismailescu's set 5(4,3) and extended cubes: 63/70/80 points with 59/100/130 4-lines A different construction which gives the same asymptotic performance as Ismailescu's is as follows: denote for any set X of points in d-dimensional space and real number a by (a, X) the set
Then we construct from two sets (oti, Xi) U (02,^2) U . . . U (ak,Xk) and («!, YI) U (o;2, ^2) U . . . U (afc, Yfc) in dx + 1 and dy + 1-dimensional space (with the same oti, . . . ,0;^) a 'hyperplane-wise' cartesian product (ai, (Xl x YI)) U (a2, (X2 x Y 2 ) ) U . . . U (a fc , (Xk x y fc )). If both original sets do not contain fc + 1 collinear points, then this 'product' set also does not contain k + 1 collinear points, as can be seen by a projection on the 'factor' sets. Also, if we count only those fc-lines not contained in a
POINT SETS WITHOUT k COLLINEAR POINTS
189
hyperplane (aj,]R dx ), (aj,IR dr ), their number is multiplicative. Thus if we have some sets Xi,... ,Xk C lRd, each containing at most a points, and not containing k + l collinear points, and numbers ai , . . . , a/y such that the d + 1-dimensional set (ai,X\) U (a-^iX^} U . . . U (ctk,Xk) contains b lines that intersect each of the sets (oti,Xi) in a single point (fc-lines), then the cartesian D-th power set (ai, Xf* ) U (0:2, X%} U . . . U (ajfc, X®) is a set of at most n = kaD points in JRdD+l, no k + l of them collinear, and containing at logfe
least bD = (f ) loga lines of k points each. If we use (ai, 0:2, • • • , ctk-i> ak)
=
1 < i < k (similar to Ismailescu's construction) we find a = k, b = k + 4; thus <£rchard(A;D+1) > (k + 4)D.
Basis case and first product of the new construction for k — 4 In this simplest case, this leads to another problem already studied under the title of 'probing lines by lines': if there is an unknown set of lines, of which we only observed the intersection points with a set of k parallel 'probe lines', how can we find the lines of that hidden set, and what is the maximum number /(a, k) of lines that it can contain, if on each of the k probe lines there are only a intersection points [3]. The above examples shows that f ( k , k ) > k + 4, and at least for k < 18, any improvement of that lower bound would also give a better construction for i£rchard(n). 3. THE GENERAL POSITION SUBSET SELECTION PROBLEM
Another related problem, also asked many times by Erdos [9, 10, 11], and still no nearer to a solution, is whether a set of n points in the plane, no k + 1 of them collinear, contains a large subset in which no k points are collinear. This is wide open for each A; > 3. It is always possible that there actually is a subset containing some positive fraction of the points, but the best lower bound is by a greedy or randomized selection, giving a subset of
190
BRASS
cn ^ fc-i1 points in which no A; are collinear. If we denote this number, the minimum cardinality of the maximum independent subset (containing no k collinear points) by Sfc(n), then in the simplest case (A; = 3, so no 4 points collinear, but many collinear triples) this gives a lower bound of c\/n and an O(n) upper bound. A slight improvement of the lower bound follows from a result of [20] on independent sets in partial Steiner systems: i
1
Theorem 1. s/e(n) > Proof: The collinear A>tuples form a partial Steiner A>tuple system, i.e. a system of A;-element subsets such that any two of them intersect in at most one element. It was shown by [20] (for k — 3), [21] (all A;) that any such system of subsets contains an independent set of size at least c^n k~l (logn) k~l, where an independent set is a set that does not contain any of the A;-tuples. D Unfortunately the same authors also showed that this bound is best possible in the class of partial Steiner systems, so for a further improvement we need more geometry beyond the fact that any two lines intersect in at most one point. The upper bound also admits a very slight improvement to o(n) by use of the density version of the Hales-Jewett theorem [15]. Theorem 2. Sfc(n Proof: We consider a general plane projection of the lattice cube {!,... , k]d. This is a set of n — kd points, no k + 1 of them collinear. Suppose we always select a positive fraction en of the points without selecting a complete line, then we can also do that to the lattice cube. But the density version of the Hales-Jewett theorem [15] says that for each e > 0 there is a cfo(A;, e) such that any subset of ekd points of a lattice cube kd with d > do(k, e) will contain a 'combinatorial line', which is a line of A; points obtained by keeping some coordinates at a arbitrary fixed values, and taking the same parameter t = 1,... , k for all the other coordinates. D The 'combinatorial lines' used in the Hales-Jewett theorem are really only a subset of the Ar-point lines occuring in the kd cube, so this upper bound is too large. But for small dimensions the kd cube is really a bad example, since it almost reaches the ^r-n upper bound. Better examples can be obtained by deleting many points from the cube.
POINT SETS WITHOUT k COLLINEAR POINTS
191
No-4-collinear sets with no-3-collinear subsets
REFERENCES [1] O. Aichholzer, H. Krasser: The point set order type data base: a collection of applications and results, in: 'CCCG 01', 13th Canadian Conf. Comput. Geom. (2001). [2] O. Aichholzer, F. Aurenhammer, H. Krasser: Enumerating order types for small point sets with applications, in: 'SCG 01', 17th ACM Symp. Comput. Geom. (2001) 11-18. [3] M. de Berg, P. Bose, D. Bremner, W. Evans, L Narayanan: Recovering lines with fixed linear probes, in: 'CCCG 98' 10th Canadian Conf. Comput. Geom. (1998), see extended version at http://www.cs.arizona.edu/people/will/papers/probe.ps.gz [4] S.A. Burr, B. Griinbaum, N.J.A. Sloane: The orchard problem, Geometriae dedicata 2 (1974) 397-424. [5] J. Csima, E.T. Sawyer: There exist 6n/13 ordinary points, Discrete Comput. Geom. 9 (1993) 187-202. [6] P. Erdos: Research Problems 36, Periodica Math. Hungarica 15 (1984) 101-103. [7] P. Erdos: Problems and results in combinatorial geometry, in: 'Discrete Geometry and Convexity', Annals New York Acad. Sci. 440 (1985): 111. [8] P. Erdos: Some of my old and new problems in elementary number theory and geometry, Congressus Numerantium 50 (1985) 97-106. [9] P. Erdos: On some metric and combinatorial geometric problems, Discrete Math. 60 (1986) 147-153. [10] P. Erdos: Some old and new problems in combinatorial geometry, in: 'Applications of Discrete Mathematics', C.D. Ringeisen et al., eds., SIAM, Philadelphia 1988, 32-37. [11] P. Erdos: Problems and results on some extremal problems in number theory, geometry and combinatorics, Rostock Math. Kolloq. 38 (1989) 6-14. [12] P. Erdos: Some of my favorite unsolved problems, in: 'A Tribute to Paul Erdos', A. Baker et al., eds., Cambridge Univ. Press 1990, 467-478.
192
BRASS
[13] P. Erdos, G. Purdy: Extremal problems in combinatorial geometry, in: 'Handbook of combinatorics. Vol. 1', R.L. Graham et al., eds., North-Holland/Elsevier 1995, 809-874. [14] Z. Fiiredi, I. Palasti: Arrangements of lines with large number of triangles, Proc. Amer. Math. Soc. 92 (1984) 561-566. [15] H. Furstenberg, Y. Katznelson: A density version of the Hales-Jewett theorem, J. Anal. Math. 57 (1991) 64-119. [16] O. Giering: Zum Problem von Sylvester Punktmengen mit A;-Tripeln, Sitzungsber., Abt. II, Osterr. Akad. Wiss., Math.-Naturwiss. Kl. 204 (1995) 119-143. [17] B. Griinbaum: New views of some old questions of combinatorial geometry, in: 'Colloq. Int. Theorie Comb., Roma 1973, Tomo I' (1976) 451-468. [18] D. Ismailescu: Restricted point configurations with many collinear ktuples, manuscript 2001, to appear in Discrete Comput. Geom.. [19] E. Melchior: Uber Vielseite der projektiven Ebene, Deutsche Math. 5 (1941) 461-475. [20] K.T. Phelps, V. Rodl: Steiner Triple Systems with minimum independence number, Ars Combinatoria 21 (1986) 167-172. [21] V. Rodl, E. Sinajova: Note on independent sets in Steiner Systems, Random Struct. Algor. 5 (1994) 183-190. E-mail address:
brassQinf.fu-berlin.de
''Peter Brafi''
THE BECKMAN-QUARLES THEOREM FOR RATIONAL d-SPACES, d EVEN AND d > 6
ROBERT CONNELLY Department of Mathematics, Cornell University, Ithaca, NY JOSEPH ZAKS 1 Department of Mathematics, University of Haifa, Israel
ABSTRACT. A. Tyszka [8] proved that every unit-distance preserving mapping of Q8 to Q8 is an isometry. The purpose of this paper is to extend this property to all even d, d > 6, by using the result of Zaks [10]. A mapping / : Qd —>• Qd is called unit-distance preserving if \\x — y\\ = I implies ||/(^) — /(y)|| = 1. The Beckman-Quarles Theorem ([1], see also [2]) states that every unit-distance preserving mapping of Rd to Rd, d > 2, is an isometry. Tyszka [8] (see also [6, 7]) proved that every unit-distance preserving mapping of the rational 8-space Q8 to Q8 is an isometry. Zaks [10] extended Tyszka's result for unit-distance preserving mappings / : Qd —> Qd, for all even d of the form d — 4k(k + 1), as well as for all odd d of the form 2k2 — 1 which are also complete squares. The purpose of this paper is to extend the results of Tyszka and Zaks to all even dimensions d, d > 6.
1 This paper was written while J. Zaks was visiting R. Connelly at Cornell University. The Zaks wish to express their gratitude to Gail Dennis and Bob Connelly for their superb hospitality. 193
194
CONNELLY AND ZAKS
For d even, let Ai and J3,, 1 < i < d, be the Id points in Qd, given by
1,..
2z - 1,
= (0,-. • ?n"5 - (o,.. • ?U, = (o,.. n = (o,.. • ?U, •
5
U
5
1
2z, 1 2' 1 2'
o,
-I
1 2'
o,
2>
1 2'
o,
2' — 2, 2 '
o, ,0),
Let Vd denote the set (Ai, #1, A?,B2, ... ,A^,J5^} in Qd. The polytope Pd — conv(Vd) is, of course, a cross-polytope in Qd. The set Vd is a twodistances set, since \\Ai — _0;|| = A/2 for all z, 1 < z < e/, and \\Ai — A j \ \ = \Bi — Bj \ = \\A.i - Bj | — 1 for all z < j. All the points of Vd lie on the (d — l)-sphere of radius l/A/2, centered at the origin. Every two points of Vd which are at distance A/2 apart are diametrically opposite on that sphere, so let us call them anitpodal pair. Lemma 1. If d is even, then Qd contains a regular d-simplex of edge length one if, and only if, d-\-\ is a complete square. Moreover, the maximal number of rational points in Qd, d even, of mutual distance 1 is either d or d + 1. Lemma 1 is part of the following result, due to Chilakamarri [4]. Let G'(Qd, 1) denote the unit-distance graph, in which the vertices are the points of Qd, and two vertices x and y are connected by an edge if, and only if, jjx — 7/11 = 1. The maximum clique u j ( G ( Q d , I ) ) of the unit-distance graph G(Qd,l)isgivenby d + 1, d, d -f 1, (/, d — 1,
if d is even and d — 4k(k + 1); if d is even and d / 4k(k -f 1); if d is odd and d = 2k2 - 1; if d satisfies condition A; otherwise,
where the condition A is that d is odd, d is riot of the form 2k2 — 1 and there exists a solution to the Diophantine equation dx2 — 2(d — l)y2 = z2 with x ^ 0. We have slightly changed the presentation of the formula for u(G(Qd, 1)), from the one given in [4], due to the fact that if d = 2k2 — 1, then d satisfies the condition A. (Take, for example, x — 4, y — 1 and z — 2k.} Lemma 2. // d > 5, then Qd contains a triangle T having edge lengths 1, A/T and ^/r, for any rational number r, for which 1 < PROOF OF LEMMA 2. Let d > 5, and let r be any rational number satisfying 1 < 2-y/f. The vertices of T can be chosen to be the points (±1/2,0,... ,0) and ( 0 , z , y , z , t , 0 , . . . ,0), provided (±l/2) 2 + x2 + y2 + z2 + t2 = r, where
THE BECKMAN-QUARLES THEOREM
195
x, y, z and t are rational numbers. Therefore x2 + y2 + z2 + t2 = r — 1/4, where r — 1/4 > 0. The existence of such four rational numbers is given by Lagrange's Four Squares Theorem. D Lemma 3. If x, y, z and t are points in Qd, such that \\x-y\\ = \\z-t\\, then there exists a congruence f : Qd —»• Qd, such that f ( x } = z and f ( y ) = t. PROOF OF LEMMA 3. A suitable rational congruence / can be given by a translation h by the vector z — x, followed by a reflection with respect to the perpendicular bisector of the edge [h(y),t]. For more details, see [9]. D Lemma 4. // d is even, d > 4 and if f : Vj —>• Qd is a unit-distance preserving mapping, then either f(A{] = /(#;) holds for some i, 1 < i < d, or else \\f(Ai) - /(£;)! I = V2"holds f°r al1 i, 1 < i < d. PROOF OF LEMMA 4. Let d > 4 be even and let / : V& ->• Qd be any unit-distance preserving mapping. Suppose that f(Ai) ^ /(-#;) holds for all l 4 and if f : Vj —> Rd if- a unit- distance preserving mapping, then either f(A{} = f(Bi) holds for some i, 1 < i < d, or else ||/(A t -) - /(#;)! I = V^ holds for all i, 1 < i < d.
CONNELLY AND ZAKS
196
Lemma 5. If d is even, d> 6, and if\\f(x] — f(y}\\ = 1 for some antipodal pairs x and y ofVj and some unit-distance preserving mapping f : Qd —» Qd, then f(Vd) contains a regular d-dimensional simplex of edge length one. PROOF OF LEMMA 5. If, say, ||/(Ai) - /(#i)|| = 1, then /(Ai), f ( B l ] and f(A-2) form an equilateral triangle of edge length one, hence the (d + l)-set f(B\) U {/(A z -) | 1 < i < d} forms the vertices of a regular rf-simplex of edge length one in Qd. D Lemma 6. If d is even, d > 6 and if d + 1 «s every unit-distance preserving mapping f : Qd
i a complete square, then Qd preserves the distance
PROOF OF LEMMA 6. Suppose d is even, d > 6 and d+ 1 is not a complete square, and let / : Qd —> Qd be any unit-distance preserving mapping. The Moser-Moser spindle (see [8, 9, 10]), as shown in Figure 1, is the amalgamation of a triangle and two pairs of adjacent equilateral triangles. (The dotted lines are not part of the configuration.) It was used to show that the chromatic number of the unit-distance graph in the plane is at least 4.
C B B C Figure 1. The Moser-Moser Spindle as an amalgamation as follows. It consists of d + 1 congruent Define the configuration copies TO, TI, ... , Td of Vrf. For every i, 1 < i < d, consider the z'th antipodal pair of vertices A;, i of TO together with some antipodal pair of vertices A* and B* of T;. Let S = {U,Vi,V2} be a triangle of edge lengths \\U - Vi\\ = \\U - V2\ = \/2 and Jl^i - V2\\ = 1. The existence of the triangle S follows from Lemma 2. There exists a rational congruence transformation ; of Qd such that gi(U] — A; and #;(Vi) = /?;; there exists another rational congruence transformation hi of Qd such that /i,-(A*) = A{ and hi(B*) = gi(V2); see Figure 2.
197
THE BECKMAN-QUARLES THEOREM
hf
inT;
x
R
U
Figure 2. The Amalgamations of the T,-'s to get Mj The configuration Md is taken as the union TO Ui<; 6 and if d + 1 is not a complete square, then every unit-distance preserving mapping f : Qd —» Qd preserves the distance 2. PROOF OF LEMMA 7. Let d be even, d > 6 such that d-\-1 is not a complete square, and let / : Qd —> Qd be any unit-distance preserving mapping. By Lemma 6 the mapping / preserves the distance \/2. Let the mapping g : Qd —» Qd be given by the following dx d block-matrix 5, in which d/2 copies of the matrix A appear along the main diagonal:
A=
B=
/A 0 0 A
0 \ 0
^ 0 0
The mapping g sends the usual d unit vectors to mutually orthogonal vectors of length \/2, hence it represents a blow-up mapping by the factor
198
CONNELLY AND ZAKS
of ^/2. It follows that a proof, similar to the one given for Lemma 6, implies that the mapping / preserves the distance 2. This completes the proof of Lemma 7. D We thank M. Perles for mentioning to one of us the property of such a construction, which enables us to expand Qd by any factor of the form ^/f, provided r is the sum of the squares of two rational numbers. Theorem 1. For every even d, d > 6, every unit-distance preserving mapping f : Qd —* Qd is an isometry. PROOF OF THEOREM 1. Let d be an even number, d > 6. If d -f 1 is a complete square, then the assertion of Theorem 1 holds by [10]. If d+1 is not a complete square, then every unit-distance preserving mapping / : Qd —> Qd preserves the distance 2, by Lemma 7. It is a well-known result of Benz [3] (see also [5, 8, 10]), that every mapping / : Qd —»• Qd that preserves the distances 1 and 2 is an isometry. This completes the proof of Theorem 1. D Based on the idea of Tyszka [8], it follows from both [10] and Theorem 1 that the following discrete version holds. Corollary 1. For every even d, d > 6, and for every two points x and y in Qd, there exists a finite set Sx,y in Qd, containing x and y, for which ||/(x) — f ( y ) \ \ = \\x — i/H holds for every unit-distance preserving mapping 9 —»• Od • Jf •• °x,y ^ V Corollary 2. For every even d, d > 6, and for every t — \/a2 -f b2 in which a and b are rationals, every mapping f : Qd —> Qd which preserves the distance t is an isometry. REMARK Notice that in Theorem 1 the target space is assumed to be Qd and not Rd. In some related results, such as when the mapping / is a function from Qd, where d is an even number of the form 4k(k + 1), then the target space can be taken to be Rd instead of Qd, and it is still possible to conclude that it is a congruence into Rd. For our result, where d is even, d > 6, and d ^ 4k(k + 1), we need the target space to be Qd in order to use the property that the target space does not contain a unit-distance d-dimensional simplex. REMARK J. Zaks extended recently Tyszka's result, by showing that every unit-distance preserving mapping of Qd to Qd is an isometry for all odd d of the form 2k2 — 1 ; this will appear soon in the Journal of Discrete Mathematics.
THE BECKMAN-QUARLES THEOREM
199
REFERENCES [1] F. S. Beckman and D. A. Quarles Jr., On isometrics of Euclidean spaces, Proc. Amer. Math. Soc. 4 (1953), 810-815. [2] W. Benz, An elementary proof of the theorem of Beckman and Quarles, Elemente der Math. 42 (1987), 4-9. [3] W. Benz, Geometric Transformations (in German), Biblio. Inst. Mannheim, 1992, 322 pp. [4] Kiran B. Chilakamarri, Unit-distance graphs in rational spaces, Discrete Math. 69 (1988), 213-218. [5] B. Farrahi, A characterization of isometrics of rational spaces, J. Geom. 12 (1979), 65-68. [6] A. Tyszka, A discrete form of the Beckman-Quarles theorem, Amer. Math. Monthly 104 (1997), 757-761. [7] A. Tyszka, Discrete version of the Beckman-Quarles theorem, Aequat. Math. 59 (2000), 124-133. [8] A. Tyszka, A discrete form of the Beckman-Quarles theorem for rational eight-space, Aequat. Math. 62 no. 1-2 (2001), 85-93. [9] J. Zaks, On the chromatic number of some rational spaces, Ars Comb. 33 (1992), 253-256. [10] J. Zaks, A discrete form of the Beckman-Quarles theorem for rational spaces, J. of Geometry 72 no. 1-2 (2002), 199-205. E-mail address: E-mail address:
connellyfimath.cornell.edu ''Robert Connelly'' jzaksfimath. half a. ac.il ''Joseph Zaks''
EDGE-ANTIPODAL CONVEX POLYTOPES - A PROOF OF TALATA'S CONJECTURE
BALAZS CSIKOS1 Department of Geometry, Eotvos University, Budapest, P.O.B. 120, Hungary, H-1518
ABSTRACT. A convex n-dimensional polytope in Rn is called edge-antipodal if for any edge of the polytope there is a linear function on Rrf whose restriction onto the polytope attains its minimum and maximum at the endpoints of the edge. We prove that an edge-antipodal 3-polytope can not have more than 12 vertices. This theorem gives a positive answer to Conjecture 6 of [8] posed by I. Talata.
1. INTRODUCTION 1
A subset S of W is called antipodal if for every pair of points x,y 6 £, one can find a linear function / on Rn such that
/(x) £ /(y) and /(x) < /(z) < /(y)
Vz € S.
n
It is known that an antipodal set in R has at most 2n elements. In particular, its convex hull is a polytope. The definition implies that an antipodal set coincides with the vertex set of its convex hull. We shall call a convex polytope P antipodal if its vertex set is antipodal. Thus, there is a oneto-one correspondence between antipodal sets and antipodal polytopes. For reference and related results see [3], [6], [7]. A polytope P is edge-antipodal or shortly e-antipodal if for any edge xy of P, there is a linear function / on W1 such that
/(x) ^ /(y) and /(x) < /(z) < /(y)
Vz € P-
1 Supported by the Hungarian National Science and Research Foundation OTKA T032478. 201
202
CSIKOS
An equivalent definition appears in [8]. Edge-antipodality seems to be a weaker condition on polytopes than antipodality, however, the author does not know any edge-antipodal 3-polytope which is not antipodal. The aim of this paper is to prove Talata's Conjecture 6 of [8], predicting the existence of a number m such that no edge-antipodal 3-polytope has more than m vertices. Namely, we shall prove the following theorem. Theorem 1. An edge-antipodal polytope in E3 cannot have more than 12 vertices. Remarks. (i) The upper bound 12 on the number of vertices is probably not the best one. It requires further ideas to find the sharp upper bound. (ii) A. For has recently proved that Talata's conjecture is true in any dimension (private communication). His proof, however, does not yield any explicit upper bound on the number of vertices of an edge-antipodal polytope. (iii) The following construction of I. Talata shows that in dimension n > 4, edge-antipodality of a polytope does not imply antipodality of its vertex set. Let 61,62,... ,en be a basis of W1 and denote by 0 the origin. The convex hull P of the points 0, 61,62,...,e n _i and p = ^ZY(CI -f 62 + • • • + e n _i) is the union of two (n — l)-dimensional simplices. P is strictly edge-antipodal, i.e., for any edge qr of P, there is a linear function on W1 whose restriction onto P attains its minimum and maximum only at q and r respectively. Translate the diagonal [Op] by en and stretch it slightly from en by a factor of A > 1. The segment we obtain that way has endpoints en and q = Ap + en. It is not difficult to verify that if A > 1 is not too large (in fact A < (n — l)/2 is enough), then the convex hull of P U {en,q} is edge-antipodal, but its vertex set is not antipodal.
2. PROOF OF THEOREM 1 Recall that for A, B C W1 and A € R, we define the scalar multiplication XA of the set A and the Minkowski sum A + B by XA = (Ax | x e A},
A + B = {x + y |xe A, y € B}.
The following well-known result due to F. John (see [4] or Theorem 8 on p. 13 of [2]) will be essential. Lemma 1. Let C — —C be a centrally symmetric convex body in Mn. Then there exists a solid ellipsoid E centered at the origin such that
4=£ C C C E. \/n
EDGE-ANTIPODAL POLYTOPES
203
Recall that if C = —C is a centrally symmetric convex body in Rn, then the Minkowski metric dc induced by C is the metric on Rn defined by d c (x,y) = inf{A | x - y 6 AC)
Vx,y € Rn.
C can be obtained from the metric dc as the unit ball centered at the origin, i.e., C = {x 6 Rn | dc(x.,Q) < 1}, thus, C and dc determine one another uniquely. A Minkowski metric is said to be a Euclidean metric if the metric space (Kn,dc) is isometric to Rn equipped with the standard Euclidean distance function. A Minkowski metric dc is Euclidean if and only if C is a solid ellipsoid. Corollary 1. If C — —C is a centrally symmetric convex body in W1, and dc is the Minkowski metric induced by C, then there is a Euclidean metric d in W1 such that d/^/n < dc < d. Proof. Choose E as in the above lemma, and let d be the Euclidean metric whose unit ball is l^nE. D Let P be an edge- antipodal n-dimensional polytope in Rn. Consider the difference body C — P -\- ( — P) of P and the Minkowski metric dc induced by it. The diameter of P with respect to dc is equal to 1. Indeed, we have x - y 6 P + (-P) — C for any x,y £ P and this yields
(/(x) - /(y)) - A(/(x') - /(y')) < A(/(x) - /(y)).
From (1) we get A > 1 and dc-(x,y) > 1. On the other hand x — y 6 C, thus dc(x,y) = 1. Assume that P is an edge-antipodal 3-polytope, and apply Corollary 1 to C = P+(-P). We obtain a Euclidean metric d such that (l/^/3}d < dc < d. Our previous observations imply that the diameter of P with respect to d is at most V^ while the length of any edge of P with respect to d is at least 1 . Talata's conjecture can be derived from the following theorem proved in [I]Theorem 2. Denote by 8*j the infimum of the diameters of?,-polytopes with N vertices having no edge length less than 1. Then limn_oo $N — 3. (Lengths and diameters are taken with respect to a fixed Euclidean metric.)
204
CSIKOS
Indeed, if NQ is a number such that % > \/3 for N > NO, then an edgeantipodal 3-polytope cannot have more than NQ vertices. The idea to attack Talata's conjecture with the help of Theorem 2 was suggested to the author by I. Talata. Sharpening slightly the methods used in [1] one can prove that an edge-antipodal 3-polytope can not have more than 176 vertices. This upper bound is much weaker than the bound 12 in Theorem 1. To prove Theorem 1 we use a simple consequence of edge-antipodality of P. The faces of an edge-antipodal polytope are edge-antipodal themselves. Since an edge-antipodal polygon in the plane is either a triangle or a parallelogram, faces of an edge-antipodal 3-polytope are triangles or parallelograms. Thus, Theorem 1 follows from the theorem below. Theorem 3. If a convex 3-polytope in the Euclidean 3-space has the following properties: (i) the edges of P are not shorter than 1; (ii) the diameter of P is not greater than \/3; (in) the faces of P are triangles or parallelograms; then P has at most 12 vertices. Proof. If we add to the edge graph of the polytope the longer diagonal of each quadrilateral face (in the case of equal diagonals we choose any of the diagonals), we obtain a triangulation of the boundary of P, whose edges have length > 1. We claim that the area of any triangle in this triangulation is at least \/3/4. Indeed, if for the sides of the triangle we have 1 < a < b < c < \/3, then for the angle 7 opposite to c we get that 7 is in the interval [7r/3,27r/3], because being c is a largest side otherwise would imply 7 > 27T/3, with further implication c2 = a2 + b2 - lab cos 7 > I2 + I2 + 2 • 1 • 1 • (1/2) = 3,
contradicting assumption (ii). However, if 7 is in the interval [7r/3,27T/3], then we have (!/2)a6sin7 > v/3/4. We conclude that if the triangulation constructed above consists of / triangles, then the surface area of P is at least /\/3/4. On the other hand, we know that the surface area of a convex body of average width w is not more than the surface area of a sphere of radius w/2 (Theorem 22.2 in [5]) and the average width of a convex body does not exceed its diameter, therefore, the surface area of P is at most 4 • (\/3/2) 2 7r = 3:r. Comparing the lower and upper bounds on the surface area of P, we obtain that the number of triangles in the triangulation is at most 4\/37r & 21.7656. Since the number of edges in the triangulation is e = 3//2, / must be an even natural number, hence / < 20.
EDGE-ANTIPODAL POLYTOPES
205
The number v of vertices can be expressed with the help of / using Euler's formula and this proves the theorem.
D
3. ACKNOWLEDGEMENTS The author is obliged to I. Talata for his thought-provoking remark, stimulating the research presented in this paper.
REFERENCES [1] Boroczky, K. and Csikos, B., Small Convex Poly topes with Long Edges and Many Vertices, Discrete Comput. Geom., to appear. [2] Gruber, P.M. and Lekkerkerker, C.G., Geometry of numbers, 2nd ed., North- Holland, Amsterdam, 1987. [3] Griinbaum, B., Convex Polytopes, Wiley-Interscience, London - New York - Sydney, 1967. [4] John, F., Extremum problems with inequalities as subsidiary conditions, Studies and essays presented to R. Courant, Interscience, New York, 1948, 187-204. [5] Leichtweifi, K., Konvexe Mengen, VEB Deutcher Verlag der Wissenschaften, Berlin, 1980. [6] Makai, E.Jr. and Martini, H., On the number of antipodal or strictly antipodal pairs of points in finite subsets of R.d, Applied Geometry and Discrete Mathematics, 457-470, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 4, Amer. Math. Soc., Providence, RI, (1991). [7] Makai, E.Jr. and Martini, H., On the number of antipodal or strictly antipodal pairs of points in finite subsets of Rd. II., Period. Math. Hung., 27 No. 3. (1993), 185-198. [8] Talata, I., On extensive subsets of convex bodies, Period. Math. Hung., 38 No. 3. (1999), 231-246. E-mail address:
csikosQcs.elte.hu ' 'Balazs Csikos''
SINGLE-SPLIT TILINGS OF THE SPHERE WITH RIGHT TRIANGLES
ROBERT J. MACG.DAWSON l Department of Mathematics and Computing Science, Saint Mary's University, Halifax, NS, Canada, B3H 3C3
ABSTRACT Sommerville [5] gave a classification of the isosceles triangles that can tile the sphere (subject to certain additional conditions) in 1923 , and Davies [1] completed the classification in 1965. However, if the edge-to-edge restriction is relaxed, there are other such triangles; such triangles must have combinations of angles adding to 180°. Here, we examine the case in which one angle is right, but no combination of the other two angles adds to 180°. We show that there is a unique triangle of this type which tiles, and examine a couple of "near misses". 1. INTRODUCTION In 1923, D.M.Y. Sommerville [5] classified the edge-to-edge tilings of the sphere with congruent isosceles spherical triangles, with directly congruent spherical triangles, and with congruent spherical triangles subject to the condition that the angles meeting at any vertex of the tiling are congruent. This last condition forces all adjacent pairs of triangles to be mirror images, so that the triangle tiles by repeated reflection. H.L. Davies completed the classification of edge-to-edge tilings with triangles in 1965 [1], adding two more continuous families of tilings that did not satisfy Sommerville's conditions. There are also, however, non-edge-to-edge tilings, including some using tiles that cannot tile in an edge-to-edge fashion [2, 3]. If a triangle tiles in a non-edge-to-edge fashion, there must exist some combination of its angles that adds to 180°. 1
Supported in part by NSERC operating grant. 207
208
DAWSON
In [2] the isosceles spherical triangles that tile the sphere with congruent copies were completely classified. Most of these - four infinite families and five sporadic cases - tile edge-to-edge and were already known. One of these infinite families, the semilunes, consists of the triangles with angles 360°/™,360°/n, and 180° - 3600/™ for n even. When n is odd, the triangle does not tile in an edge-to-edge fashion, but nevertheless tiles. Three more sporadic cases were found, with angles (150°, 60°, 60°), (100°, 60°, 60°), and (80°, 60°, 60°). These too tile only in a non-edge-to-edge fashion, the lastmentioned in three distinct ways [3] . Each isosceles triangle that tiles the sphere can be bisected to yield two congruent right angled triangles; these, the (90°, 75°, 60°), (90°, 60°, 50°), and (90°, 60°, 40°) triangles respectively, therefore also tile the sphere. The right-angled triangles form a particularly interesting case, because every right triangle has at least one combination of angles - two right angles that adds to 180°. In a paper now in preparation [4], B. Doyle and the author will exhibit a full classification of right triangles that tile the sphere. In most cases, a right triangle that tiles the sphere in a non-edge-toedge fashion has other combinations of angles that add to 180° as well, and examining these combinations is a useful tool in the classification. This paper considers the exceptional case, in which no other combination of angles adds to 180°; we shall see that there is a unique such tile.
2. CLASSIFICATION OF TILINGS It follows from the classifications in [2] and [5] that every isosceles triangle that tiles the sphere has either two right angles, or some other collection of angles adding to 180°. Given any scalene right triangle, we will represent the measure of the larger of the two non-right angles of the triangle by (3 and that of the smaller by 7. The lengths of the edges opposite these angles will be B and C respectively, with H as the length of the hypotenuse. (Note that it may be that (3 > 90° and B > H .) We will denote the number of tiles by N . By considering the spherical excess, we see that (1)
AT = 72
Let
(2)
V = {(a, 6, c) € Z3 : a(90°) + b/3 + 07 = 360°, a, b, c > 0} .
We call the triples (a, b, c) the vertex vectors of the triangle and the equations vertex equations. The vertex vectors represent the possible (unordered) ways to surround a vertex with the available angles. A vertex which is in the middle of an edge of one of the adjoining triangles is called split If a right angles, b (3 angles, and c 7 angles meet at a split
SINGLE-SPLIT TILINGS
209
vertex, then (2a, 26,2c) is a vertex vector. This combination of angles will be represented by the split vector (2a,26,2c)/2 In this section, we will determine which right triangles with the single split (4,0,0)/2 tile the sphere. One special case can be dismissed quickly. A triangle with two right angles tiles the sphere if and only if 7 = (360/n)° (see [2]). Thus, while these triangles can tile in a non-edge-to-edge fashion (e.g., by tiling the Northern and Southern hemispheres each with n triangles, and rotating one slightly with respect to the other), they can always tile edgeto-edge. Lemma 1. If a right triangle has no split vectors except for (4, 0, 0)/2, and it tiles in a non-edge-to-edge fashion, then either 1C = B or 1C = H. Proof: By assumption, there is a split vertex O, with two right angles, at which the tiling fails to be edge-to-edge. If there is no split vertex configuration including the angles (3 or 7, then the extended edge containing O cannot extend past either adjacent vertex (Figure la), so consists of exactly two edges. It cannot be of length B + C (lb); and if it is of length 2B, then the other side must be covered in the same way and the tiling is edge-to-edge at O (lc). Thus the extended edge consists exactly of two short edges. The only combinations of edges that can possibly add to 1C are 1C itself, H, and J5; and in thefirstcase the tiling is edge-to-edge at O. |
O
a
Ob
FIGURE 1. The neighborhood of a split vertex Proposition 1. The only right triangle that tiles the sphere, has no split vector except for (4,0,0), and has 1C = H is the (90°, 108°, 54°) triangle. Proof: If every right angle is part of a (4,0,0) vertex or the corresponding (4,0,0)/2 split, the triangles are grouped into pairs whose unions are equilateral triangles. It is easily seen that any equilateral triangle that tiles the sphere does so in an edge-to-edge fashion; the triangles that do so are the (120°,120 0 ,120 0 ),(90 0 ,90°,90 0 ), and (72°, 72°, 72°) triangles, yielding the spherical tetrahedron, octahedron, and icosahedron respectively. The triangles obtained by bisecting these are the (90°. 120°., 60°), (90°, 90°, 45°), and (90°, 72°, 36°) triangles, all of which have other splits. Thus the tiling has a vertex of some other type that includes a right angle.
210
DAWSON
FIGURE 2. One of the three tilings with the (90°, 108°, 54°) triangle Consider such a right angle (a\ in triangle 1, Figure 3) The edge A\B\ must be shared with the corresponding leg of another triangle (2), with the opposite orientation. Now consider the right angle of triangle 2. It cannot be part of a split, so the leg B\A^ must in turn be paired with a similar leg; and this band of triangles continues by induction until it closes or overlaps itself.
FIGURE 3. The equatorial belt If it closes, the vertices Ai form a regular n-gon about a point O and the vertices BI form a congruent n-gon about the antipodal point. If n = 2, we have the degenerate (90°, 180°, 90°) triangle. If n = 3, two more triangles (arranged into an equilateral triangle) fill each polar region; we have the vertex formula (1,2,1) which, with the relation (3 — 27, gives the (90°, 108°, 54°) triangle as the unique possibility. (It follows that this triangle tiles the sphere in exactly three ways, excluding reflections, depending upon whether the distinguished vertices of the two polar equilateral triangles are connected by a short edge, a long edge, or no edge in the equatorial belt.) If n > 3, the angles of the polar n-gons must be greater than /3, and two adjacent edges must be covered by distinct triangles. If an edge is covered by two short legs, the triangles form an equilateral (/3, /?, /?) triangle; if by a hypotenuse, the exposed long leg must be paired with another such and
SINGLE-SPLIT TILINGS
211
their union is again a (/?, /?, (3) triangle. We conclude that each of the vertices Ai must have the vertex vector (1,3,1). The third vertices of the ((3,P,/3) triangles surround a point 0, so that (0,2m, 0) must be a vertex vector as well.
FIGURE 4. The vertices A{ are equidistant from O. With the relation /3 — 27, this forces the triangle to have angles (90°, 77y , 381 ) This yields a contradiction, as /? does not divide 360°. | However, there are multiple covers in which 84 (90°, 77'j , 38| ) triangles cover the sphere three times (Figure 5). As each of the 28 equilateral triangles in the polar polygons can be divided into two tiles in three distinct ways, there are billions of distinct tilings in this family.
FIGURE 5. A multiple cover with the (90°,77y°,38|°) triangle It is also noteworthy that the (90°, 108°, 54°) triangle can be dissected into three (90°, 60°, 54°) triangles; this triangle therefore also tiles the sphere. (An historical note: the (90°, 60°, 54°) tiling was actually discovered first. B. Thomas noticed that some of the small triangles fitted together into larger ones; subsequent investigation showed that in fact the entire tiling was a subdivision of a larger one.)
DAWSON
212
FIGURE 6. A tiling with the (90°, 60°, 54°) triangle Proposition 2. If a right triangle has no split vector except for (4,0,0)/2, and has 2C = B, it does not tile the sphere. If such a triangle is to tile in a non-edge-to-edge fashion, the configuration of triangles 1-3 in Figure 7 must occur. We note that if a triangle has no split vector except for (4, 0, 0)/2, it has no vertex vector (a, 6, c) with a = 2, for otherwise (0, 2fo,2c) would be a vertex vector as well, and (0,26,2c)/2 would be a split vector. A similar argument rules out a = 3. We also note that the edge PQ of triangle 1 in Figure 7 cannot have an overhang at either end; as there cannot be a second right angle at Q, we conclude that the triangle 4 must be as shown . We now consider what other angles might fill the gap at Q. Any answer to this question, along with the equation 1C — B, gives sufficient information for the numerical determination of the angles f3 and 7; we shall see that the only case in which these yield an integer N corresponds to a known tile that has other splits.
FIGURE 7. Configuration near a split with 1C = B We cannot have b + c > 6 and b > 3, as this forces (3 + 7 < 90°. Nor can we have (l,2n + 1,0), (1,3,2) or (1,2,2™ + 1), as every hypotenuse
SINGLE-SPLIT TILINGS
213
must be paired with another. Moreover, 7 > arctan(l/2) ~ 26.5651° and /3 > arctan(2) ^ 63.4349°, so (l,2,c) is impossible for c > 6. This leaves only (1,2,2), (1,2,4), (1,3,1), and (1,4,0) as possible candidates. It is not hard to see that the vertex vector (1,2,2) corresponds to the (90°,90°,45°) triangle. This, as mentioned above, tiles edge-to-edge, and was listed by Sommerville and Davies. Numerical solutions appear to be required for the other cases. (1,2,4) gives 0 « 70.1281°, 7 w 32.4355°, and equation (1) yields N « 57.3042. Similarly, (1,3,1) gives j3 « 77.6906°, 7 w 36.9282°, and N w 29.2459. Finally, the vertex vector (1,4,0) gives /3 = 67.5°, 7 w 29.3001°, and N « 105.8801. As N is not an integer in any of these cases, the triangle cannot tile the sphere. | If (as seems likely) N is irrational, there is not even a finite-density multiple cover. However, it should be noted that the (90°, 77.69...° , 36.92 ...°) triangle does have a rather elegant "near miss", which fails to close up exactly (Figure 8).
FIGURE 8. A near tiling
3. CONCLUSIONS While most spherical triangles that tile in a non-edge-to-edge fashion have split vectors using non-right angles, the (90°, 108°, 54°) triangle tiles (with 10 copies) using only the (4,0, 0)/2 split, and is the only spherical triangle that does so but does not tile edge-to-edge. This is an important preliminary step in the classification of all right triangles that tile the sphere [4].
214
DAWSON
REFERENCES [1] Davies, H. L., Packings of spherical triangles and tetrahedra. Proc. Colloquium on Convexity (Copenhagen, 1965) 42-51 [2] Dawson, R. J. MacG., Tilings of the sphere with isosceles triangles, (to appear, Disc. Comp. Geom.) [3] Dawson, R. J. MacG., A triangle that tiles the sphere in exactly three ways, (to appear, Disc. Comp. Geom.) [4] Dawson, R. J. MacG., Doyle, B., Right triangles that tile the sphere, in preparation [5] Sommerville, D. M. Y., Division of space by congruent triangles and tetrahedra, Proc. Roy. Soc. Edinburgh 43 (1923), 85-116 E-mail address:
[email protected]
VERTEX-UNFOLDINGS OF SIMPLICIAL MANIFOLDS
ERIK D. DEMAINE MIT Laboratory for Computer Science, 200 Technology Square, Cambridge, MA 02139, USA. DAVID EPPSTEIN1 Department of Information and Computer Science, University of California, Irvine CA 92697-3425, USA. JEFF ERICKSON2 Department of Computer Science, University of Illinois at Urbana-Champaign, 1304 W. Springfield Ave, Urbana, IL 61801, USA. GEORGE W. HART SUNY Stony Brook, Stony Brook, New York JOSEPH O'ROURKE3 Department of Computer Science, Smith College, Northampton, MA 01063, USA.
ABSTRACT. We present an algorithm to unfold any triangulated 2-manifold (in particular, any simplicial polyhedron) into a non-overlapping, connected planar layout in linear time. The manifold is cut only along its edges. The resulting layout is connected, but it may have a disconnected interior; the triangles are connected at vertices, but not necessarily joined along edges. We extend our algorithm to establish a similar result for simplicial manifolds of arbitrary dimension.
1. INTRODUCTION It is a long-standing open problem to determine whether every convex polyhedron can be cut along its edges and unfolded flat in one piece without overlap, that is, into a simple polygon. This type of unfolding has been
Martially supported by NSF grant CCR-9912338. Partially supported by a Sloan Fellowship and NSF CAREER award CCR-0093348. Supported by NSF Distinguished Teaching Scholars award DUE-0123154. 215 2
216
DEMAINE, EPPSTEIN, ERICKSON, HART, O'ROURKE
termed an edge-unfolding] the unfolding consists of the facets of the polyhedron joined along edges. In contrast, unfolding via arbitrary cuts easily leads to non-overlap. See [11] for a history of the edge-unfolding problem and its applications to manufacturing. Recently it was established that not every nonconvex polyhedron can be edge-unfolded, even if the polyhedron is simplicial, that is, all of its faces are triangles [2, 3]. In this paper we loosen the meaning of "in one piece" to permit a nonoverlapping connected region that (in general) does not form a simple polygon, because its interior is disconnected. We call such an unfolding a vertexunfolding: facets of the polyhedron are connected in the unfolding at common vertices, but not necessarily along edges. With this easier goal we obtain a positive result: Theorem 1. Every connected triangulated 2-manifold (possibly with boundary) has a vertex-unfolding, which can be computed in linear time. This result includes simplicial polyhedra of any genus, manifolds with any number of boundary components, and even manifolds like the Klein bottle that cannot be topologically embedded in 3-space. Our proof relies crucially on the restriction that every face is a triangle. The problem remains open for nonsimplicial polyhedra with simply connected or even convex faces; see Section 5. We extend this result in the natural way to higher dimensions in Section 4. 2. ALGORITHM OVERVIEW Let M be a triangulated 2-manifold, possibly with boundary. Following polyhedral terminology, we refer to the triangles of M. as facets. The (vertexfacet) incidence graph of M. is the bipartite graph whose nodes are the facets and vertices of A4, with an arc (i>, /) whenever v is a vertex of facet /. A facet path is a trail4 (i>o, /i, vi, /2,1*2, • • • > /fc> vk) m the incidence graph of M. that includes each facet node exactly once, but may repeat vertex nodes. In any facet path, Vi-i and Vi are distinct vertices of facet /j for all i. Because each facet node appears only once, no arc is repeated. A facet cycle is a facet path that is also a circuit, that is, where VQ = v^. Our algorithm relies on this simple observation: Lemma 2. If M has a facet path, then M has a vertex-unfolding in which each triangle of the path occupies an otherwise empty vertical strip of the plane. A trail is a walk in which no arc is repeated. A walk in a graph is an alternating series of nodes and arcs with each arc incident to the surrounding nodes.
217
VERTEX-UNFOLDINGS OF SIMPLICIAL MANIFOLDS
Proof. Let p be a facet path of M. Suppose inductively that a facet path p has been laid out in strips up to facet /j_i, with all triangles left of vertex Vi, the rightmost vertex of /i_i. Let (vi, fi, fi+i) be the next few nodes in p; recall that Vi ^ Vi+i- Rotate facet /j about vertex Vi so that vi is leftmost and Vi+i rightmost, and the third vertex of fi lies horizontally between. Such rotations exist because fi is a triangle. Place fi in a vertical strip with Vi and Vi+i on its left and right boundaries. Repeating this process for all facets in p produces a non-overlapping vertex-unfolding. D
A, C, B, D
A, B, C, D
FIGURE 1. Vertex-unfolding the top four triangles of the regular octahedron and making the connections planar. Thus to prove Theorem 1 it suffices to prove that every connected triangulated 2-manifold has a facet path. It might be more pleasing to obtain a vertex-unfolding based on a noncrossing facet path, one that does not include a pattern (..., A, v, C,..., B, v, D,...) with the facets incident to the vertex v appearing in the cyclic order A,B,C,D. Because a facet path has either no or at most two odd nodes (its endpoints), and because any such planar graph has a noncrossing Eulerian trail, we can convert any facet path into a noncrossing facet path. Specifically, we can replace each crossing pair of vertex-to-vertex connections with one of the two alternate pair of connections, whichever alternate pair keeps the vertex-unfolding connected [4, Lem. 1]. See Figure 1. The existence of facet paths has two further applications: (1) The vertex-unfolding resulting from a noncrossing facet path can be viewed as a hinged dissection [7] of the surface. Thus we demonstrate a hinged dissection for any triangulated 2-manifold. (2) A facet path also yields an "ideal rendering" of any triangulated surface on a computer graphics system with a 1-vertex cache: each triangle shares one vertex with the previous triangle in the graphics pipeline. This result is in some sense best possible: an ideal rendering for a 2-vertex cache in which every adjacent pair of triangles shares two vertices is not always achievable, because there are triangulations whose dual graphs have no Hamiltonian path [1].
218
DEMAINE, EPPSTEIN, ERICKSON, HART, O'ROURKE
Figure 2(a) shows a vertex-unfolding of the triangulated surface of a cube, obtained from a facet path by our algorithm. Figure 2(b) shows a less regular vertex-unfolding. Note that the vertices do not necessarily lie on a line. Several more complex examples are shown in Figure 3. In our examples, we permit the triangles to touch along segments at the strip boundaries (as in (a) of the figure), but this could easily be avoided if desired so that each strip boundary contains just the one vertex shared between the adjacent triangles. (a)
•
•
•.
i
;
;
i
i
;
•
;
;
(b)\
FIGURE 2. Laying out facet paths in vertical strips: (a) cube; (b) 16-facet convex polyhedron.
3. FACET PATHS IN 2-MANiFOLDS In this section, we prove that every triangulated 2-manifold has a facet path, which, by Lemma 2, yields Theorem 1. 3.1. Notation. We first establish terminology for arbitrary dimensions, anticipating Section 4, but specializing to dimension 2 for this section. A d-manifold is a topological space such that every point has a neighborhood homeomorphic to the neighborhood of some point in a closed halfspace in IRd. Interior points of a 2-manifold have neighborhoods homeomorphic to a disk, and boundary points have neighborhoods homeomorphic to a half-disk. (Thus, the vertex-unfoldings in Figures 2 and 3 are not manifolds.) A simplicial d-manifold is a simplicial complex5 homeomorphic to a A simplex is the convex hull of d + 1 independent points: a triangle, tetrahedron, etc. A simpicial complex is a collection of simplices such that every pair of simplices that intersect do so in exactly one face of each. The proofs in this section proofs only require abstract simplicial complexes; the geometry of a simplex is only used in Lemma 2.
VERTEX-UNFOLDINGS OF SIMPLICIAL MANIFOLDS
219
76
0/5 jU A A/vl. ,.MN A yo pi»w v^'^/vf^-Y/J
746 -T-^JV-VV-
-A/lip^Tv^Y^ ^"^V^
^'-f1-
FIGURE 3. Vertex-unfoldings of random convex polyhedra (generated by code from [10]). The number of triangles is indicated to the left of each unfolding. The unfoldings were constructed using an earlier, less general version [6] of the algorithm in Section 3.
d-dimensional manifold, possibly with boundary. For example, any simplicial convex d-polytope is a simplicial manifold homeomorphic to the sphere §d-1. We call the full d-dimensional simplices facets and the codimension-1 simplices (i.e., the simplices of dimension d — 1) ridges. When d = 2, ridges are also called edges. A triangulated 2-manifold is an edge-to-edge gluing of (topological) triangles. Triangulated 2-manifolds are not necessarily simplicial complexes; see Figure 8. The dual l-skeleton M.* of a simplicial manifold Ai is a simple graph, with a node for each facet and an arc between any two facets that share a ridge. We call a simplicial manifold M a tree manifold if its dual 1-skeleton M* is a tree, or equivalently, if it is connected and its codimension-2 simplices all lie on the boundary. Every tree manifold T is homeomorphic to a ball. A tree 2-manifold is a simplicial complex with the topology of a triangulated polygon with no interior vertices. A tree 3-manifold has the topology of a triangulated polyhedron in IR3 with no diagonals or interior vertices. Given a simplicial manifold .M, we take an arbitrary spanning tree of M* to yield a tree manifold T corresponding to M. We will find our facet paths in T rather than in M, which is no loss because any facet path or facet cycle of T can be mapped to a facet path or facet cycle of M.; recall that a facet path may repeat vertex nodes.
DEMAINE, EPPSTEIN, ERICKSON, HART, O'ROURKE
220
(e)
FIGURE 4. Tree manifold (a) to scaffold (b) to connected scaffold (c) to facet cycle (d) to strip layout (e). The layout is based on a different facet path than used in Figure 2(a). As in Section 2, the (vertex-facet) incidence graph of a simplicial manifold has a node for every vertex and every facet, and an arc (v, f) whenever v is a vertex of facet /. A facet path is a trail that includes each facet node in the incidence graph exactly once, and a facet cycle is a circuit in that passes through every facet exactly once. We now generalize facet paths and cycles to more general subgraphs that span the facets. A scaffold is a subgraph of the incidence graph in which every facet appears and has degree 2, and at most two vertices have odd degree; if every vertex has even degree, we call it an even scaffold. (See Figure 5(d) below for an example of a scaffold.) Any facet path is a scaffold, and any Euler walk through a connected scaffold is a facet path. Thus, our goal is to find a connected scaffold for T, which yields a facet path for T, which yields a facet path for Ai. The full process is illustrated for a cube in Figure 4. 3.2. Connected Scaffolds. First we establish a slightly weaker result: Lemma 3. Every triangulated polygon with no interior vertices has a (possibly disconnected) scaffold. Proof. Let T be a triangulated polygon with no interior vertices. We prove the lemma by induction on the number of triangles, with two base cases. If T is empty, we are done. If T is a single triangle, then a path between any two vertices is a scaffold. Henceforth, assume that T has at least two triangles.
221
VERTEX-UNFOLDINGS OF SIMPLICIAL MANIFOLDS
(d)
FIGURE 5. (a) A polygon triangulation T. Lightly shaded triangles are ears; darker shaded triangles are hats, (b) Removing a Mickey House hat. (c) Removing a dunce cap. (d) A scaffold produced by our algorithm. An ear in T is a triangle that is adjacent to at most one other triangle. We call a triangle in T a hat if it is adjacent to at least one ear and at most one non-ear. If we remove all the ears from T, we obtain a new triangulated polygon T'. See Figure 5(a). If T' is non-empty, then it has at least one ear, and every ear in T' is a hat in T. On the other hand, if T' is empty, then T consists of exactly two triangles, which are both ears and hats. In either case, T contains at least one hat. To perform the induction, we choose a hat in T, find a cycle in the facetvertex incidence graph of that hat and (at most two of) its adjacent ears, and recursively construct a scaffold for the remaining triangulation. We have two inductive cases. Suppose T has a hat H = qrs with at least two ears E = pqr and F = rst (a "Mickey Mouse hat"). See Figure 5(b). We construct a cycle (r, E, q, H, s, F, r) through the facet-vertex of these three triangles, and recursively construct a scaffold for the smaller triangulation T \ {H, E, F}. Otherwise, let H = qrs be a hat with just one adjacent ear E = pqr (a "dunce cap"). See Figure 5(c). We construct a cycle (q,H,r,E,q) through
222
DEMAINE, EPPSTEIN, ERICKSON, HART, O'ROURKE
the facet-vertex of those two triangles, and recursively construct a scaffold for the smaller triangulation T \ {H, E}. D Following the proof gives us an easy linear-time algorithm, consisting of a simple depth-first traversal of the input triangulation's dual tree. Figure 5(d) shows a scaffold computed by our algorithm. The scaffold we construct may be disconnected, but we now show how to make it connected using a series of local operations. Lemma 4. Every triangulated polygon with no interior vertices has a connected scaffold. Proof. Let S be a scaffold with more than one component. If S is not actually an even scaffold, its two odd vertices must be in the same component; every other component has an Euler circuit and so must be 2-edge-connected. Choose a pair of triangles A = pqr and B — qrs that lie in different components of S. Without loss of generality, suppose S contains the edges (p, A), (, A), (r, B}, and (s,B}. At most one of the edges (q,A) and (r, B} is a bridge (its removal would disconnect the graph). If we remove edges (q,A) and (r,B) and add edges (r, A) and (g, B), we obtain another scaffold S' with one fewer component than S. See Figure 6. Repeating this process for each adjacent pair of components gives us a connected scaffold. D
FIGURE 6. Lemma 4: Joining two components of a scaffold with a flip. Clouds hide the rest of the components. Given a triangulated 2-manifold M, we convert it to a tree manifold T, apply Lemmas 3 and 4 to obtain a connected scaffold, and finally use an Euler walk through this scaffold to produce a facet path. This yields:6 Theorem 5. Every connected triangulated 2-manifold (possibly with boundary) has a facet path. Igor Pak [personal communication, Dec. 2001] found a different proof of this result for triangulated, genus-zero polyhedra (without boundary). After vertex truncation, a Hamiltonian cycle in the dual is found via Whitney's theorem on planar triangulations without separating triangles. This cycle is then converted to a facet path.
VERTEX-UNFOLDINGS OF SIMPLICIAL MANIFOLDS
223
3.3. Checkered Triangulations and Facet Cycles. We can strengthen this result slightly, by showing that most properly triangulated 2-manifolds actually have a facet cycle. This permits the strip layout of Lemma 2 to start on the left with any given triangle of the manifold. We call a polygon triangulation checkered if there is a 2-coloring of the triangles so that every white triangle has three (necessarily black) neighbors. See Figure 7(a). Lemma 6. A polygon triangulation with no interior vertices has a facet cycle if and only if it is not checkered. Proof. Let T be a triangulated polygon with no interior vertices. First we prove by induction that no checkered triangulation has a facet cycle. The base case is a single (black) triangle, which clearly has no facet cycle. In any other checkered triangulation T, we can always find a (Mickey Mouse) hat: two black ears adjacent to a common (white) triangle. If T has a facet cycle, it must contain a subcycle of six edges inside the Mickey Mouse hat and another subcycle through the rest of the triangulation. But the rest of the triangulation is checkered, so by the induction hypothesis, it has no facet cycle. See Figure 7(b).
FIGURE 7. Lemma 6: (a) A checkered polygon triangulation. (b) After removing three Mickey Mouse hats. Now suppose T is a noncheckered triangulation; in particular, T has at least two triangles. To prove the lemma, it suffices to show that T has an even scaffold. Assume without loss of generality that T has no hats; otherwise, we can remove them as described above. (This might actually eliminate every triangle in T, but then we've computed an even scaffold!) We cannot be left with a single triangle because T is not checkered. Thus, T has at least two "dunce caps": hats with only one adjacent ear. If we follow the algorithm in Lemma 3, removing hats whenever possible, the triangulation always contains at least one dunce cap, until either the algorithm removes
224
DEMAINE, EPPSTEIN, ERICKSON, HART, O'ROURKE
every triangle or there are exactly three triangles left. Thus, the triangulation never consists of a single triangle, which implies that the algorithm constructs an even scaffold. D We say that a triangulated 2-manifold is simplicial if it is a simplicial complex, or equivalently, if its dual graph is simple (has no multi-edges or loops). Every manifold constructed from geometric triangles is simplicial. (A nonsimplicial manifold is shown below in Figure 8.) Lemma 7. For every connected simplicial 2-manifold (possibly with boundary) M., with the exception of a checkered polygon triangulation, there corresponds a noncheckered tree manifold T. Proof. Let A4 be a simplicial 2-manifold that either is multiply connected or has interior vertices. Assume without loss of generality that A4 has a checkered tree manifold T, because otherwise we have nothing to prove. This immediately implies that M. is not 2-colorable. Color the triangles of T black and white, so that adjacent triangles have opposite colors and every boundary edge of T lies on a black triangle. Because the dual 1-skeleton of M. is a simple graph, we can cut T into two simple polygons along some edge, and then reglue those pieces along some other pair of edges, to obtain another tree manifold T' of M.. Because M. is not 2-colorable, we must reverse the colors of one of those pieces to obtain a proper 2-coloring of T'. Because each piece has at least three edges, each piece has at least one edge that is on the boundary of both T and T'. It follows that T' has boundary edges adjacent to both black and white triangles, so T' is not checkered. D Combining the previous two lemmas, we conclude the following: Theorem 8. Every connected simplicial 1-manifold (possibly with boundary) has a facet cycle, except a checkered polygon triangulation. This theorem requires that we start with a simplicial complex. There are triangulated but nonsimplicial 2-manifolds that have no facet cycle, like the triangulation of the sphere shown in Figure 8. However, even improperly triangulated 2-manifolds have facet paths.
4. HIGHER DIMENSIONS In this section we generalize our results to higher dimensions. Lemma 2 generalizes in the obvious way, yielding from any facet path a vertexunfolding that places simplices in slabs bounded by parallel hyperplanes. We will show that any simplicial polyhedron has a facet cycle, and thus a
VERTEX-UNFOLDINGS OF SIMPLICIAL MANIFOLDS
225
FIGURE 8. An improper triangulation of the sphere with a facet path but no facet cycle. Edges with identically labeled endpoints are identified. vertex-unfolding. Like the results in the previous section, the proofs are almost purely topological, and thus actually apply to arbitrary triangulated manifolds, possibly with boundary, independent of any embedding.7 We follow the notation set in Section 3.1, and follow the same proof outline: from simplicial d-manifold M. to tree d-manifold T to even scaffold to connected even scaffold to vertex cycle. Lemma 9. For all d > 3, every tree d-manifold has an even scaffold, the exception of a single d-simplex.
with
Proof. Let T be a tree d-manifold with d > 3 and with more than one facet. An ear of T is a facet that is adjacent to only one other facet. A hat is a facet that is adjacent to at least one ear and at most one non-ear. Just as in the two-dimensional case, every tree d-manifold with more than one facet has at least two ears and at least one hat (and with only d — 1 exceptions, at least two hats). We prove the lemma by induction. If T is non-empty, we identify a small collection of simplices in T, find a cycle in the incidence graph of those simplices, and recursively construct an even scaffold for the remaining complex, which is still a tree manifold. It is fairly easy to construct an even scaffold for any subcomplex consisting of a hat and its ears, and to decompose any tree complex into a sequence of such complexes by removing a hat (and its ears) and recursing [8]. To keep things simple, however, we will consider only the four following cases. In fact, our results apply to pseudo-manifold A-complexes—sets of -simplices whose facets (our ridges) are glued together in pairs [9]; we called the two-dimensional version of this a "triangulated 2-manifold" in Sec. 3.1. A pseudo-manifold A-complex is not necessarily a manifold, even with boundary.
226
DEMAINE, EPPSTEIN, ERICKSON, HART, O'ROURKE
(1) If T is empty, there is nothing to do. (2) Suppose T consists of exactly three simplices: a hat H and two ears E and F. E and F share at least one vertex p; E and H share at least one vertex q ^ p; and H and F share at least one vertex r ^ Pi^- (In f ac t, we have d — 2 choices for each of these three vertices.) Then (p,E,q,H,r,F,p) is a cycle in the incidence graph of T. See Figure 9.
FIGURE 9. Case 2 of Lemma 9: hat H, ears E and F, T = {H, E, F}. (3) Suppose some hat H is adjacent to just one ear E. H and E share an edge pq. (In fact, they share an entire ridge.) We recursively construct an even scaffold for the subcomplex U \ {H,E}, and add the cycle (p, H, q, E, p). (4) Finally, suppose some hat H is adjacent to more than one ear and T has more than three facets. Let E and F be any two ears adjacent to H. E and F share an edge pq. (In fact, they share an entire face of dimension d — 2 > 0; this is the only step of the proof that requires d > 3.) We recursively construct an even scaffold for the subcomplex U \ {E, F} and add the cycle (p, E, g, F,p). The only tree manifold that does not fall into one of these four cases is a single simplex. D Once we have an even scaffold, we can make it connected using local flip operations as in the two-dimensional case; in fact the proof is slightly simpler because every component of an even scaffold is 2-connected. Let A and B be adjacent simplices that lie in different components of the even scaffold, and suppose the scaffold contains edges (p,-A), (q,A), (r, I?), and (s, B). The ridge A n B contains all but one vertex of A and all but one vertex of B, so
VERTEX-UNFOLDINGS OF SIMPLICIAL MANIFOLDS
227
without loss of generality, q and r are both in A n B. If we replace edges (q, A) and (r, B] with edges (q, B) and (r, A), we obtain a new even scaffold. Any node in the old component of A is still connected to p, then A, then q, and then to any node in the old component of B. Thus, the new even scaffold has one fewer component. Repeating this process for each adjacent pair of components, we obtain a connected even scaffold. Putting the pieces together yields the following: Theorem 10. For any d> 3, every connected simplicial d-manifold bly with boundary) has a facet cycle, except a single d-simplex.
(possi-
As we only need a path for the slab construction, we immediately obtain: Corollary 11. Every connected simplicial manifold (possibly with boundary) has a vertex-unfolding, which can be computed in linear time.
5. OPEN PROBLEMS (1) The obvious question left open by our work is whether the restriction to simplicial facets is necessary. Does every three-dimensional polyhedron with simply-connected facets have a non-overlapping vertex-unfolding? What if we require the facets to be convex? Our strip construction fails for polyhedra with nontriangular convex facets, because such polyhedra may not have facet paths. For example, the truncated cube has no facet path: no pair of its eight triangles can be adjacent in a path, but its six octagons are not enough to separate the triangles. If facets are permitted to have holes, then there are polyhedra that cannot be vertex-unfolded at all, for example, the box-on-top-of-a-box construction of Biedl et al. (Figure 7 of [5]). (2) A related reverse problem is: Given a collection of polygons connected in a chain at vertices, can they be glued along their edges to form a polyhedron? In other words, do they form a vertex-unfolding of some polyhedron? What about convex polyhedra? What is the complexity of these decision problems? (3) Finally, we mention the question which initiated our work, the generalization of edge-unfolding to higher dimensions. One can view this question as seeking a spanning tree of the dual 1-skeleton M* of a simplicial manifold M. that embeds geometrically in IR^"1 without overlap. It remains open for all d > 3 whether every d-polytope has such a ridge-unfolding.
ACKNOWLEDGMENTS We thank Anna Lubiw for a clarifying discussion, and Allison Baird, Dessislava Michaylova, and Amanda Toop for assisting with Figure 3.
228
DEMAINE, EPPSTEIN, ERICKSON, HART, O'ROURKE
REFERENCES [I] E. M. Arkin, M. Held, J. S. B. Mitchell, and S. S. Skiena. Hamiltonian triangulations for fast rendering. Visual Comput., 12(9):429-444, 1996. [2] M. Bern, E. D. Demaine, D. Eppstein, and E. Kuo. Ununfoldable polyhedra. In Proc. llth Canad. Conf. Comput. Geom., pages 13-16, 1999. Full version: arXiv:cs.CG/9908003/. [3] M. Bern, E. D. Demaine, D. Eppstein, E. Kuo, A. Mantler, and J. Snoeyink. Ununfoldable polyhedra with convex faces. Comput. Geom. Theory Appl, to appear, 2002. [4] T. Biedl, M. Kaufmann, P. Mutzel. Drawing planar partitions II: HHdrawings. Proc. 24th Internal. Workshop Graph-Theoret. Concepts Comput. Sci. Vol. 1517, Lecture Notes in Comput. Sci., Springer-Verlag, pp. 124-136, 1998. [5] T. Biedl, E. Demaine, M. Demaine, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, and S. Whitesides. Unfolding some classes of orthogonal polyhedra. In Proc. 10th Canad. Conf. Comput. Geom., pages 70-71, 1998. Elec. Proc. http://cgm.cs.mcgill.ca/cccg98/proceedings/. [6] E. D. Demaine, D. Eppstein, J. Erickson, G. W. Hart, and J. O'Rourke. Vertex-unfoldings of simplicial polyhedra. Technical Report 071, Dept. Comput. Sci., Smith College, Northampton, MA, USA, July 2001. arXiv:cs.CG/0110054/. [7] G. Frederickson. Dissections: Plane and Fancy. Cambridge University Press, 1997. [8] D. T. S. Geisel [Dr. Seussj. The Cat in the Hat Comes Back. Beginner Books. Random House, 1958. [9] A. Hatcher. Algebraic Topology. Cambridge University Press, 2001. [10] J. O'Rourke. Computational Geometry in C. Cambridge University Press, 2nd edition, 1998. [II] J. O'Rourke. Folding and unfolding in computational geometry. In Discrete Comput. Geom., volume 1763 of Lecture Notes Comput. Sci., pages 258-266. Springer-Verlag, 2000. Papers from the Japan Conf. Discrete Comput. Geom., Tokyo, Dec. 1998. E-mail E-mail E-mail E-mail E-mail
address: address: address: address: address:
edemaineQmit.edu ''Erik D. Demaine'' eppstein8ics.uci.edu ''David Eppstein''
[email protected] ' ' J e f f Erickson''
[email protected] ''George W. Hart'' orourkeScs.smith.edu ''Joseph O'Rourke''
VIEW-OBSTRUCTION THROUGH TRAJECTORIES OF CO-DIMENSION THREE
VISHWA C. DUMIR Centre for Advanced Study in Mathematics, Panjab University, Chandigarh 160 014, India RAJINDER J. HANS-GILL Centre for Advanced Study in Mathematics, Panjab University, Chandigarh 160 014, India
ABSTRACT. Here two generalizations of the view-obstruction problem are studied and the relevant constants are obtained for obstructing the view through (n — 3)-dimensional subspaces (flats) in the case of spheres. Together with the results known earlier, these suggest two conjectures which are stated in Section 2.
1. INTRODUCTION The view-obstruction problem was originally formulated by Cusick [2], though it had been studied in another formulation by Wills [16] and Betke and Wills [1] in the case of boxes. Its generalisations were formulated and studied by Dumir, Hans-Gill and Wilker [3,4] where rays were replaced by subspaces (flats). In [4], they observed that the problem of obstructing the view through lines is related to the billiard ball motion problem considered by Schoenberg [12,13,14] (see also Konig and Sziics [10].) Generalisations to higher dimensional trajectories were considered by Schoenberg [15] in the case of boxes. The problem is in some sense related to the problem regarding the covering minima considered by Kannan and Lovasz [9]. Dumir et al [3,4] solved the problem of obstructing the view through (n-l)-dimensional subspaces (flats) for convex bodies in Rn centred at the origin o. In the special case of spheres centred at o, the relevant constants for obstructing the view through subspaces (flats) of dimension n-2 were also 229
230
DUMIR AND HANS-GILL
determined, together with Markoff type chains for related extreme values. Here we shall determine the relevant constants for view-obstruction through (n-3)-dimensional subspaces (flats). These results together with earlier ones suggest conjectures for the cases when (n-k)-dimensional subspaces (flats) are considered (see conjectures I, II in Section 2).
2. DEFINITIONS AND STATEMENT OF RESULTS. Let Rn denote n-dimensional Euclidean space; Zn the integral lattice and A, the shifted lattice (^, ..., |) + Zn. Let C be a closed, centrally symmetric, convex body centered at the origin o and let dc*(K,K') be the C-norm distance between non-empty subsets K,K' C Rn. In [4] (see also [3]) we considered, for flats F C Rn, the quantity //(C, F) = d c (A, F) = inf {a > 0 : (aC + A) n F ^ 0}. For each dimension 1 < d < n, we define i>(C,d) = sup |z/(C,L) : L subspace of dimension d not contained in a co-ordinate hyperplane} F(C, -Z/) = sup{i/(C,F) :F translate of subspace L} and ]7(C, d) = sup{77(C, L) : L subspace of dimension d not lying in a co-ordinate hyperplane} =sup {^(C, F) : F flat of dimension d not contained in a hyperplane Xi = constant}. Clearly z/(C,n) = F(C,n) = z/(C,R n ) = 0. It is shown in [4] that to determine /'(C, d) and I^(C, d) we need consider only 'rational' subspaces (see Section 3 for definition). A method is developed for finding upper bounds for f(C,L) and z/(C,L) for rational subspaces L. Among other results, this method is applied in [4] and [6] to show that for the sphere Bn of diameter 1 and centre o in R n ,i/(B n ,?z — 1) = l/\/3 for n > 3, and z/(B n ,n — 1) = l/V^ for n > 2; also ^(B n ,n — 2) — w| and F(Bn, n — 2) = 1, for n > 4. Some related isolation results are also obtained. In [5,6,7], Dumir et al showed that z/(B 4 , 1) = WY|and ^(B 4 , 1) = J | and z/(Bs, 1) — y||. Here we shall use the isolation results for j/(B n ,n — 2) and I7(B n ,n — 2) and the method developed in [4] to prove the following results Theorem 1. z>(B n ,n - 3) < 1 for n > 4. Corollary 1. ^(B n ,n - 3) = 1 for n > 7. The corresponding results for v are Theorem 2. P(B , n - 3) < A/| for n > 4. \
71 i
/
—
W Zi *
-
Corollary 2. i>(B n ,n - 3) = J~ for n > 6.
VIEW-OBSTRUCTION THROUGH TRAJECTORIES
231
Corollaries 1 and 2 follow at once from Theorems 1 and 2 respectively on observing that for the subspaces LI : X\ + X-2 -f £3 = 0, #2 ~~X3 ~\~ X4 — 0} %5 ~f~ X6 H~ ^7 — 0
and
L2 : £1 + £2 — 0, #3 -f £4 = 0, £5 + XQ = 0
f(B n , LI) = 1 and I7(Bn, L 2 ) = v/f. These results suggest the following conjectures: Conjecture I: z/(B n ,ri — k) = w | for n > 2k if k is even and for n > 2k + 1 if k is odd. Conjecture II: Z>(B n ,n — fc) = v/| for n > 2k. The results mentioned above show that these conjectures hold for co-dimension k=0,l,2 and 3. Remark: Obvious generalizations of LI and L% to n-k dimensional subspaces provide equality cases for Conjectures I and II respectively. 3. IRRATIONAL SUBSPACES. A d-dimensional subspace L of Rn is called rational if it is {o} or has a basis consisting of vectors in Qn. If a subspace is not rational, it is called irrational. We observed in [3,4] that every irrational subspace L is contained in a unique rational subspace M(L) of minimum dimension. Also for p e Rn, we showed that z/(B n ,L + p) — f(B n ,M(L) + p) and hence Z7(B n ,L)=F(B n ,M(L)). Let n > 4 and let L be an (n-3)-dimensional irrational subspace of Rn, not lying in a co-ordinate hyperplane. Then dim M(L) > n — 2. In [3,4,6], it is shown that f(B n ,n — 1) = -^=, I7(B n ,n — 1) = -4=, f(B n ,n — 2) — A/| and I7(Bn, n — 2) = 1. These results yield Theorem 3.Let n > 4. IfL is an irrational subspace of dimension n-3 not lying in a co-ordinate hyperplane o/R n , then i/(B n ,L) < y| and I7(B n ,L)< 1. 4. RATIONAL SUBSPACES. In this section we shall drop the subscript n and denote the sphere Bn by B. 4-1 Reduction and known results. Now let L be a rational subspace of dimension n-3, not lying in a co-ordinate hyperplane. Then L-1 is a rational subspace of dimension 3 in Rn. As in [5,6] we choose a reduced basis GI , C2,03 of the 3-dimensional lattice T = L1 fl Zn
232
DUMIR AND HANS-GILL
by Minkowski's reduction process (see Sections 10.3 and v.2 of [8]). These points satisfy the following properties (i) | GI |= min{| p |: peF,p 7^ o}. (ii) | c2 |= min{| p |: c l 5 p can be extended to a basis of F). (iii) | €3 |= min{| p |: ci, c2, p is a basis of F}. Let A be the determinant of the two dimensional lattice generated by GI, c2. Then A 2 =| Cl | 2 | c 2 | 2 -( Cl .c 2 ) 2 . The following inequalities hold (1)
|ci < | c 2 | < | c 3 l
(2)
I c,-.Cj |< - | Ci |2 for i < j,
(3)
id iic 2 Hc 3 \
where A = det F. The inequality (3) is a classical result of Gauss (see Mahlerfll]). From (3) we get
m
=?' <-
A2
2
ksT'
The inequalities (1), (2) and (4) are used throughout the paper without reference to them. Let S be a rational (n-2) dimensional subspace of Rn containing L. Let A(S) be the determinant of the lattice S1 n Zn. By Theorem 4, Corollary 9 and Remark 1 of [4] we have 2fC\
A
A
If S-1 is the subspace generated by ci,C2, then using (4) we get (7)
^D^B.S C3
(8)
2
For the proof of Theorem 1 we shall use an isolation result which follows from Theorem 11 of [4]. Lemma 1. For S =< Ci,c 2 >""" we have t>(B,S) < -4= except when (i) | ci \2= 2,| c2 |2= 3,ci.c 2 — 1, in which case z/ 2 (B,S) = |,
VIEW-OBSTRUCTION THROUGH TRAJECTORIES
233
(ii) | GI | 2 =| c2 \2= 5,ci.C2 = 0, in which case z/ 2 (B,S) = |, (Hi) | GI \2 = 5, | c2 \2= 7,ci.c 2 = 0, in which case i/ 2 (B,S) = ^|, (iv) | ci |2= 3, A2 = -r2(mod 6),r = 1,2,3 in to^ic^ case z/ 2 (B,S) = - 4- r29 For the proof of Theorem 2, we need the analogous isolation result, which follows from Corollaries 2 and 3 in [6]; Lemma 2. For S = < Ci,c 2 >1 we have F(B,S) < 4= except when (i)\ d \2= 3,ci.c 2 = 0 and 3 <| c2 |2< 5, in which case Z/ 2 (B,S) = 3 + T^W, (ii) | GI | 2 =| c2 \2= 3,Ci.C2 = 1, in which case F 2 (B,S) = ^, (Hi) \c\ |2= 2, m which case
'-\
_
|(1 + ^) 2 ,7 A 2 = 1 (mo
Also we need a result, which follows from Theorem 5 of [6] by projecting onto the space of the first four coordinates. Lemma 3. IfL is defined by the equations xi + £2 — 0> X2 + £3 = 0,x 2 + a?4 = 0,then F(B,L) = ^ Proof of Theorem 1. We divide the discussion into cases depending on the value of z/(B,S). Case 1: ^ 2 (B,S) < \. Here (7) gives z/2(B,L)
3. If | 03 |2= 2 then by (1), | GI |2 = | 02 |2= 2. It is easy to see that in this case L contains a point of A giving f(B,L) = 0. Case 2: | < ^ 2 (B,S) < f. Here (7) gives ^2(B,L)<|+ F f p < l i f |c3|2>4. It remains to consider the cases | 03 |2= 2,3. Using Lemma 1, it is easy to see that we need to consider the following case only: I C! |2- 2,| C2 |2 = | C3 |2- 3 , C i . C 2 - l,Ci.C 3 = 1.
Then c2.c3 = 0, 1 or -1 and A2 = 12 + 2(c2.c3) - 2(c2.c3)2 = 12,12,8, respectively. Here A2 = 5 and in case A =12, the ineguality (5) gives , —2
.
In case A = 8,c2.c3 = —1 and we can suppose without loss of generality, thatci = (1,1,0,0,0,0,...), c2 = (0, 1,1, 1,0,0,...) and c3 = (1,0, -1,0, 1,0, ...)
234
DUMIR AND HANS-GILL
or (0, !,-!,— 1,0,0,...). The second possiblity for C3 puts L into a coordinate hyperplane. So we need only consider the first possibility for c3. Orthogonalising these vectors we see that L is given by equations x\ + z2 — 0, -xi -f X2 + 2z3 + 2x4 — 0 and x\ — xi — 2x3 -f 8x4 + 5x5 — 0. Hence ,
1
--
10 -Taking x=(|, -\, |, |, -|,...) 6 A we obtain
r
- x2- 2x3 + 3z4 40
Case 3: ^ 2 (B,S) > f. This takes us into Case (iv) of Lemma 1 where | GI |2_ — 3, and v (B,S) = 3 + 3^75 with r — l,2,3,r 2 = -A2 (mod 6). Here the inequality (7) gives i/2(B,L)
(9)
2
2
ic 3 r
2
Therefore i/(B,L) < 1 if A > 2 r and | c3 | > 4. First we consider the case | c3 \2 — 3. Here | GI |2 = | c2 |2=: 3 and Ci.c 2 = 0 or 1. If Ci.c 2 = 1, then A2 = 8 giving r = 2 and A2 = 24 - 3( Cl .c 3 ) 2 - 3(c2.c3)2 + 2(ci.c 3 )(c 2 .c 3 ) > 16 since Ci.c3 and c2.c3 are 0 or ±1. Then (5) gives //(B,L) < 1. If ci.c 2 = 0 but ci.c3 ^ 0 or c2.c3 ^ 0 then renaming Ci,c 2 ,cs suitably will take us to the above case. So we can suppose that GI.CS = c 2 .C3 = 0. In this case it is easy to see (cf.[3], Lemma l)that i>(B,L) = 1. So we can now suppose that | c3 |2> 4. Now (9) gives z/(B,L) < 1 if A2 > 2r 2 . The condition A2 > 2r2 is always satisfied if r — 1 or 2. So let us suppose r = 3. Then it is easily seen that A2 > 2r2 = 18 and A2 = -9 (mod 6) are satisfied except when | c2 |2= 3,5 and Ci.c 2 = 0. If | c2 |2= 5 then A2 = 15, | c3 |2> 5 and (9) gives o o If | c2 \2= 3, then A2 = 9 and (9) gives
o
^ 2 (B,L) < i + i + -A- < 1, if | c3 |2> 6. o o I C3 I Since the case | c3 \2= 3 has already been discussed we are left with the case I Ci |2=:| 2
Here f (B,S) = |,A
2
C2 |2=
3 , C i . C 2 = 0, I C 3 | 2 =
4,5.
= 9 and
A2 - 9 c3
2
-3(Cl.c3)2 - 3(c2.c3)2 > 30.
VIEW-OBSTRUCTION THROUGH TRAJECTORIES
235
Therefore (5) gives
v
'
2 A2 2 ) — o ~*~ -r-2 — o
9 on
O
"A.
OU
This completes the proof of Theorem 1.
5. PROOF OF THEOREM 2. Here we divide the discussion into cases depending on the value of F(B, S). Case 1: F 2 (B,S) < \. Here (8) gives 1 2 3 F 2 (B,L) < - + i pr < -, because I c3 |2> 2. 2 I c3 \* 2 Case 2: F 2 (B,S) > \. Here we have to consider cases (i), (ii) and (iii) of Lemma 2. In cases (i) and (ii), F(B,S) < A/I and | c3 |2> 3, so that (8) gives
It now remains to consider | GI \2= 1. Here ^(B, S) is as given in Lemma 2(iii). In this case F 2 (B,S) < 1 and so
, C
if | c 3 | 2 > 4 .
I 3 I
If | c3 |2= 2, then | Ci | 2 =| 02 \2= 2. If further c;.Cj = 0 for each i < j, then I7(B,L) = w|. If c;.Cj ^ 0 for some i, j we can suppose that c\.c^ — 1. Then A2 = 3 and A2 - 6 - 2(Cl.c3)2 - 2(c2.c3)2 + 2(c1.c3)(c2.c3). _ 2
_ 2
Since A ^ 0,(ci.c 3 )(c2.c 3 ) = — 1 is not possible. Therefor A = 6 or 4. In case A = 6, F 2 (B,L) < | + | < |. In case A~ = 4, we can suppose that (ci.c 3 ,C2.c 3 ) = (1,0) or (1,1). Here we can suppose that GI = (1,1,0,0,...) and c2 = (0,1,1,0,0,...). There are now essentially four possibilities for c3. Two of these put L in a coordinate hyperplane. The other two are equivalent to taking c3 = (0, 1, 0, 1, 0, ...) so that L is given by the equation x\ + #2 — 0, x-2 + £3 = 0 and x% + £4 = 0. By Lemma 3, F(B, L) < */|. Now suppose that | c3 |2= 3. Then | c2 |2= 2 or 3. If | c2 \2= 3, then A2 = 6 or 5 and F 2 (B,S) = f or |f . Therefore F22 ( B , L ) < 6 9 /-~-^ 9
-^ \
c3
12
236
DUMIR AND HANS-GILL
Now let | c2 |2= 2. Here A2 = 4 or 3,1/ 2 (B,S) = 1 or f. When A2 = 4 we have Ci.c 2 = 0 and A = 12 — 2(ci.cs) 2 - 2(c2.c 3 ) 2 > 8. Therefore F(B,L)<1 + |^<|. When A2 = 3, we have Ci.c 2 — 1 and A 2 = 9 - 2( Cl .c 3 ) 2 - 2(c 2 .c 3 ) 2 + 2(c 1 .c 3 )(c 2 .c 3 ). Therefore */ 2 (B,L) <| + = ^ - < | i f A > 5. This inequality is satisfied except when (ci.c 3 )(c 2 .c 3 ) = —1. It is easy to see that this is not possible because L is not contained in a co-ordinate hyperplane. This completes the proof of Theorem 2. Acknowledgements: Considerable part of this paper was worked out jointly with Professor J.B. Wilker, who unfortunately expired in 1995 and our lively discussions on view-obstruction came to an end. The authors are grateful to the referee for pointing out some misprints.
REFERENCES [1] U. Betke and J.M. Wills, Untere Schranken fiir zwei diophantische Approximations-Functionen, Monatshefte fiir Math. 76 (1972), 214-217. [2] T.W. Cusick, View-obstruction problems, Aequationes Math. 9 (1973) 165-170. [3] V.C. Dumir, R.J. Hans-Gill and J.B. Wilker, Contributions to a general theory of view-obstruction problems, Can. J. Math. 20 (1993) 517-536. [4] _ Contributions to a general theory of view-obstruction problems II, J. of Number Theory 59 (1996) 352-373. [5] _ A Markoff type chain for the view-obstruction problem for spheres in R4, Monatshefte fiir Math. 118 (1994) 205-217. [6] _ View-obstruction and a conjecture of Schoenberg, Indian J. of Pure and Applied Math. 27 (1996) 323-342. [7] _ The view-obstruction problem for spheres in R5, Monatshefte fiir Math. 122 (1996) 21-34. [8] P.M. Gruber and C.G. Lekkerkerker, Geometry of Numbers, second edition, North-Holland, Amsterdam. [9] R. Kannan and L. Lovasz, Covering minima and lattice point free convex bodies, Annals of Math. 128 (1988) 577-602. [10] D. Konig and Sziics, Mouvement d'un point abandonne a 1'interieur d'un cube, Rendiconti del Circ. Mat. di Palermo 38 (1913) 79-90. [11] K. Mahler, On reduced positive definite ternary quadratic forms, J. of London Math. Soc. 15 (1940) 193-195. [12] I.J. Schoenberg, On the motion of a billiard ball in two dimensions, Delta, Madison, Wisconsin (1975) 1-18. [13] _ Extremurn problems for the motion of a billiard ball I. The Lp norm, 1 < P < oo, Indag. Math. 38 (1976) 66-75.
VIEW-OBSTRUCTION THROUGH TRAJECTORIES
237
[14] _ Extremum problems for the motion of a billiard ball II. The L^ norm, Indag. Math. 38 (1976) 263-279. [15] _ Extremum problems for the motion of a billiard ball III. The multidimensional case of Konig and Sziics, Studia Sci. Math. Hungarica 13 (1978) 53-78. [16] J.M. Wills, Zur simultanen homogenen diophantischen approximation I, Monatshefte fur Math. 72 (1968) 254-263. E-mail address: E-mail address:
vcdumirQpu.ac.in ' ' V . C. Dumir'' [email protected] ' ' R . J. Hans-Gill''
FAT 4-POLYTOPES AND FATTER 3-SPHERES
DAVID EPPSTEIN1 Department of Information and Computer Science, University of California, Irvine, CA 92697 GREG KUPERBERG2 Department of Mathematics, University of California, Davis, CA 95616 GUNTER M. ZIEGLER3 Institut fiir Mathematik, MA 6-2, Technische Universitat Berlin, D-10623 Berlin, Germany
ABSTRACT. We introduce the fatness parameter of a 4-dimensional polytope P, defined as 4>(P] = (/i + /2)/(/o + /a)- It arises in an important open problem in 4-dimensional combinatorial geometry: Is the fatness of convex 4-polytopes bounded? We describe and analyze a hyperbolic geometry construction that produces 4-polytopes with fatness >(P) > 5.048, as well as the first infinite family of 2-simple, 2-simplicial 4-polytopes. Moreover, using a construction via finite covering spaces of surfaces, we show that fatness is not bounded for the more general class of strongly regular CW decompositions of the 3-sphere.
1. INTRODUCTION The characterization of the set ^-3 of /-vectors of convex 3-dimensional poly topes (from 1906, due to Steinitz [28]) is well-known and explicit, with a simple proof: An integer vector (/o, /i, /2) is the /-vector of a 3-polytope if and only if it satisfies • /i = /o + /2 — 2 (the Euler equation), Supported in part by NSF grant CCR #9912338 Supported by NSF grant DMS #0072342 3 Supported by a DFG Leibniz grant 239
240
EPPSTEIN, KUPERBERG AND ZIEGLER
• /2 < 2/o — 4 (with equality for simplicial polytopes), and • /o < 2/2 — 4 (with equality for simple polytopes) . (Recall that by the definition of the /-vector, /^ is the number of fc-faces of the polytope.) This simple result is interesting for several reasons: • The set of /-vectors is the set of all the integer points in a closed 2-dimensional polyhedral cone (whose apex is the /-vector /(As) = (4,6,4) of a 3-dimensional simplex). In particular, it is convex in the sense that F$ = conv^) n Z3. • The same characterization holds for convex 3-polytopes (geometric objects), more generally for strongly regular CW 2-spheres (topological objects), and yet more generally for Eulerian lattices of length 4 (combinatorial objects [27]). In contrast to this explicit and complete description of jFs, our knowledge of the set ^-4 of /-vectors of (convex) 4-polytopes (see Bayer [2] and Hoppner and Ziegler [14]) is very incomplete. We know that the set J-± of all /-vectors of 4-dimensional polytopes has no similarly simple description. In particular, the convex hull of ^4 is not a cone, it is not a closed set, and not all integer points in the convex hull are /-vectors. Also, the 3-dimensional cone with apex /(A,$) spanned by ^-4 is not closed, and its closure may not be polyhedral. Only the two extreme cases of simplicial and of simple 4-polytopes (or 3-spheres) are well-understood. Their /-vectors correspond to faces of the convex hull of ^4, denned by the valid inequalities /2 > 2/3 and f\ > 2/o, and the (/-Theorem, proved for 4-polytopes by Barnette [1] and for 3-spheres by Walkup [34], provides complete characterizations of their /-vectors. (The g-Theorem for general simplicial polytopes was famously conjectured by McMullen [21] and proved by Billera and Lee [4] and Stanley [26]. See [35, §8.6] for a review.) But we have no similarly complete picture of other extremal types of 4-polytopes. In particular, we cannot currently answer the following key question: Is there a constant c such that all 4-dimensional convex polytopes P satisfy the inequality fi(P)+h(P)
<
c(f0(P)+h(P))l
To study this question, we introduce the fatness parameter def
fl(P)+h(P)
of a 4-polytope P. We would like to know whether fatness is bounded. For example, the 4-simplex has fatness 2, while the 4-cube and the 4-cross polytope have fatness || = |. More generally, if P is simple, then we can
FAT 4-POLYTOPES AND FATTER 3-SPHERES
241
substitute the Dehn-Sommerville relations /2(P) = /i(P) + /3(P) - /o(P)
/i(P) = 2/0(P)
into the formula for fatness, yielding /i(P)+/ 2 (P) _ 3/ 0 (P)+/ 3 (P) ~ / o ( P ) + /3(P)~ /o(P) + /3(P) < ' Since every 4-polytope and its dual have the same fatness, the same upper bound holds for simplicial 4-polytopes. On the other hand, the "neighborly cubical" 4-polytopes of Joswig and Ziegler [16] have /-vectors 0(
}
(4,2n,3n-6,n-2)-2n-2, and thus fatness
5n - 6 6= — -> 5. ^ n +2 In particular, the construction of these polytopes disproved the conjectured flag-vector inequalities of Bayer [2, pp. 145, 149] and Billera and Ehrenborg
[14, p. 109]. The main results of this paper are two lower bounds on fatness: Theorem 1. There are convex ^-polytopes P with fatness 0(P) > 5.048. Theorem 2. The fatness of cellulated 3-spheres is not bounded. A 3-sphere S with N vertices may have fatness as high as (f)(S) = f2(-/V 1//12 ). We will prove Theorem 1 in Section 3 and Theorem 2 in Section 4, and present a number of related results along the way. 2. CONVENTIONS Let X be a finite CW complex. If X is identified with a manifold M, it is also called a cellulation of M. The complex X is regular if all closed cells are embedded [22, §38]. If X is regular, we define it to be strongly regular if in addition the intersection of any two closed cells is a cell. For example, every simplicial complex is a strongly regular CW complex. The complex X is perfect if the boundary maps of its chain complex vanish. (A non-zero-dimensional perfect complex is never regular.) The f-vector of a cellulation X, denoted f ( X ) = (/o, / i , . . . ) , counts the number of cells in each dimension: fo(X) is the number of vertices, f i ( X ) is the number of edges, etc. If X is 2-dimensional, we define its fatness as def
fl(X)
242
EPPSTEIN, KUPERBERG AND ZIEGLER
If X is 3-dimensional, we define its fatness X as fl(X)+h(X)
If P is a convex d-polytope, then its /-vector /(P) is defined to be the /-vector of its boundary complex, which is a strongly regular (d— l)-sphere. If d = 4 we can thus consider >(P), the fatness of P. The faces of P of dimension 0 and 1 are called vertices and edges while the faces of dimension d — I and d — 2 are called facets and ridges. We extend this terminology to general cellulations of (d — 1) -manifolds. The flag vector of a regular cellulation X, and likewise the flag vector of a polytope P, counts the number of nested sequences of cells with prespecified dimensions. For example, fois(X) is the number triples consisting of a 3-cell of X, an edge of the 3-cell, and a vertex of the edge; if P is a 4-cube, then /oi 3 (P) = 192. A convex polytope P is simplicial if each facet of P is a simplex. It is simple if its polar dual PA is simplicial, or equivalently if the cone of each vertex matches that of a simplex. 3. 4-POLYTOPES In this section we construct families of 4-polytopes with several interesting properties: • They are the first known infinite families of 2-simple, 2-simplicial 4:-polytopes, that is, polytopes in which all 2-faces and all dual 2-faces are triangles (all edges are "co-simple"). E.g., Bayer [2] says that it would be interesting to have an infinite family. As far as we know, there were only six such polytopes previously known: the simplex, the hypersimplex (the set of points in [0, 1]4 with coordinate sum between 1 and 2), the dual of the hypersimplex, the 24-cell, and a gluing of two hypersimplices (due to Braden [6]), and the dual of the gluing. (There are claims in Griinbaum [13, p. 82, resp. p. 170] that results of Shephard, resp. Perles and Shephard, imply the existence of infinitely many 2-simple 2-simplicial 4-polytopes. Both claims appear to be incorrect.) • They are the fattest known convex 4-polytopes. • They yield finite packings of (not necessarily congruent) spheres in R3 with slightly higher average kissing numbers than previously known examples [18]. Let Q C R4 be a 4-polytope that contains the origin in its interior. If an edge e of Q is tangent to the unit sphere S"3 C R4 at a point t, then the
FAT 4-POLYTOPES AND FATTER 3-SPHERES
243
corresponding ridge (2-dimensional face) F = e^ of the polar dual P = QA is also tangent to S3 at t. Recall that the polar dual is defined as *
Furthermore, the affine hulls of e and F form orthogonal complements in the tangent space of S3, so the convex hull conv(e U F) is an orthogonal bipyramid tangent to S3 (cf., Schulte [24, Thm. 1]). We will construct polytopes E by what we call the E-construction. This means that they are convex hulls Ed=conv(guP), where Q is a simplicial 4-dimensional polytope whose edges are tangent to the unit 3-sphere S3, and P is the polar dual of Q. Thus P is simple and its ridges are tangent to 53. (We call Q edge-tangent and P ridge-tangent.) Proposition 3. If P is a simple, ridge-tangent ^-polytope, then the ^-polytope E = conv(P U Q) produced by the E-construction is 2,-simple and 2simplicial, with f-vector f ( E ) = (/2(P),6/o(P),6/ 0 (P),/ 2 (P)), and fatness ^)=6 / ° ( P )
Proof. Another way to view the ^-construction is that E is produced from P by adding the vertices of Q sequentially. At each step, we cap a facet of P with a pyramid whose apex is a vertex of Q. Thus the new facets consist of pyramids over the ridges of P, where two pyramids with the same base (appearing in different steps) lie in the same hyperplane (tangent to S3), and together form a bipyramid. The facets of the final polytope E are orthogonal bipyramids over the ridges of P and are tangent to S3. Since the 2-faces of E are pyramids over the edges of P, E is 2-simplicial. The polytope E is 2-simple if and only if each edge is co-simple, i.e., contained in exactly three facets of E. The iterative construction of E shows that it has two types of edges: (i) edges of P, which are co-simple in E if and only if they are co-simple in P, and (ii) edges formed by adding pyramids, which are co-simple if and only if the facets of P are simple. Since P is simple, its facets are simple and its edges are co-simple, so E is then 2-simple. This combinatorial description of E yields an expression for the /-vector of E in terms of the flag vector [3, 2, 14] of P. Since the facets of E are
244
EPPSTEIN, KUPERBERG AND ZIEGLER
bipyramids over the ridges of P, the following identities hold: ME) = h(P)
ME) = /13(P)
ME) = /I(P) + /03(P)
ME) = /0(P) + /3(P).
Since P is simple, /03(P)=4/ 0 (P)
/13(P) = 3/i(P).
These identities together with Eider's equation and /i(P) = 2/o(P) imply the proposition. D The /-vector of P also satisfies /o(P) - /i(P) + / 2 (P) - /3(P) = 0
/i(P) = 2/ 0 (P),
in the second case because P is simple, so the fatness of E can also be written
Thus maximizing the fatness of E is equivalent to maximizing the ridge- facet ratio /2(P)//s(P), or the average degree of the graph of Q. It also shows that the jE-construction cannot achieve a fatness of 6 or more. In light of Proposition 3, we would like to construct edge-tangent simplicial 4-polytopes. Regular simplicial 4-polytopes (suitably scaled) provide three obvious examples: the 4-simplex A4, the cross poly tope 64A, and the 600-cell. From these, the E'-construction produces the dual of the hypersimplex, the 24-cell, and a new 2-simple, 2-simplicial polytope with /-vector (720, 3600, 3600, 720) and fatness 5, whose facets are bipyramids over pentagons. We will construct new edge-tangent simplicial 4-polytopes by gluing together (not necessarily simplicial) edge-tangent 4-polytopes, called atoms, to form compounds. We must position the polytopes so that their facets match, they remain edge-tangent, and the resulting compound is convex. It will be very useful to interpret the interior of the 4-dimensional unit ball as the Klein model of hyperbolic 4-space H4, with S3 the sphere at infinity. (See Iversen [15] and Thurston [30, Chap. 2] for introductions to hyperbolic geometry.) In particular, Euclidean lines are straight in the Klein model, Euclidean subspaces are flat, and hence any intersection of a convex polytope with HI 4 is a convex (hyperbolic) polyhedron. Even though the Klein model respects convexity, it does not respect angles. However, angles and convexity are preserved under hyperbolic isometries. There are enough isometries to favorably position certain 4-polytopes to produce convex compounds. If a polytope Q is edge-tangent to ,53, then it is hyperbolically hyperideal: Not only its vertices, but also its edges, lie beyond the sphere at infinity, except for the tangency point of each edge. Nonetheless portions of its facets
FAT 4-POLYTOPES AND FATTER 3-SPHERES
245
and ridges lie in the finite hyperbolic realm. As a hyperbolic object the polytope Q (more precisely, QflH 4 ) is convex and has flat facets. The ridge r between any two adjacent facets has a well-defined hyperbolic dihedral angle, which is strictly between 0 and TT if (as in our situation) the ridge properly intersects H4. To compute this angle we can intersect r at any point t with any hyperplane R that contains the (hyperbolic) orthogonal complement to r at t. We let t be the tangent point of any edge e of the ridge, and let R be the hyperplane perpendicular to e.
FIGURE 1. A cone emanating from an ideal point t in H3 in the Poincare model, and a horosphere 5 incident to t. The link of t (here a right isosceles triangle) inherits Euclidean geometry from S. Within the hyperbolic geometry of .R = H3, every line emanating from the ideal point t is orthogonal to any horosphere incident to t. Thus the link of the edge e of Q is the intersection of Q fl R with a sufficiently small horosphere S at t. Since horospheres have flat Euclidean geometry [30, p. 61], the link Q D S is a Euclidean polygon. Its edges correspond to the facets of Q that contain e, and its vertices correspond to the ridges of Q that contain e. Thus the dihedral angle of a ridge r of Q equals to the Euclidean angle of the vertex r D S of the Euclidean polygon Q D S. This is easier to see in the Poincare model of hyperbolic space, because it respects angles, than in the Klein model. Figure 1 shows an example. To summarize:
246
EPPSTEIN, KUPERBERG AND ZIEGLER
Lemma 4. A compound of two or more polytopes is convex if and only if each ridge has hyperbolic dihedral angle less than TT, or equivalently, iff each edge link is a convex Euclidean polygon. Compounds can also have interior ridges with total dihedral angle exactly 2?r. But since all atoms of a compound are edge-tangent, compounds do not have any interior edges or vertices. If Q is a regular polytope, then Q D S is a regular polygon. The following lemma is then immediate: Lemma 5. // Q is a regular, edge-tangent, simplicial ^-polytope, then in the hyperbolic metric of the Klein model, its dihedral angles are Tr/3 (for the simplex), ir/2 (for the cross polytope), and 3/T/5 (for the 600-cell). A hyperideal hyperbolic object, even if it is an edge-tangent convex polytope, can be unfavorably positioned so that it is unbounded as a Euclidean object (c/., Schulte [24, p. 508]). Fortunately there is always a bounded position as well: Lemma 6. Let be Q an edge-tangent, convex polytope in M whose points of tangency with Sd~l do not lie in a hyperplane. Then there is a hyperbolic isometry h (extended to all o / R d j such that h(Q) is bounded. Proof. Let p lie in the interior of the convex hull of the edge tangencies and let / be any hyperbolic motion that moves p to the Euclidean origin in IR rf . Since the convex hull K of the edge tangencies of h(Q) contains the origin, K^ is a bounded polytope that circumscribes Sd~l. Since K^ is facet-tangent where h(Q] is edge-tangent, h(Q] C K^. D In the following we discuss three classes of edge-tangent simplicial convex 4-polytopes that are obtained by gluing in the Klein model: Compounds of simplices, then simplices and cross polytopes, and finally compounds from cut 600-cells. There are yet other edge-tangent compounds involving cross polytopes cut in half (ie., pyramids over octahedra), 24-cells, and hypersimplices as atoms, but we will not discuss these here. 3.1. Compounds of simplices. In this section we classify compounds whose atoms are simplices. This includes all stacked polytopes, which are simplicial polytopes that decompose as a union of simplices without any interior faces other than facets. However compounds of simplices are a larger class, since they may have interior ridges. Lemma 7. Any edge-tangent d-simplex is hyperbolically regular. Proof. The proof is by induction on d, starting from the case d = 2, where the three tangency points define an ideal triangle in H2. All ideal triangles
FAT 4-POLYTOPES AND FATTER 3-SPHERES
247
are congruent [30, p. 83]. Since edge-tangent triangles are the polar duals of ideal triangles, they are all equivalent as well. If d > 2, let B be a general edge-tangent d-simplex. On the one hand, there exists an edge-tangent simplex A which is regular both in hyperbolic geometry and Euclidean geometry. On the other hand, given the position of d of the vertices, there are at most two choices for the last vertex that produce an edge-tangent simplex, one on each side of the hyperplane spanned by the first d. By induction there exists an isometry that takes a face of B to a face of A and the remaining vertex to the same side. The edge-tangent constraint implies that this isometry takes the last vertex of B to the last vertex of A as well. D Proposition 8. There are only three possible edge-tangent compounds of ^-simplices: • the regular simplex, • the bipyramid (a compound of two simplices that share a facet), and • the join of a triangle and a hexagon (a compound of six simplices that share a ridge). Proof. Figure 2 shows all strictly convex polygons with unit-length edges tiled by unit equilateral triangles, or triangle jewels. Since the atoms of an edge-tangent compound of simplices are edge-tangent, they are hyperbolically regular by Lemma 7, and their edge links are equilateral triangles. Thus every edge link of a compound of simplices is a triangle jewel. Any three 4-simplices in a chain in such a compound share a ridge. In order to create an edge link matching Figure 2, they must extend to a ring of six simplices around the same ridge. Adding any further simplex to these six would create an edge link in the form of a triangle surrounded by three other triangles, which does not appear in Figure 2. D
FIGURE 2. The 3 possible edge links of edge-tangent compounds of 4-simplices. Two of the .E-polytopes produced by Proposition 8 were previously known. If Q is the simplex, then E is dual to the hypersimplex. If Q is the bipyramid, then E is dual to Braden's glued hypersimplex. However, if Q is the sixsimplex compound (dual to the product of a triangle and a hexagon), then E is a new 2-simple, 2-simplicial polytope with /-vector (27,108,108,27).
248
EPPSTEIN, KUPERBERG AND ZIEGLER
Proposition 8 also implies an interesting impossibility result. Corollary 9. No stacked 4-polytope with more than 6 vertices is edge-tangent. See Schulte [24, Thm. 3] for the first examples of polytopes that have no edge-tangent realization. 3.2. Compounds of simplices and cross polytopes. Next, we consider compounds of simplices and regular cross polytopes. The edge link of any convex compound of these two types of polytopes must be one of the eleven strictly convex polygons tiled by unit triangles and squares, or squaretriangle jewels (Figure 3). See Malkevitch [20] and Waite [33] for work on convex compounds of these shapes relaxing the requirement of strict convexity.
FIGURE 3. The 11 possible edge links of edge-tangent compounds of 4-simplices and cross polytopes. If Q is a single cross polytope, then E is a 24-cell. We can also glue simplices onto subsets of the facets of the cross polytope. The new dihedral angles formed by such a gluing are 57T/6. The resulting compound is convex as long as no two glued cross polytope facets share a ridge. We used a computer program to list the combinatorially distinct ways of choosing a subset of nonadjacent facets of the cross polytope; the results may be summarized as follows. In addition to the 24-cell, this yields 20 new 2-simple, 2-simplicial polytopes. Proposition 10. There are exactly 21 distinct simplicial edge-tangent compounds composed of one regular 4-dimensional cross polytope and k > 0
FAT 4-POLYTOPES AND FATTER 3-SPHERES
249
simplices, according to the following table: k 0 1 2 3 4 5 6 7 8 Total 1 1 3 3 6 3 2 1 1 21
#
We can also confirm that every square-triangle jewel arises as the edge link of an edge-tangent 4-dimensional compound. For every jewel other than the one in the center, we can form a convex edge bouquet consisting of simplices and cross polytopes that meet at an edge: we replace each triangle by a simplex and each square by a cross polytope. Since the central jewel has two adjacent squares, its edge bouquet is not convex. Instead we glue two cross polytopes along a facet so that the 4 ridges of that facet are flush, z'.e., their dihedral angle is TT. Thus we can "caulk" each such ridge with three simplices that share the ridge. The central jewel is the link of 6 of the edges of the resulting compound of 2 cross polytopes and 12 simplices. Simplices and regular cross polytopes combine to form many other edgetangent simplicial polytopes and hence 2-simple, 2-simplicial polytopes. In particular, these methods lead to the following theorem. Theorem 11. There are infinitely many combinatorially distinct 2-simple, 2-simplicial facet-tangent ^-polytopes. Proof. We glue n cross polytopes end-to-end. Each adjacent pair produces 4 flush ridges that we caulk with chains of three simplices. The facets to which these simplices are glued are not adjacent and so do not produce any further concavities. D The chain of n cross polytopes has /-vector (4n + 4,18n + 6,28n + 4,14n + 2). Filling a concavity adds (2,9,14,7), so after filling the 4(n — 1) concavities we get a simplicial polytope Q with /(Q) = (12n-4,54n-30,84n-54,42-26), which yields a 2-simple, 2-simplicial 4-polytope E with f ( E ) = (54ra - 30,252n - 156,252n - 156,54n - 30) by Proposition 3. Remark. Every 2-simple, 2-simplicial 4-polytopes that we know is combinatorially equivalent to one which circumscribes the sphere. Are there any that are not? We do know a few 2-simple, 2-simplicial 4-polytopes which are not .E-polytopes. Trivially there is the simplex. There are a few others that arise by the fact that the 24-cell is the .E-polytope of a cross polytope in 3
250
EPPSTEIN, KUPERBERG AND ZIEGLER
different ways. Color the vertices of a 24-cell red, green, and blue, so that the vertices of each color span a cross polytope. If we cap one facet of a cross-polytope by a simplex and apply the ^-construction, the result is a 24-cell in which 6 facets that meet at 1 vertex are replaced by 10 facets and 4 vertices. If the replaced vertex is red, the replacement can be induced by capping either blue cross polytope or the green cross polytope and then applying the .E-construction; the position of the replacement differs between the two cases. If we replace two different red vertices, one by capping the green cross polytope and the other by capping the blue cross polytope, then the resulting polytope is 2-simple and 2-simplicial but not an E-polytope. This construction has several variations: for example, we can also replace three vertices, one of each color. 3.3. Compounds involving the 600-cell. If Q is the 600-cell, then E is a 2-simple, 2-simplicial polytope with /-vector (720, 3600,3600, 720) and fatness exactly 5. Again, we can glue simplices onto any subset of nonadjacent facets of the 600-cell, creating convex compounds with dihedral angle 147T/15. We did not count the (large) number of distinct ways of choosing such a subset, analogous to Proposition 10. It is not possible to glue a cross polytope to a 600-cell, because that would create an Il7r/10 angle (ie., a concave dihedral of 9?r/10) which cannot be filled by additional simplices or cross polytopes. The large dihedral angles of the 600-cell make it difficult to form compounds from it, but we can modify it as follows to create smaller dihedrals. Remove a vertex and form the convex hull of the remaining 119 vertices. The resulting convex polytope has 580 of the 600-cell's tetrahedral facets and one icosahedral facet. The pentagonal edge link (Figure 4(a)) of the edges bordering this new facet become modified in a similar way, by removing one vertex and forming the convex hull of the remaining four vertices (Figure 4(b)), which results in a trapezoid; thus, the hyperbolic dihedrals at the ridges around the new facet are 27T/5. This cut polytope is not simplicial, but we may glue two of these polytopes together along their icosahedral facets, forming a simplicial polytope with 4?r/5 dihedrals along the glued ridges. This compound's new edge links are hexagons formed by gluing pairs of trapezoids (Figure 5(a)). The same cutting and gluing process may be repeated to form a sequence or tree of 600-cells, connected along cuts that do not share a ridge. For such a chain or tree formed from n cut 600-cells, the /-vector may be computed as /(Q) = (106n + 14,666n + 54,1120n + 80,560n + 40), so the ^/-construction yields f ( E ) = (666n + 54,3360n + 240,3360n + 240,666n + 54)
251
FAT 4-POLYTOPES AND FATTER 3-SPHERES
(a)
(b)
(c)
FIGURE 4. Edge figures of (a) a 600-cell, (b) a 600-cell with one vertex removed, (c) a 600-cell with two removed vertices, and (d) an icosahedral cap. and thus a fatness of 3360n + 240 666n + 54
560
TIT
5.045045.
Thus the fatness of the 2-simple, 2-simplicial polytopes formed by such compounds improves slightly on that formed from the 600-cell alone.
(a)
(b)
FIGURE 5. Edge links of compounds of cut 600-cells.
252
EPPSTEIN, KUPERBERG AND ZIEGLER
It is also possible to form compounds involving 600-cells which have been cut by removing several vertices (as described above) so that two of the resulting icosahedral facets meet at a ridge. Each edge link at this ridge is an isosceles triangle formed by removing two vertices from a pentagon (Figure 4(c)). Thus the dihedral angle of the triangular ridge between the icosahedral facets is ?r/5. We can therefore form compounds in which ten of these doubly-cut 600-cells share a triangle, whose edges links are a regular decagon cut into ten isosceles triangles (Figure 5(b)). Yet other compounds of cut 600-cells and simplices are possible, although we do not need them here. The cut 600-cells also form more complicated compounds which require some group-theoretic terminology to explain. The vertices of a regular 600cell form a 120-element group under (rescaled) quaternionic multiplication, the binary icosahedral group. This group has a 24-element subgroup, the binary tetrahedral group, which also arises as the units of the Hurwitz integers (see Conway and Sloane [7, §2.2.6,8.2.1]). Let A be the convex hull of the other 96 vertices of the 600-cell; ie., A is formed by cutting 24 vertices from 600-cell in the above manner. The resulting polytope is the "snub{3,4,3}" (snub 24-cell) of Coxeter [8, §8.4,8.5]. Its /-vector is (96,432,480,144). Every icosahedral facet of A is adjacent to 8 other icosahedron facets, as well as to 12 tetrahedra. Thus A has 96 icosahedron-icosahedron ridges. We can build new hyperbolic, edge-tangent, simplicial polytopes by gluing copies of A along icosahedral faces and capping the remaining icosahedral facets with pyramidal caps of the type that we had cut off to form A. (The edge links of such a cap C are given by Figure 4(d).) The resulting polytope Q will be convex if at each icosahedral-icosahedral ridge of a copy of A, either 10 copies of A meet, or two caps and one or two copies of A do. Also at each icosahedral-tetrahedral ridge of a copy of A, either two copies of A or one each of A and a cap must meet. If two copies of A meet (in an icosahedral facet F), then they differ by a reflection through F. These reflections generate a discrete hyperbolic reflection group F since the supporting hyperplanes of the icosahedral facets (the facets of a hyperideal 24-cell, whose ridges are also ridges of ^1!) satisfy the Coxeter condition: When they meet, they meet at an angle of Tr/5, which divides TT. Thus the copies of A used in Q are a finite subset S of the orbit of A under F. The set S determines Q. Remark. That it suffices to consider the dihedral angles of adjacent facets follows from Poincare's covering-space argument: Let P be a spherical, Euclidean, or hyperbolic polytope whose dihedral angles divide TT. Let X denote the space in which it lives. Let Y be the disjoint union of all copies of P in X in every position, and let Z be the quotient of Y given by identifying two
FAT 4-POLYTOPES AND FATTER 3-SPHERES
253
copies of P along a shared facet. The space Z is constructed abstractly so that P tiles it. We claim that Z is a covering space of X. Each p 6 Z lies in the interior of some face F of a copy of P. If F is a copy of P or a facet, this is elementary; if F is a ridge, it follows from the dihedral angle condition. Otherwise it follows by applying the covering-space argument inductively, replacing X by the link S of F and P by P n S. Since Z is a covering space, a connected component of Z is a tiling of X by P. See Vinberg [32] for a survey of hyperbolic reflection groups. There is no one best choice for S, only a supremal limit. One reasonable choice for S is the corona of a copy of A, i.e., A together with the set of all images under F that meet it, necessarily at a facet or a ridge. The corona of A is depicted by a simplified (and therefore erroneous) schematic in Figure 6; the reader should imagine the correct, more complicated version. The schematic uses a chemistry notation in which each copy of A is represented as an atom, each pair of copies that shares a facet is represented as a bond, and "7A" denotes a chain of 7 atoms. To extend the terminology, we call 10 copies of A that meet at a ridge a ring. The schematic is simplified in that the central copy actually has 24 bonds (not 6), each of the neighbors has 9 bonds (not 3), and there are 96 rings (not 6). 7A / \
A
A
\/ 7A FIGURE 6. An oversimplified schematic of a corona of A. Let Q be the union of these copies of A with the remaining icosahedral facets capped. To compute the /-vector of Q it is easier to view each atom as a copy of a 600-cell B, minus two caps for each bond. There are 1+24+96-7 = 697 atoms and 24 + 96 • 8 = 792 bonds in total. Thus Q has /3(Q) = 697/3(5) - 792 • 2/£(C) = 386520 facets, where f^(C) — 30 is the number of simplicial facets of a cap C.
254
EPPSTEIN, KUPERBERG AND ZIEGLER
Counting vertices is more complicated. Let / be an icosahedron and let T be a triangle. Then /o(Q) = 697/0(£) - 792 - 2/0(C) + 792/0(J) + 96/0(T) = 72840, because after the vertices of the caps are subtracted, the vertices of each icosahedral facet at a bond are undercounted once, and after these are restored the vertices of each triangle at the center of a ring are undercounted once. The rest of the /-vector of Q follows from the Dehn-Sommerville equations: h(Q] = 2/3(Q) = 773040, /i (Q) = /o(Q)+/3(Q)= 459360. The polytope Q yields an E'-polytope with fatness
Note that since this bound arises from a specific choice of S rather than a supremal limit, this is not optimal as a lower bound of supremal fatness. 3.4. Kissing numbers. As mentioned above, another use of ridge-tangent polytopes P is the average kissing number problem [18]. Let X be a finite packing of (not necessarily congruent) spheres S3, which is equivalent to a finite sphere packing in M 3 by stereographic projection. The question is to maximize the average number of kissing points of the spheres in X . If P is ridge-tangent, its facets intersect the unit sphere S3 in a sphere packing X, in which the spheres kiss at the tangency points of P. Thus the ridge-facet ratio of P is exactly half the average kissing number of X. (Not all sphere packings come from ridge-tangent polytopes in this way.) The sphere packings due to Kuperberg and Schramm [18] can be viewed as coming from a compound consisting of a chain or tree of n cut 600-cells (i.e., atoms in the sense of Figure 6). Their average kissing numbers are 666n + 54 666 K = 2—> - w 12.56603. 106ra + 14 53 By contrast if Q is the compound formed from a corona of A as in Section 3.3, then the average kissing number of the corresponding sphere packing is
= Like the bound on fatness, it is not optimal as a lower bound on the supremal average kissing number. Here we offer no improvement on the upper bound K < 8 + 4\/3 « 14.92820
FAT 4-POLYTOPES AND FATTER 3-SPHERES
255
from [18], even though it cannot be optimal either. 4. 3-SPHERES
In this section we construct a family of strongly regular cellulations of the 3-sphere with unbounded fatness. Indeed, we provide an efficient version of the construction, in the sense that it requires only polynomially many cells to achieve a given fatness. (The construction is also a polynomially effective randomized algorithm.) Given TV, we find a strongly regular cellulation of S3 with O(N12) cells and fatness at least N. Note that there are also powerlaw upper bounds on fatness: An O(N1/3) upper bound for the fatness of a convex 4-polytope with N vertices follows from work by Edelsbrunner and Sharir [9]. The K6vari-S6s-Turan theorem [17] (see also [5, p. 1239] and [23, Thm. 9.6,p. 121]) implies an 0(TV2/3) upper bound on the fatness of strongly regular cellulations of 53, since the vertex-facet (atom-coatom) incidence graph has no K3;3-subgraph, and thus has at most O(/o(/o + /s)2/3) edges. Our construction provides an £l(N1/12) lower bound. The inefficient construction is a simpler version which we describe first. For every g > 0, S3 can be realized as HI U (Sg x /) U #2,
a thickened surface of genus g capped on both ends with handlebodies. (This is obtained from a neighborhood of the standard [unknotted] smooth embedding of Sg into S3.) If for some g we can find a fat cellulation of 55, we can realize S3 as a "fat sausage with lean ends," as shown in Figure 7. We cross the fat cellulation of Sg with an interval divided into TV segments to produce a fat cellulation of Sg x I. Then we fix arbitrary strongly regular cellulations of the handlebodies H\ and H^. If we make the sausage long enough, i.e., if we take N —> oo, the fatness of the sausage converges to the fatness of its middle regardless of the structure of its ends.
S9xl
FIGURE 7. S3 as a fat sausage with lean ends. It remains only to show that there are strongly regular fat cellulations of surfaces. The surface Sg has perfect cellulations with /-vector (l,2g, 1). Such a cellulation is obtained by gluing pairs of sides of a 4#-gon in such a
256
EPPSTEIN, KUPERBERG AND ZIEGLER
way that all vertices are identified. It has fatness g, and it exists for arbitrarilyjarge #, but it is far from regular. However, its lift to the universal cover Sg is strongly regular, since any such cellulation can be represented by a tiling of the hyperbolic plane by convex polygons. (Indeed, if we take the regular 4^-gon with angles of 7r/(2g), which is certainly convex, then its edges and angles are compatible with any perfect cellulation.) Moreover, Mal'cev's theorem [19], states that finitely generated matrix groups are residually finite; this implies that every closed hyperbolic manifold admits intermediate finite covers with arbitrarily large injectivity radius. (See [11, §4] for a detailed exposition.) In particular Sg admits an intermediate cover Sg whose injectivity radius exceeds the diameter of a 2-cell. The cellulation of Sg is then strongly regular. Its genus is much larger than g, but its fatness is still 9-
The efficient construction is the same: It only requires careful choices for the finite cover Sg and for the handlebodies HI and H^- Among the perfect cellulations of Sg, a convenient one for us is a 4-gon with opposite edges identified. We describe the fundamental group -ni(Sg) using this cellulation. As shown in Figure 8, we number the edges XQ, . . . , #45-i consecutively, so that (1)
X
i ~
X
2g+i
and (2)
(We interpret the indices as elements of Z/(4g).) Equation (1) expresses the identifications, while equation (2) expresses the boundary of the 2-cell.
FIGURE 8. Labelling edges of Sg.
FAT 4-POLYTOPES AND FATTER 3-SPHERES
257
We construct Sg as a tower of two abelian finite covers, which together form an irregular cover of Sg. (No abelian cover of Sg is strongly regular.) The surface Sg satisfies the usual requirements of covering-space theory (see Fulton [12, § 13b, 14a]): It is a connected, locally path-connected, and locally simply connected space. For any finite group A, the A-coverings of Sg are covering spaces of the form Y with Y/A = Sg , where A acts properly discontinuously on Y. These coverings, up to isomorphism, are classified by the set of group homomorphisms Hom(7Ti(S'5,s), A) [12, Thm. 14.a]. Furthermore, if A is abelian, then every such homomorphism maps the commutators in 7Ti(S5, x) to zero, so the .A-coverings are classified by Hom(Hi(Sg, Z ), .A). In other words, if A is any abelian group with n elements, then every homomorphism a : Hi(Sg) —> A defines an n-fold abelian covering of Sg. (If the homomorphism is not surjective, then the covering space is not connected [12, p. 193]. In this case we use a connected component of the covering space, which has the same fatness but smaller genus.) Now assume that q = 4g + 1 is a prime power and let a generate the cyclic group F*, where ¥q is the field with q elements. We can fulfill the assumption by changing g by a bounded factor. (Most simply we can let q = 5k. Or we can let q be prime, so that ¥ q — Z /g, by a form of Bertrand's postulate for primes in congruence classes. This result dates to the 19th century; see Erdos [10] for an elementary proof.) Define a homomorphism a : Hi(Sg] —> Fg by o"([a^i]) = at1, where [xi\ is the 1-cycle (or homology class) represented by the loop xi. Since o?9 = — 1, the definition of a is consistent with equation (1). Consistency with (2) is then automatic. Let S'g be the finite cover corresponding to a. To prepare for the subsequent analysis of Sg, we give an explicit combinatorial description of S'g. Let F° be a 2-cell of S'g and label its vertices
in cyclic order. See Figure 9. For each s 6 F9, let Fs and vf. be the images of F° and v® under the action of s. Since Sg has only one vertex, the vertices of S' may be identified with ¥ q. Thus, if we identify VQ with 0 6 ¥ q, then the action of ¥ q will identify VQ with s 6 F9. The structure of a further implies that c
_
9
If
vf. = s + l + a + cr + ...+ or *
t
= sH
Q-
— -I
a- 1
for all k e Z/(4p) and s <E Fg. See Figure 10. Using this explicit description, it is routine to verify the following (remarkable) properties of the surface S'g.
EPPSTEIN, KUPERBERG AND ZIEGLER
258
+a
FIGURE 9. Labelling the vertices of F°. l =
— s +
S +
1
VQ — S
a3-! a-1
FIGURE 10. Labelling the vertices of Fs. Lemma 12. The cellulation of the abelian cover S'g is regular and has f-vector
Every facet has q — l = 4^g vertices, while every vertex has degree q—l — 4g. The graph (or l-skeleton) of S'g is the complete graph on q + l vertices. The dual graph is also complete; any two facets share exactly one edge (as well as q — 4 other vertices).
259
FAT 4-POLYTOPES AND FATTER 3-SPHERES
Proof. In view of the combinatorial description above (Figure 10), all these facts follow from simple computations in the field Fg: • S' is regular — for each s 6 Fg, the vertex labels s + aa~i (0 < k < 4g) are distinct. • The 1-skeleton of S' is complete — for v,v' 6 ¥ q, v =£ v' there is a unique s 6 ¥q and k e Z/(4#) with
= s-\
ak - 1 — a —1
, v=s-\
a —1
The dual graph of S' is complete — for s,s' £ Fg, s ^ s', there are unique k,t 6 Z/(4g) such that ak , = s' + a —I a —I ak+i _ ! s+ = s' 4a —1 a —1
s+
a Theorem 13. Let n > I28g4, and let Z/n
fee a randomly chosen homomorphism, and let Sg be the finite cover of S'g corresponding to p. Then with probability more than ^, the cellulation of Sg is strongly regular. In order to prove Theorem 13, we need to more explicitly describe the condition of strong regularity as it applies to Sg. Let X be a regular cell complex and suppose that its universal cover X is strongly regular. Recall that the star st(v) of a vertex v in X is the subcomplex generated by the cells that contain v. The complex X is strongly regular if and only if the star of each vertex is. Suppose that v e X projects to v € X. Then the star st(tT), which is strongly regular, projects to the star st(v). The latter is strongly regular if and only if the projection is injective. In other words, X is strongly regular if and only if the stars of X embed in X. If X is not strongly regular, then there must be a path t connecting distinct vertices of st(v) which projects to a loop i in st(v). We say that such a loop obstructs strong regularity. We can assume that t is a pair of segments properly embedded in distinct cells in st(^), with only the end-points of the segments on the boundary of the cells, which implies that i is embedded if X is regular. Figure 11 gives an example of such a loop i in a regular cellulation of a torus.
EPPSTEIN, KUPERBERG AND ZIEGLER
260
3
1 F1
F3
0!
FO\
.-'" t 4
2
F4
1
FIGURE 11. A loop t that obstructs strong regularity in the torus S{. In our case, the surfaces S' are regular, but they have many obstructing loops. Theorem 13 asserts that, with non-zero probability, all such loops lengthen when lifted to Sg. Lemma 14. No loops in S' that obstruct strong regularity are null-homologous. Furthermore, all obstructing loops represent indivisible elements in Hi(S'g}. Proof. In brief, they are indivisible because they are embedded, and they are too short to be null-homologous. By Lemma 12, 5' is regular. By the discussion after the statement of Theorem 13, each obstructing loop I is embedded. If t separates S'g, then it is null-homologous. If t does not separate S'g, then it is indivisible in homology. (To show this, we can appeal to the classification of surfaces by cutting S'g along t. The classification implies that all non-separating positions for I are equivalent up to homeomorphism of S'g. It is easy to find a standard position for i in which it is indivisible in homology.) Thus it remains to show that no obstructing loop is null-homologous. First, we claim that any obstructing loop t can be supported on fewer than 4g edges of the 1-skeleton of S'g. We homotop the two segments of t to the boundaries of the 2-cell containing them, giving them each at most 2g edges. Thus I is represented by a sequence of at most 4g edges in S'g. The case of exactly 4g edges does not occur, since the endpoints of the loop coincide, and no two vertices v ^ v' of S' are opposite vertices in two different facets Fs. As in Lemma 12, this follows from the fact that for v,v' 6 F f f , v / v': there are unique s 6 ¥ q and k 6 Z/(4p) with ak - I , ak+29 - 1 v — s -\ —. a —1 a —I Second, we claim that any null-homologous loop in the 1-skeleton of S'g contains at least 4# edges. In other words, if / is a 2-chain on S'g and df •£ 0, then \df\ > 4g. Since S'g is orientable, we can regard / as a function on its 2-cells. Since / is non-constant, it attains some value t on k 2-cells with
v = sH
FAT 4-POLYTOPES AND FATTER 3-SPHERES
261
0 < k < q. Since any two 2-cells share an edge by Lemma 12, these 2-cells share k(q — k) > 4# edges with the complementary set of 2-cells, of which there are q — k. Since df is non-zero on these edges, \df\ > 4#, as desired. D Proof of Theorem 13. In brief, S'g has fewer than 64g4 obstructing loops t. For each one,
The expected number of obstructing loops that lift from S'g to Sg without lengthening is less than 64p4/n < ^. Thus there is a good chance that all obstructing loops lengthen. The homology group H\(S'g] is a finitely generated free abelian group: It is isomorphic to Z r f , for d = l + q(g — l). Thus it admits nd homomorphisms p to Z /n. Since this is a finite number, choosing one uniformly at random is well-defined. If c is any indivisible vector in Z d, then it is contained in a basis, and thus p(c) is equidistributed. In particular, if t is an obstructing loop, then [£] is indivisible by Lemma 14, so p([i]) is equidistributed in Z /n. It remains only to bound the number of obstructing loops in S'g. A star st(t> ) in Sg has 4#(4g— 2) points other than v itself. Without loss of generality, v projects to 0 in S'g. In this case the other vertices are equidistributed among the 4g non-zero elements of ¥ q. Therefore st(v) has 2
)
4 g (4(?-2)(4<7-3) 2
pairs of arcs connecting v to two vertices that are the same in S'g. These pairs represent all two-segment obstructing loops that pass through 0 and a nonzero vertex v1 (and some of these loops are homotopic). If we count such pairs of arcs for any pair of distinct vertices v, v' of S'g, then we find that the total number is not more than '-2\ (4<7 + l)4<7(4<7-2)(4(7-3) 2 ) 4 as desired. D Question 15. For each g > 1, what is the maximum fatness of a strongly regular cellulation of a surface of genus g ? Equivalently, how many edges are needed for a strongly regular cellulation of a surface of genus g ? Remark. One interesting alternative to the construction of 5' is to assume instead that q = 4g — 1 is a prime power, and to let a be an element of order 4g in F Q 2. The resulting g2-fold cover S" is almost strongly regular: the
262
EPPSTEIN, KUPERBERG AND ZIEGLER
only obstructing loops are those that are null homologous in Sg. Another interesting surface is the modular curve X(1p], where p is a prime [25, §13]. The inclusion T(2p) C F(2) of modular groups induces a projection from X(2p) to the modular curve X ( 2 ] , which is a sphere with three cusp points. If we connect two of these points by an arc which avoids the third, it lifts to a cellulation of X(2p) with /-vector (p2 — 1, P'P2~'1\ P-^L). Like Sg, it has a few obstructing loops. Unfortunately we do not know a way to use either Sg or X(2p) to make fat surfaces of lower genus (or equivalently fewer cells) than Sg. Since Theorem 13 provides us with efficient fat surfaces Sg, the construction of fat cellulations of S3 only requires efficient cellulations of the handlebodies H\ and HI and an efficient way to attach them to Sg. In our construction the handlebody cellulations are a priori unrelated to the cellulation of Sg. Rather they are transverse after attachment, and each point of intersection will become a new vertex. Thus the question is to position the cellulations to minimize their intersection. We describe the cellulations in three stages: first, a dissection of H\ and H<2 individually into 3-cells; second, their relative position; and third, their position relative to the cellulation of Sg. Let y be the genus of Sg. A handlebody H of genus g can be formed by identifying g pairs of disks on the surface of a 3-cell. The result is a dissection of H into g 2-cells and one 3-cell, although it is not a cell complex because there are no 1-cells or 0-cells. We can still ask whether such a dissection is regular or strongly regular; this one is neither. However, if we replace each 2-cell by 3 parallel 2-cells, it becomes strongly regular. An example of the resulting dissection A is shown in Figure 12.
FIGURE 12. A strongly regular dissection A of a handlebody of genus 2. The surface 5^ (which for our choice of "g is isomorphic to Sg) has another standard perfect cellulation called a canonical schema in the computer science literature [31]. Using the labelling in Figure 8, we identify x4k
FAT 4-POLYTOPES AND FATTER 3-SPHERES
263
with %4k+2 (the even loops), and x
n=
=
Thus, by tripling the edges of the canonical schema in the Vegter- Yap construction, we can position A\ and A% so that the lean ends in the sausage have O(12) vertices. If we give the fat part of the sausage N — g12 slices, the total /-vector of the cellulation of S3 is then
and its fatness is Q(g}. This completes the efficient construction with unbounded fatness.
REFERENCES [1] David Barnette, Inequalities for f -vectors of 4-poly topes, Israel J. Math. 11 (1972), 284-291. [2] Margaret M. Bayer, The extended f -vectors of 4-poly topes, J. Combinatorial Theory Ser. A 44 (1987), no. 1, 141-151. [3] Margaret M. Bayer and Louis J. Billera, Generalized Dehn-Sommerville relations for polytopes, spheres and Eulerian partially ordered sets, Inventiones Math. 79 (1985), no. 1, 143-157. [4] Louis J. Billera and Carl W. Lee, A proof of the sufficiency of McMullen's conditions for f -vectors of simplicial convex polytopes, J. Combin. Theory Ser. A 31 (1981), no. 3, 237-255. [5] Bela Bollobas, Extremal graph theory, Handbook of Combinatorics (R. Graham, M. Grotschel, and L. Lovasz, eds.), NorthHolland/Elsevier, Amsterdam, 1995, pp. 1231-1292. [6] Tom Braden, A glued hypersimplex, 1997, Personal communication. [7] John H. Conway and Neil J. A. Sloane, Sphere packings, lattices and groups, 3rd ed., Grundlehren der mathematischen Wissenschaften, vol. 290, Springer- Verlag, New York, 1993.
264
EPPSTEIN, KUPERBERG AND ZIEGLER
[8] Harold Scott MacDonald Coxeter, Regular polytopes, 2nd ed., Macmillan, New York, 1963, Corrected reprint, Dover, New York 1973. [9] Herbert Edelsbrunner and Micha Sharir, A hyperplane incidence problem with applications to counting distances, Applied geometry and discrete mathematics: The Victor Klee Festschrift (P. Gritzman and B. Sturmfels, eds.), DIM ACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4, Amer. Math. Soc., Providence, RI, 1991, pp. 253-263. [10] Paul Erdos, tfber die Primzahlen gewisser arithmetischer Reihen, Math. Z. 39 (1935), 473-491. [11] Gabor Fejes Toth, Greg Kuperberg, and Wlodzimierz Kuperberg, Highly saturated packings and reduced coverings, Monatsh. Math. 125 (1998), no. 2, 127-145. [12] William Fulton, Algebraic topology. A first course, Graduate Texts in Mathematics, vol. 153, Springer-Verlag, New York, 1995. [13] Branko Griinbaum, Convex polytopes, Interscience, London, 1967. [14] Andrea Hoppner and Giinter M. Ziegler, A census of flag-vectors of ^-polytopes, Polytopes — combinatorics and computation (G. Kalai and G.M. Ziegler, eds.), DMV Seminars, vol. 29, Birkhauser-Verlag, Basel, 2000, pp. 105-110. [15] Birger Iversen, Hyperbolic geometry, London Math. Soc. Student Texts, vol. 25, Cambridge University Press, Cambridge, 1992. [16] Michael Joswig and Giinter M. Ziegler, Neighborly cubical polytopes, Discrete Comput. Geom. 24 (2000), no. 2-3, 325-344, arXiv:math.CO/9812033. [17] Tamas Kovari, Vera T. Sos, and Pal Turan, On a problem of K. Zarankiewicz, Colloq. Math. 3 (1954), 50-57. [18] Greg Kuperberg and Oded Schramm, Average kissing numbers for noncongruent sphere packings, Math. Res. Lett. 1 (1994), no. 3, 339-344, arXiv:math.MG/9405218. [19] A. I. Mal'cev, On the faithful representation of infinite groups by matrices, Amer. Math. Soc. Transl. (2) 45 (1965), 1-18. [20] Joseph Malkevitch, Tiling convex polygons with equilateral triangles and squares, Discrete Geometry and Convexity (J. E. Goodman, E. Lutwak, J. Malkevitch, and R. Pollack, eds.), Ann. New York Acad. Sci., vol. 440, New York Academy of Sciences, 1985, pp. 299-303. [21] Peter McMullen, The numbers of faces of simplicial polytopes, Israel J. Math. 9 (1971), 559-570. [22] James R. Munkres, Elements of algebraic topology, Addison-Wesley, Menlo Park, CA, 1984. [23] Janos Pach and Pankaj K. Agarwal, Combinatorial geometry, J. Wiley and Sons, New York, 1995.
FAT 4-POLYTOPES AND FATTER 3-SPHERES
265
[24] Egon Schulte, Analogues of Steinitz's theorem about non-inscribable polytopes, Intuitive geometry (Siofok 1985) (Amsterdam), Colloquia Soc. Janos Bolyai, vol. 48, North Holland, 1987, pp. 503-516. [25] Joseph H. Silverman, The arithmetic of elliptic curves, Graduate Texts in Mathematics, vol. 106, Springer-Verlag, New York, 1986. [26] Richard P. Stanley, The number of faces of a simplicial convex polytope, Adv. in Math. 35 (1980), no. 3, 236-238. [27] , A survey of Eulerian posets, Polytopes: abstract, convex and computational (Scarborough, ON, 1993), NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., vol. 440, Kluwer Acad. Publ., Dordrecht, 1994, pp. 301-333. [28] Ernst Steinitz, Uber die Eulerschen Polyederrelationen, Archiv fur Mathematik und Physik 11 (1906), 86-88. [29] John Stillwell, Classical topology and combinatorial group theory, 2nd ed., Graduate Texts in Mathematics, no. 72, Springer-Verlag, 1993. [30] William P. Thurston, Three-dimensional geometry and topology, vol. I, Princeton University Press, Princeton, NJ, 1997. [31] Gert Vegter and Chee K. Yap, Computational complexity of combinatorial surfaces, Proc. 6th ACM Symp. Comp. Geom., ACM Press, 1990, pp. 102-111. [32] Ernest B. Vinberg, Hyperbolic reflection groups, Russian Math. Surveys 40 (1985), 31-75. [33] William Waite, Combining squares and triangles, Cubism for Fun 53 (2000), 18-22. [34] David W. Walkup, The lower bound conjecture for 3- and 4-manifolds, Acta Math. 125 (1970), 75-107. [35] Giinter M. Ziegler, Lectures on polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, New York, 1995, Revised edition, 1998. E-mail address: eppsteinQics.uci.edu ''David Eppstein'' E-mail address: gregQmath.ucdavis.edu ''Greg Kuperberg'' E-mail address: zieglerOmath.tu-berlin.de ''Giinter M. Ziegler''
ARBITRARILY LARGE NEIGHBORLY FAMILIES OF CONGRUENT SYMMETRIC CONVEX 3-POLYTOPES
JEFF ERICKSON1 Department of Computer Science, University of Illinois, Urbana, IL 61820 SCOTT KIM P.O. Box 2499, El Granada, CA 94018
ABSTRACT. We construct, for any positive integer n, a family of n congruent convex polyhedra in IR3, such that every pair intersects in a common facet. Our polyhedra are Voronoi regions of evenly distributed points on the helix (i,cost,sint). The largest previously published example of such a family contains only eight polytopes. With a simple modification, we can ensure that each polyhedron in the family has a point, a line, and a plane of symmetry. We also generalize our construction to higher dimensions and introduce a new family of cyclic polytopes.
1. INTRODUCTION AND HISTORY A family of
268
ERICKSON AND KIM
a convex hull edge; the Schlegel diagram of the polar dual of any neighborly 4-polytope consists of a neighborly family of 3-polytopes. Neighborly polytopes were discovered by Caratheodory [7], who showed that the convex hull of any finite set of points on either the moment curve (£, £2, t 3 , . . . , td) 6 IRd or the trigonometric moment curve (cos £, sin i, cos 2t, sin 2 £ , . . . , cos kt, sin kt) 6 IR is a neighborly polytope. Caratheodory's proof was later simplified by Gale [13], who called these polytope families the cyclic polytopes and the Petrie polytopes, respectively, and showed that the two families are combinatorially equivalent. Cyclic polytopes were independently rediscovered by Motzkin [21, 16] and Saskin [23], among others. For further discussion of neighborly and cyclic polytopes, see Griinbaum [15] and Ziegler [32]. Dewdney and Vranch [10] showed that the Voronoi diagram of the integer points {(£,t 2 ,t 3 ) | t — 1,2, . . . , n } form a neighborly family of unbounded convex polyhedra. Klee [18] derived a similar result for any set of evenly distributed points on the trigonometric moment curve in even dimensions four and higher. Seidel [25] observed that for any d > 3, Descartes' rule of signs2 implies that any finite set of points on the positive branch of the ddimensional (polynomial) moment curve has a neighborly Voronoi diagram. More generally, the vertices of any neighborly polytope have a neighborly Voronoi diagram, since the endpoints of any polytope edge have neighboring Voronoi regions. Zaks [29] described a general procedure to modify any neighborly family of unbounded polyhedra of any dimension, where each polyhedron contains an unbounded circular cone, so that the resulting polytopes are symmetric about a flat of any prescribed dimension. Danzer, Griinbaum, and Klee [9] asked if there is a largest neighborly family of congruent polytopes. Zaks (with Linhart) [29] observed that Klee's Voronoi diagram of evenly distributed points on the trigonometric moment curve forms a neighborly family of congruent convex polyhedra in even dimensions four and higher, but left the three-dimensional case open. The largest previously published neighborly family of congruent 3-polytopes, discovered by Zaks [30], consists of eight triangular prisms. According to Croft, Falconer, and Guy [8, Problem E7], this was also the largest known collection of congruent convex bodies in IR3 with the property that every pair has even one (distinct) point of contact. Both Zaks [30] and Croft, Falconer, and Guy [8] conjectured that the largest neighborly family of congruent 3polytopes is finite (see also Moser and Pach [20, Problem 55]). In Section 2, we show that this conjecture is incorrect, by giving a constructive proof of the following theorem. 2 The number of real roots of a polynomial is no more than the number of sign changes in its degree-ordered sequence of non-zero coefficients.
LARGE NEIGHBORLY FAMILIES OF CONGRUENT 3-POLYTOPES
269
Main Theorem. For any positive integer n, there is a neighborly family of n congruent convex 3-poly topes. Like the earlier constructions of Dewdney and Vranch [10] and Zaks and Linhart [30], our construction is based on the Voronoi diagram of a set of points on a curve, namely the regular circular helix h(t) = (t, cos t, shit). An example of our construction is shown in Figure 1, and a single poly tope in our family is shown in Figure 3.
(a
(b)
FIGURE 1. (a) A neighborly family of sixteen congruent convex polytopes. (b) An exploded view of the same family. Our neighborly family (or a linear transformation thereof) was discovered in the late 1980s by the second author, who was inspired by the way playing cards overlap when they are fanned. However, except for a brief announcement by Gardner [14] (which was unnoticed by most of the mathematics community), the construction was never published. The same construction was independently discovered by the first author in 2001, as a result of his research on the complexity of three-dimesnional Voronoi diagrams [12]. In Section 3, we generalize our Main Theorem to higher dimensions, by constructing an arbitrarily large family of congruent convex polytopes in IRd, any ("rf/2~| of which share a unique common boundary face. We also introduce a new family of cyclic polytopes, generalizing both the classic cyclic polytopes and the Petrie polytopes.
2. THE MAIN THEOREM Our construction relies on the following observation, independently discovered by Bochis. and Santos [6, Lemma 4.2] (generalizing their earlier proof of a special case [5, Lemma 2.8]) and the author [12, Lemma 2.1]. We include the proof here for the sake of completeness.
270
ERICKSON AND KIM
Lemma 1. Let /3(t) denote the unique sphere passing through h(t) and h(—t) and tangent to the helix at those two points. For any 0 < t < TT, the sphere j3(t) intersects the helix only at its two points of tangency. Proof. Since a 180° rotation about the y-axis maps h(t) to h(—t) and leaves the helix invariant, the bitangent sphere f3(i] must be centered on the yaxis. Thus, (3(t) is described by the equation x2 + (y — a)2 + z2 — r2 for some constants a and r. Let 7 denote the intersection curve of (3(t) and the cylinder y2 + z2 = 1. Every intersection point between /3(t) and the helix must lie on this curve. If we project the helix h and the intersection curve 7 to the xy-plane, we obtain the sinusoid y = cos x and a portion of the parabola y — 7(0;) = (x2 — r2 + a2 + l)/2a. These two curves meet tangentially at the points (t,cost) and (—t,cost). See Figure 2.
FIGURE 2. The intersection curve of the cylinder and a bitangent sphere projects to a parabola on the xy-plane. The mean value theorem implies that the equation 7(0;) = cosx has at most four solutions in the range —TT < x < TT. (Otherwise, the curves y" — — cosx and y" = j"(x) = I/a would intersect more than twice in that range.) Since the curves meet with even multiplicity at two points, those are the only intersection points in the range — TT < x < TT. Since 7(2;) is concave, we have 7(±7r) < COS±TT = —1, so there are no intersections with \x > TT. Thus, the curves meet only at their two points of tangency. D Lemma 1 immediately implies that the Voronoi diagram of any finite set of points on the helix (t, cos t, sint) in the range —IT < t < TT is a neighborly collection of unbounded convex polyhedra. To obtain a neighborly family of congruent polyhedra, we use the Voronoi diagram of evenly spaced points on the helix. For any positive integer n, let hn(t) = h(1iTt/n} and let l-in denote the infinite point set {hn(t} \ t G 2}. By Lemma 1, the Voronoi regions of any n +1 consecutive points in Hn form a neighborly family of convex bodies. Since the point set Hn is preserved by the rigid motion / 2yr 2?r ITT 2?r 2?r\ (x, y. z) f-» \ x -\ , y cos z sm —, y sm h z cos — , V n n n n nJ
LARGE NEIGHBORLY FAMILIES OF CONGRUENT 3-POLYTOPES
271
which maps each point hn(t) to its successor hn(t +1), these Voronoi regions are all congruent. The following more refined analysis of the Delaunay triangulation of "Hn, reminiscent of Gale's 'evenness condition' for cyclic polytopes [13, 24], implies that these Voronoi regions have only a finite number of facets, and thus are actually polyhedra. Lemma 2. For any integers a < b < c < d, the points hn(a), hn(b),hn(c), hn(d) are vertices of a simplex in the Delaunay triangulation of 1-Ln if and only if b — a = d — c = l and d — a < n. Proof. Call a tetrahedron with vertices hn(a), hn(b), hn(c), hn(d] local if 6 — a = d — c = I and d — a < n. Let a be the sphere passing through the vertices of an arbitrary local tetrahedron. Analysis similar to the proof of Lemma 1 implies that the only portions of the helix that lie inside a are the segments between hn(a) and hn(b) and between hn(c) and hn(d). Thus, all other points in Hn lie outside cr, so the four points form a Delaunay simplex. The local Delaunay simplices exactly fill the convex hull of Hn, and therefore comprise the entire Delaunay triangulation. Specifically, the only triangles that are facets of exactly one local tetrahedron have vertices hn(i), hn(i + l),hn(i + n) or hn(i — n + l),/i n (z'),/i n (i + 1) for some integer i. Thus, a tetrahedron is Delaunay if and only if it is local. D In light of the duality between Delaunay triangulations and Voronoi diagrams, Lemma 2 lets us exactly describe the combinatorial structure of the Voronoi regions of T-Ln. Let Vn(t) denote the Voronoi region of hn(t). This polyhedron has exactly 2n facets, in n symmetric pairs, as follows: • two unbounded (In — l)-gons shared with Vn(t ± 1), each bounded by 2n — 3 segments and two parallel rays; • two triangles shared with Vn(t ± 2); • 2n — 8 bounded quadrilaterals shared with Vn(t ± 3), Vn(t ± 4 ) , . . . , Vn(t±(n-1}}• two unbounded quadrilaterals shared with Vn(t±(n—1)), each bounded by two line segments and two parallel rays; • two wedges in parallel planes shared with Vn(t ± n), each bounded by a pair of rays. The two (2n — l)-gons are adjacent to all the other facets, including each other, and contain all the vertices of Vn(t); otherwise, the facets are adjacent in sequence. See Figure 3. The vertex of Vn(Q) furthest from the x-axis is the center of the sphere through the points /i ft (0), hn(l], hn(n — 1), and hn(n); this point has coordinates (TT, (2vr - 9)9/(2 - 2 cos 9), 0), where 9 = IK/H. Thus, all the Voronoi vertices of Hn lie in a cylinder of radius (2yr — 0)9/ (2 — 2 cos 0) w n — 1 around
272
ERICKSON AND KIM
FIGURE 3. (a) One polytope in the neighborly family of sixteen shown in Figure 1. (b) An orthographic edge-on view of the same polytope. the x-axis. To transform our neighborly family of unbounded polyhedra into a neighborly family of polytopes, we intersect each Voronoi region Vn(t) with the halfspace ycos(2Trt/n) + zsin(2?rt/n) < n, which contains some positive area of every facet of Vn(t). This completes the proof of the Main Theorem. Zaks [31] describes an alternate proof, based entirely on the neighborliness of the Voronoi regions of l-Ln. For each integer 1 < t < n, place a triangle on the shared boundary facet between Vn(Q) and Vn(i). Now place congruent copies of these triangles on the boundary of every Voronoi region, so that the entire collection has the same screw symmetry as "Hn. Finally, for any integer t, let Cn(t) be the convex hull of the triangles on the boundary of Vn(t). The n + 1 congruent convex poly topes C n (0), Cn(l),..-, Cn(ri) form a neighborly family. To actually construct our neighborly family (or Zaks'), it suffices to compute the Voronoi diagram of the finite point set {hn(t} \ t = 0 , 1 , . . . , 3n} and then consider only the Voronoi regions of the middle n + 1 points hn(n), hn(n + 1 ) , . . . , hn(1n — 1), /i n (2n), since those Voronoi regions are the same as in the infinite point set %n. Figure 1 was computed using this method. Since a 180° rotation about the y-axis maps each point hn(t) to hn(—t), and thus preserves the point set Hn, the Voronoi region Vn(0) is rotationally symmetric about the y-axis. It immediately follows every Voronoi region of T-Ln has a line of 180° rotational symmetry. Clipping each Voronoi region by an additional halfspace as above retains this symmetry, since the clipping plane is normal to the symmetry axis. We can create a neighborly family of congruent polytopes with additional symmetries by taking the union of each clipped Voronoi region and its reflection across its clipping plane. Each
LARGE NEIGHBORLY FAMILIES OF CONGRUENT 3-POLYTOPES
273
resulting polytope clearly has bilateral symmetry about its clipping plane and 180° symmetry about the original Voronoi region's axis of symmetry, and therefore is centrally symmetric about the intersection point of the clipping plane and the symmetry axis. Theorem 3. For any integer positive integer n, there is a neighborly family of n congruent convex 3-polytopes, each with a plane of bilateral symmetry, a line of 180° rotational symmetry, and a point of central symmetry.
3. HIGHER DIMENSIONS A family of convex polyhedra in Rd is (strictly) k-neighborly if any subset of k polyhedra has a (d — k + l)-dimensional intersection, and no subset of k + l poly topes has a non-empty intersection.3 Arbitrarily large k- neighborly families of polyhedra are easy to construct in H2fc~1, for example, Schlegel diagrams of dual cyclic 2fc-polytopes [7, 13] or Voronoi diagrams of points on the moment curve [25]. However, arbitrarily large k-neighborly families of congruent polyhedra were previously only known in dimensions Ik and higher. The lowest-dimensional example is based on the Voronoi diagram of evenly distributed points on the trigonometric moment curve [18, 29] together with the origin (since otherwise the origin is on the boundary of every Voronoi polyhedron). In this section, we generalize our three dimensional results by considering regularly spaced points on the following generalized helix: h>k(t] = (t, cosi, sini, cos2i, sin2t, . . . , cosfct, sinfct) G JR2k+l. Theorem 4. Let P be any finite set of points on the curve hk(t) in the range 0 < t < 2-7T, for some non-negative integer k. The Voronoi diagram of P is a (k + 1) -neighborly family of convex polyhedra in H2fc+1. Proof. Consider the sphere a passing through k + l arbitrary points /ifc(ao), ^fc(oi), - . . , hk(a>k} € P and tangent to the generalized helix at those points, where 0 < OQ < ai < • • • < a& < 2?r. Any point hk(t) that lies on a satisfies the following (2A; + 3) x (2k + 3) matrix equation:
3
The second condition is necessary to rule out degenerate constructions such as the product of a (d — 2)-dimensional cube with n congruent planar wedges.
ERICKSON AND KIM
274
1 ao cos ao sin ao 01— s i n a o c o sa o 1 0,1 cosai sinai 0 1 — sinai cosai
0 1
1 t
sna^ — sina/c cosa^ cos t sin t
cos ka,Q -ksinkdQ cos ka\
-ks'mkai
sin ka,Q k cos kaQ sin ka\ k cos ka\
cos kak -ks'mkttk coskt
sin kak k cos kak smkt
k + OQ 2a0 k + a\ 2ai
=0
£ + «it 2afc A; + t2
(Each of the even rows of this matrix is the derivative of the preceding row. To bound the number of zeros of F(t), consider its second derivative
F"(t) =
OQ 0 1 1 ai 0 1 ak 01— 00—
cosao —sinao cosai —sinai
sinao cosao sinai cosai
cos a/; sinak cos a^ c o s t —s i n t
cos kdQ —ks'mkdQ
—ks'mkai
sin kaQ k cos kdQ sinfcai kcoskai
cos kak —ksinkak —k^coskt
kcoskak —k^s'mkt
k + ag 2ao k + a\ 2ai
F"(t) is an affine combination of the functions cost, sin t, cos2t,sin2i, . . . , cosfc£,sinA;£, so it can be rewritten as as a polynomial of degree at most 2k in the variable elt. Thus, F"(t) has at most 2k zeros in the range 0 < t < 2?r. (This is essentially the argument used by Caratheodory to show that Petrie poly topes are neighborly [7].) Since ao, ai, . . . , a& are roots of F(t) of multiplicity two, they are the only roots in the range 0 < t < 2-Tr; otherwise, by the mean value theorem, F"(k] would have more than 2k roots in the range 0 < ao < t < a^ < 27r, which we have just shown to be impossible. Thus, the points hk(ao),hk(ai), . . . , hk(ak) h'e °n a sphere that excludes every other point in P and so have mutually neighboring Voronoi regions. D In fact, Theorem 4 is a special case of the following result, which follows from an easy generalization of the previous proof and Gale's evenness condition for cyclic polytopes [13, 24]. Define the mixed moment curve /J>d,k(t) as follows: ,k (t) = (t, t2 , . . . , td, cos t, sin t, cos 2t, sin 2*, . . . , cos Art, sin kt) G
For example, ^d,o(t) is the standard o'-dimensional moment curve, /io,jfc(£) is the 2fc-dimensional trigonometric moment curve, and p>\,k(t} is our generalized helix.
LARGE NEIGHBORLY FAMILIES OF CONGRUENT 3-POLYTOPES
275
Theorem 5. For any non-negative integers d and k, the convex hull of any finite set of points on the curve p>d,k(t) in the range 0 < t < In is a (d + 2k)dimensional cyclic polytope. Not surprisingly, we obtain arbitrarily large highly-neighborly families of congruent polytopes by considering the Voronoi diagram of the infinite evenly-spaced point set H^ = {hk(27rt/n) \ t 6 7L\. Theorem 6. For any non-negative integers n and k, any n + 1 consecutive Voronoi regions in the Voronoi diagram of 1-L^ form a (k + l)-neighborly family of congruent convex polyhedra. Proof. Fix an integer n. To simplify notation, let h(t) = hk(2-rrt/n), and let (ti, £2, • • • , tr) denote the convex hull of the points ft(£i), ft(<2), • • • > n(tr}Since the set 'H^ = {fi(t) \ t G 2} is preserved under a rigid motion mapping each point h(t) to its successor h(t + 1), the Voronoi regions of H^ are all congruent. Call a full-dimensional simplex with vertices in T-L^ local if all its vertices consist of k + 1 adjacent pairs within a single turn of the generalized helix; in other words, every local simplex has the form (a0, ao + 1, ai, ai + 1, • • • , afc, ak + 1}
for some integers ao, a\ , . . . , a& with a^ + l < ao+n and a^ + 1 < ai+i for all i. Analysis similar to Theorem 4 implies that every local simplex is Delaunay. The convex hull of %*, which we will call the Petrie cylinder, is the product of an 2fc-dimensional Petrie polytope with n vertices and a line orthogonal to that polytope's hyperplane. By Gale's evenness condition [13, 24], the facets of the Petrie polytope are formed by all sets of k adjacent pairs of points on the trigonometric moment curve. The faces of the Petrie cylinder are cylinders over the faces of the Petrie polytope. Call a facet of a local simplex that is not shared by another local simplex a boundary simplex. We easily observe that the boundary simplices are exactly the 2A:-simplices with one of the following two forms: (ak - n + 1, 01, ai + 1, a2, o2 + 1, . . . , ak, ak + 1}
(ai, ai + 1, 02, a2 + 1, . . . , ajt, a^ + 1, 01 + n)
The following infinite sequence of boundary simplices exactly covers one facet of the Petrie cylinder.
276
ERICKSON AND KIM
- n + 1,01,01 + 1,02, 02 + 1, • • • ,ak,ak + 1) 1,02,02 + l,...,a/fc,0fc + l,ai + n) 1, 02, a.2 + 1, . . . ,flfc,Ofc + 1, ai + n, ai + n + 1) (a2, 02 + 1, • • • , Ofc, Ofc + 1, ai + n, ai + n02++1, n) Every facet of the Petrie cylinder is covered in this manner, and every boundary simplex lies on some facet of the Petrie cylinder. Thus, the union of the boundary facets is the boundary of the Petrie cylinder, so the local Delaunay simplices completely fill the Petrie cylinder and therefore comprise the entire Delaunay triangulation. It easily follows that each Voronoi region of T-L^ is a convex polyhedron with Q(nk) facets, and that any n + 1 consecutive Voronoi regions form a (A; 4- l)-neighborly family. As we already observed, these polyhedra are congruent. D We can easily modify our construction to obtain a (fc+l)-neighborly family of polytopes, by intersecting each Voronoi region with a halfspace strictly containing all its vertices. Each Voronoi region of H^ has a fc-flat of two-fold symmetry. As long as the boundary of the new halfspace is perpendicular to this central A>flat, the resulting polytope is also symmetric about this flat. Using a variant of Zaks' symmetrization procedure [29], we can ensure that each polytope is also symmetric about a flat of any specified dimension. Consider the Voronoi region V of h(0) in the Voronoi diagram of H^- Let p be the ray from the origin through /i(0), let 0+ and >~ denote the supporting hyperplanes of the only two parallel facets of V (shared with the Voronoi regions of h(n) and h(—n)), and let TT be a hyperplane normal to p at sufficient distance from the origin. Finally, let / be any flat that lies in TT, contains the point p D TT, and is either parallel or perpendicular to both >+ and (f>~ . The intersection of V and its reflection across / is a convex polytope that is obviously symmetric about / and whose boundary contains positive measure from every boundary facet of V. Applying this procedure to any n + 1 consecutive Voronoi regions of T-L^ we obtain our final result. Theorem 7. For any non-negative integers k, n, and r < 2k, there is a (k + l) -neighborly family ofn+l congruent convex polytopes mIR +1, each of which is symmetric about an r-flat. Acknowledgments. Thanks to Joseph Zaks for his insightful comments on an early draft of this paper, and to Victor Klee for sending a copy of his paper [18]. Figures 1 and 3 were produced with the help of the programs 'qhull' [2, 3] and 'geomview' [1, 19].
LARGE NEIGHBORLY FAMILIES OF CONGRUENT 3-POLYTOPES
277
REFERENCES [1] N. Amenta, S. Levy, T. Munzner, and M. Philips. Geomview: A system for geometric visualization. Proc. llth Annu. ACM Sympos. Comput. Geom., (1995), C12-C13. [2] C. B. Barber, D. P. Dobkin, and H. Htmdanpaa. The QUICKHULL algorithm for convex hulls. ACM Trans. Math. Softw., 22 (1996), 469-483. [3] C. B. Barber and H. Huhdanpaa. Qhull, version 3.0, February 2000. (http://www.geom.umn.edu/software/qhull/). [4] A. S. Besicovitch. On Crum's problem. J. London Math. Soc., 22 (1947), 285-287. [5] D. Bochi§ and F. Santos. On the number of facets of Dirichlet stereohedra I: Groups with reflections. Discrete Comput. Geom., 25 (2001), 419-444. [6] D. Bochis. and F. Santos. On the number of facets of Dirichlet stereohedra II: Non-cubic groups. Preprint, April 2002. arXiv:math. CO/0204231. [7] C. Caratheodory. Uber den Variabilitatsbereich der Fourier'schen Konstanten von positiven harmonischen Funktionen. Rendiconto del Circolo Matematico di Palermo, 32 (1911), 193-217. [8] H. P. Croft, K. J. Falconer, and R. K. Guy. Unsolved Problems in Geometry. Springer-Verlag, 1991. [9] L. Danzer, B. Grunbaum, and V. Klee. Kelly's theorem and its relatives. Convexity, pp. 101-180. Proc. Symp. Pure Math., vol. VII, Amer. Math. Soc., 1963. [10] A. K. Dewdney and J. K. Vranch. A convex partition of -R3 with applications to Crum's problem and Knuth's post-office problem. Utilitas Math., 12 (1977), 193-199. [11] H. G. Eggleston. On Rado's extension of Crum's problem. J. London Math. Soc., 28 (1953), 467-471. [12] J. Erickson. Nice point sets can have nasty Delaunay triangulations. Proc. 17th Annu. ACM Sympos. Comput. Geom. (2001), 96-105. arXiv: cs.CG/0103017. [13] D. Gale. Neighborly and cyclic polytopes. Convexity, pp. 225-232. Proc. Symp. Pure Math., vol. VII, Amer. Math. Soc., 1963. [14] M. Gardner. Pool-ball triangles and other problems. Chapter 9 of Penrose Tiles to Trapdoor Ciphers, pp. 119-136. W. H. Freeman, 1989. [15] B. Griinbaum. Convex Polytopes. John Wiley & Sons, New York, NY, 1967. [16] B. Griinbaum and T. S. Motzkin. On polyhedral graphs. Convexity, pp. 285-290. Proc. Symp. Pure Math., vol. VII, Amer. Math. Soc., 1963. [17] F. Guthrie. Proc. Royal Soc. Edinburgh, 10 (1878-1880), 728.
278
ERICKSON AND KIM
[18] V. Klee. On the complexity of d-dimensional Voronoi diagrams. Archiv der Math., 34 (1980), 75-80. [19] S. Levy, T. Munzner, M. Phillips, C. Fowler, N. Thurston, D. Krech, S. Wisdom, D. Meyer, T. Rowley, and S. M. Robbins. Geomview, version 1.8.1, March 2001. (http://www.geomview.org). [20] W. Moser and J. Pach. Research problems in discrete geometry: Packing and covering. Tech. Rep. 93-32, DIMACS, 1993. [21] T. S. Motzkin. Comonotone curves and polyhedra. Bull. Amer. Math. Soc., 63 (1957), 35. [22] R. Rado. A sequence of polyhedra having intersections of specified dimensions. J. London Math. Soc., 22 (1947), 287-289. [23] K). A. IIIauiKHH [Yu. A. Saskin]. SaMenaHne o coce^rnux Bepiirawax na BLinyKJiOM MHororpanaHHHKe [A remark on adjacent vertices on a convex polyhedron]. Vcnexu MameM. HayK [Uspehi Mat. Nauk], 18 (1963), 209-211. [24] G. C. Shepherd. A theorem on cyclic polytopes. Israel J. Math., 6 (1968), 368-372. [25] R. Seidel. Exact upper bounds for the number of faces in d-dimensional Voronoi diagrams. Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, pp. 517-530. DIMACS Series Discrete Mathematics and Theoretical Computer Science, vol. 4, AMS Press, 1991. [26] P. Stackel. Z. Math. Phys., 42 (1897), 275. [27] H. Tietze. Uber das Problem der Nachbargite im Raum. Monatsh. Math. Phys., 16 (1905), 211-216. [28] H. Tietze. Famous Problems of Mathematics: Solved and Unsolved Mathematical Problems from Antiquity to Modern Times. Graylock Press, New York, 1965. Translation of Geloste und ungeloste mathematische Probleme aus alter und neuer Zeit, 2nd edition, Verlag C. H. Beck, Miinchen, 1959. [29] J. Zaks. Arbitrarily large neighborly families of symmetric convex polytopes. Geom. Dedicata, 20 (1986), 175-179. [30] J. Zaks. Neighborly families of congruent convex polytopes. Amer. Math. Monthly, 94 (1987), 151-155. [31] J. Zaks. Personal communication, April 2001. [32] G. M. Ziegler. Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer-Verlag, Heidelberg, 1994. E-mail address: [email protected] E-mail address: [email protected]
ON THE NON-SOLIDITY OF SOME PACKINGS AND COVERINGS WITH CIRCLES
AUGUST FLORIAN Department of Mathematics, University of Salzburg, Hellbrunnerstrasse 34, Salzburg, Austria, A-5020 ALADAR HEPPES1
Vercse u 24/A, Budapest, Hungary, H-1124
ABSTRACT. An old conjecture of L. Fejes Toth [4] states that the packing (covering) consisting of the incircles (circumcircles) of the faces of an Archimedean tiling is solid if the number of regular polygons meeting at a vertex is 3, and non-solid if this number is greater than 3. The object of the present paper is to survey the state of the second part of this conjecture for the Euclidean and spherical tilings, and to prove it for all cases not settled before.
1. INTRODUCTION A set of open (closed) circles is said to form a packing (covering) on the sphere, or in the Euclidean or hyperbolic plane if every point of the sphere or plane belongs to at most (at least) one circle of the set. Following a concept introduced by L. Fejes Toth [4] we say that a packing (covering) is solid if no finite number of its members can be rearranged so as to form, together with the rest of the members, a packing (covering) not congruent to the original one. A solid packing of equal circles in the Euclidean plane is always a densest packing of equal circles, and similarly for coverings. A solid packing of n equal circles on the sphere is always a densest packing of n equal circles, and similarly for coverings. Note, however, that the converse is not true. Supported in paxt by OTKA T030012 and OTKA T037752 279
280
FLORIAN AND HEPPES
An edge-to-edge tiling consisting of regular polygons is said to be uniform if, for any two vertices, the symmetry group of the tiling contains an operation that maps one vertex onto the other. If all faces of a uniform tiling are congruent, the tiling is regular, otherwise it is called Archimedean. In the present paper, we shall refer to the incircles (circumcircles) of a tiling when we mean the incircles (circumcircles) of the faces of this tiling. L. Fejes Toth observed that the incircles of any trihedral regular tiling {p, 3}, with p > 2, form a solid packing, and the circumcircles of (p, 3}, with p > 2, form a solid covering (see also [14]). Furthermore, he stated the following
Conjectures: (i) The incircles of any trihedral Archimedean tiling form a solid packing. (ii) The incircles of any more-than-trihedral uniform tiling form a non-solid packing. (ni) The circumcircles of any trihedral Archimedean tiling form a solid covering. (iv) The circumcircles of any more-than-trihedral uniform tiling form a non-solid covering. These conjectures triggered intensive research. As the References show, they have been confirmed in many cases. Conjecture (i) has been proved for all trihedral Archimedean tilings in the Euclidean plane and on the sphere. In the case of covering (iii), however, progress is somewhat slow. For example, none of the coverings associated with the Euclidean tilings (3,12,12), (4,8,8) and (4,6,12) is known to be solid. In the present paper we shall be concerned with the non-solidity aspect, i.e., conjectures (ii) and (iv), for all Euclidean and spherical uniform tilings. We shall prove these conjectures in the cases that have remained open until now. The non-solidity of the spherical packings and coverings associated with the Archimedean tilings (3,3,3,3,4), (3,3,3,3,5) (see Figures 1 and 2) and (3,3,3,n), with n > 4 (see Figure 3 for n = 9) seems not to have been proved so far. For the sake of completeness, we will briefly discuss the other, simpler cases, too.
2. THE TILINGS (3,3,3,3,4) AND (3,3,3,3,5) Theorem 1. The incircles of the Archimedean tilings (3,3,3,3,4) and (3,3,3,3,5) form non-solid packings. Theorem 2. The circumcircles of the Archimedean tilings (3,3,3, 3,4) and (3, 3,3, 3,5) form non-solid coverings.
281
NON-SOLIDITY OF SOME CIRCLE PACKINGS AND COVERINGS
Fig. 1
Fig- 3
Fig. 2
These two tilings have similar structures. Both consist of two kinds of regular polygons, one of which is a triangle. The large faces (quadrangles and pentagons, respectively) are concentric with the faces of the spherical net (called the basic net) of a regular polyhedron, that is the cube for (3,3,3,3,4), and the dodecahedron for (3,3,3,3,5). The set of small faces (triangles) can be divided into two subsets. The members of the first subset have their centres at the vertices of the basic net. These will be called vertex triangles. The second subset consists of side-to-side pairs of triangles, each of them sharing a side with a large face. The midpoint of the common side of each pair coincides with the midpoint of an edge of the basic net. These triangles will be referred to as edge triangles. Proof of Theorem 1. The table below shows some parameters of the two associated packings. Let R and r denote the (spherical) radius of the large and the small circles (i.e., the incircles of the large and small faces), respectively. Let d be the (spherical) distance of the midpoints of two adjacent edges of the basic net. Observe that the midpoints of any two edges of the basic net have a distance > d.
R= r = d = 7T/3 =
(3,3,3,3,4)
(3,3,3,3,5)
0.41248 ... 0.23357 ... 1.04719 ...
0.33436 .. 0.13809 ... 0.62831 ..
7T/5
=
We shall show that the incircles of the edge triangles can be rearranged in a "non-congruent" way, which implies that the packing is not solid. Consider the incircles C\ and C
282
FLORIAN AND HEPPES
large circles and the set of incircles of the vertex triangles are symmetric with respect to the plane p, the reflected images of C\ and C<2, say C[ and C^, will not overlap any such circle. Next, we replace C\ and C<2 by C[ and C^, leaving all other circles of the original packing unchanged. To prove that the resulting system is a packing, we have to show that C( and C^ have no point in common with the incircle of any edge triangle belonging to a different edge. Consider the midpoints M' and M" of two edges of the basic net, and two circles with radius r containing M' and M", respectively. Since 4r < d, these two circles are indeed disjoint. It is easy to show that the new packing is not congruent to the original one. The original packing is invariant under rotation about the centre of any large circle of this packing, through the angle 27T/4 and 2?r/5, respectively. This is not true, however, for the circle C^ of the new packing, since the circles C[ and C'2 are different both from C\ and C^. This completes the proof of Theorem 1. D Proof of Theorem 2. In the tilings under consideration, any pair of adjacent edge triangles is enclosed by two large faces and two vertex triangles that have their centres at the endpoints of an edge of the basic net. The edge triangles are partly covered by the circumcircles of the four polygons. The remaining 'hole,' i.e., the uncovered region, is symmetrical about the central plane p containing the edge in question. This means that such a hole is covered not only by the pair of circumcircles of the two edge triangles, but also by their reflection in p. If one such pair is reflected and all other circles are left in their original position, a new covering is generated. This covering is not congruent to the original one, since the reflection destroys the rotatory symmetry of the original covering. D
3. THE TILINGS (3,3,3,n), FOR n > 4 Among Fejes Toth's conjectures (ii) and (iv), the last non-hyperbolic, as yet unverified cases concern the packings and coverings generated by the tilings (3,3,3,n), with n > 4. Our next goal is to prove that these are non-solid sets. A tiling of this sort consists of two large n-gonal faces centred at the "poles" and 2n triangular faces arranged along the "equator". Each triangle is sharing a side with one of the large faces and a single vertex with the other one (see Figure 3). Theorem 3. The packing on the sphere consisting of the incircles of ihr Archimedean tiling (3, 3,3, n) is non-solid for n > 4.
NON-SOLIDITY OF SOME CIRCLE PACKINGS AND COVERINGS
283
Proof of Theorem 3. On the unit sphere with centre O we choose an oriented great circle e, the "equator" , and a point E 6 e. Any point of the sphere will be determined by its "geographic" coordinates (A,/3). The longitude A is measured from the point E on the equator, and the latitude f3 measures the signed distance of the point from e (—-nfl < /3 < Tr/2). By distance we always understand spherical distance. Let R and r denote the radius of the incircles of the n-gons and that of the triangles of the tiling, respectively. We may assume that the large circles have their centres at the poles N (/? = 7T/2) and S (/5 = — Tr/2). The centres of the small circles are located at the vertices of two regular n-gons (of side > 2r) inscribed in two circles GI and C2 of radius R + r having their centres at the poles. In this packing every small circle touches exactly two others and a large one. If the point E is chosen properly, the set of the original centres is symmetrical about the plane A = vr/2 (37T/2), and none of the centres lying on ci is contained in the plane A = 0 (TT). To generate an alternative packing of the same circles, we move the centre of the "upper" large circle from AT to a point N'(Q, Tr/2 — e) and denote the circle with centre N' and radius R + r by c{ . The value of e > 0 is chosen so small that c'x is contained in the hemisphere (3 > 0, i.e., (1)
£<^-(R + r}.
We denote the centres of the small circles lying on c\ by AI (i — 1, . . . , n) such that (2)
0 < \(Ai) <
< X(Am}
We assign to each centre Ai a point A[ e c( with (3)
\(A'i) = \(Ai)
(i = l , . . . , n ) .
If e is sufficiently small, then for each A[ there are two points B[ and D\ on C2, both at distance 1r from A^, where X(B'i) < X(D'i). The region bounded by the arc B^D^ of 02 and the two geodesic arcs B^A'^ A^D^ will be called the quasi-triangle B^A^D^. We shall refer to the arc B^D^ as the base, and to the distance h^ of A't from the midpoint Mi of the base as the height of the quasi-triangle B'^D^. Furthermore, we shall denote the half-length of the base of a quasi-triangle with height h by s(h). It is clear that some of the quasi-triangles in the 'narrow' part of the ring enclosed by c( and 02 overlap. We shall use the following lemma to show that these overlaps can be removed: Lemma. Let r e (0, Tr/4) and (3o e (0, r) be given constants, and let I dc note the interval (00,2r). For every h 6 / there exists (up to congruence) exactly one quasi-triangle BAD with the base BD lying on a circle of radius
284
FLORIAN AND HEPPES
7T/2 — fa, AB = AD = 2r, and a height of length h. The half-length s of the base is a strictly decreasing and strictly concave function of h 6 /. Proof of the Lemma. Let B and D be two points on the circle c with centre S (ft = — 7T/2) and radius ?r/2 — fa. We denote the length of the geodesic arc joining B and D by 2a, where 0 < a < Tr/2. Let A be a point with 0 < /3(A) = f3 < 2r - fa such that AB = AD. We shall show, with an appropriate choice of a, that the quasi-triangle BAD satisfies the requirements of the lemma. Note that the height h of BAD is fa + 0, whence fa < h < 2r. We shall use the following notation: M' for the midpoint of the geodesic arc BD, M" for the midpoint of the straight line segment BD, F for the intersection of the geodesic arc AM' with equator e. The point M" has the normal distance sin fa from the segment OF. Since, furthermore, OM" = cos a and the three points O,M",M' are collinear, we find FM' = arcsin(sin/3o/cosa). Hence AM' = AF + FM' = /3 + arcsin
!^°. cos a
To satisfy the condition AB — 2r, we consider the right (spherical) triangle AM'B. From cosAB = cosBM' • cos AM' we obtain cos2r = cosacos/3\/l
^— — sin (3 sin fa cosz a
or
(4)
cos2r = cos /3\lcos2 a — sin2 fa — sin j3 sin fa.
For a = 7T/2 — fa: the right-hand side of (4) is — sin/? sin fa < cos2r, while for a = 0, the right-hand side of (4) is cos(/5 + fa) > cos2r. Thus (4) has a unique solution a — a((3) £ (0,7r/2 — fa). If we set y cos2 a - sin2 fa = /(/?), then (4) says that (5)
f((3] cos (3 — sin 0 sin fa = const.
Repeated differentiation of (5) yields (6)
-/sin/3 + /'cos/?-cos/3sin^ 0 = 0
and
(7)
-/cos/3-2/'sin/5 + /"cos/3 + sin^sin/5o =0.
NON-SOLIDITY OF SOME CIRCLE PACKINGS AND COVERINGS
285
^From (6) it follows that (8)
/'-sinA) = /tan/3,
which shows that /'(£) > 0
(9)
for 0 < /? < 2r - {fa. Combining (7) with (8) we obtain -/ cos p - f sin 0 - f sin j3 tan /3 + f" cos /3 = 0.
In view of (9), this implies that (10)
f"(fi) > 0.
Because the straight line segment BD has the length 2 sin a and the circle c has the (Euclidean) radius cos/^o, we find for the half-length of the base BD of BAD s
\(0] = cosp\)arcsin (
— I = cos/?o arccos
cos/V
or si COS po
=
f COS 0Q '
Hence
(12)
--
-- cos -V - «i' sin -= /"• cospo cospo cospo Combining (11) and (12) with (9) and (10), we see that
(13)
ai(0)<0,
s'M<0
for 0 < (3 < 2r - /3Q. Since h = (3 + /3Q and s(h) = si(/3), the proof of the lemma is complete. D Proceeding with the proof of Theorem 3, we consider the quasi-triangles B^A'iD't for i = 1,... ,m and recall that 0 < X(A'i) < TT (see (2) and (3)). We first give a lower bound to the sum of the heights h\ + • • • + h'm. If the subscripts i and j ^ i refer to a pair A^Aj symmetric about the half-plane A = 7T/2, then A^N + A'jN is equal to the length of the chord of c( through A'i and N. Since A(A^) is different from 0 and TT, this chord does not contain N'. Consequently, it has a length less than the diameter of c'1: so that
Thus we have
(14)
h'i + h'j = 27r - 1(R + r)- (A'iN + A'jN) > lit - 4(R + r) = 2h0.
286
FLORIAN AND HEPPES
Here
h0 = TT - 2(R + r)
(15)
stands for the constant height of the quasi-triangles generated by the centres of the small circles of the original packing. We denote these quasi-triangles by BiAiDi (i = 1,... ,n) and remark that Dx = Bi+\, and Mi is the common midpoint of the arcs BiDi and B\D\. If A(^) = ?r/2, then A^N < R + r and (16)
tii
= Tr-(R + r)-A'iN>hQ.
Combining (14) and (16), we obtain (17)
til
+ ---+h'm> mhQ.
Next, we will show that the total length of the arcs B^D'^ for i — 1, , . . , m, is less than the total length of the arcs BiD{. To do so, we make use of the lemma by setting /?0 = Tr/2 - (R + r). Observe that r < 0.45769 . . . < ?r/4 for n > 4, and /3$ < r, or, equivalently,
This follows easily from the triangle inequality and the fact that the point of contact of two small circles lies on the equator. Since all points A\ have from N a distance between R + r — e and Tr/2, we have
for i — 1, . . . , m. If we take e < 2(R + 2r — ?r/2), then 7
(18)
^-(R + r)
z*
Thus all assumptions of the lemma are satisfied. By Jensen's inequality in conjunction with (17) we obtain /i r\\ (19)
n
\ / i f \ ^ n " I 2> s(/ij) < 2ms / —
'
'
m
r. fi \ — \ < 2ms(/io),
where 2ras (/IQ) is the total length of the bases of the m quasi-triangles BiA{Di. These bases fit together without gaps or overlaps to form the subarc BiDm of c2. Thus (19) states that m
(20)
In the following, we shall write b\ for the arc B[D'^ s^ for s(/i^) (that is, the half-length of 6'J, and SQ for a(/io)- From (21)
h'l
NON-SOLIDITY OF SOME CIRCLE PACKINGS AND COVERINGS
287
it follows that (22)
s(>S'2>--->s'm
and, by (19),
s'm < 80.
(23)
Let us now move the quasi-triangles B^A^D'^ for i = ra, ra — 1,..., along 02 towards Dm into new positions B"A"D" in such a way that D'^ = Dm and D" — B"+1. Obviously, the new quasi-triangles do not overlap. Setting B"D" — b'l and making use of (20) we see that the union of & " , • • • , b"m is a connected arc B'[Dm whose length is less than B\Dm. Thus (24)
X(B'{) > A(Bi).
If M" denotes the midpoint of 6", then, by (23), (25)
A(AC) > A(M m ).
Furthermore, we will show that (26)
A(Mf) > A(Mi),
for alH = 1, • • • , m — 1 as well. Suppose that (26) is true for i = k + 1, while (27)
A(Afi') < A(Af fc ).
^,From s'k+1 + s'k = M%M%+1 > MAMjf+1 if follows that (28)
^n^+1^0,
and, in conjunction with MkM'f!+l > M^M^+i = 2so, (29)
4+1+4>2s0.
Because s is a decreasing function of /i, inequality (29) implies (30)
s'i+l + s'i > 2s0
for alH < fc, whence
(31)
s( > s0.
^,From (28), (30) and (31) we conclude that the arc BiDm is covered by the union of 6' l 5 ... , 6'fc, &' fc ' +1 ,... , 6^, in contradiction to (20). Thus supposition (27) is wrong and, in view of (25), inequality (26) is proved for 1 < i < m. Note that, as a consequence of (25) and (26), all points -A'/,... ,A'^ lie between c[ and 02On the hemisphere TT < A < 2?r, a similar set of points can be generated by an analogous process. The points A", with m + 1 < i < n, are also contained in the ring between c[ and C2, and the points B" and D" lie on 02, where B'^+l = Bm+i = Dm. Note that, analogously to (24), A(£>") < X(Dn). After dropping one of the endpoints, B" or J9^, we end up with n points on
288
FLORIAN AND HEPPES
the upper hemisphere and a total of n points on the lower hemisphere such that no upper point is closer than 2r to a lower one. Observe that in the above construction the position of the points obtained depends continuously on e. If £ is sufficiently small, the new points are arbitrarily close to the original ones. Therefore, the distance between any pair of upper points is larger than 2r, and similarly for any pair of lower points. To summarize, we can state the following: The 2n circles of radius r with their centres at the points A", B", and the two circles of radius R centred at N' and S, form a packing not congruent to the original one. D Theorem 4. The covering of the sphere consisting of the circumcircles of the Archimedean tiling (3,3,3,n) is non-solid for n > 4. Proof of Theorem 4- Let a be the interior angle of the triangles. We first establish the relation between a and n. If / denotes the edge-length of the tiling, then (32)
I
TT
a
cos-= cos-sin-.
Since three triangles and a single n-gon meet at each vertex of the tiling, we have ,OON
v(33)
'
n
I .
3a
n
2
2
cos — = cos - s i n — .
Combining (32) and (33) we find the required relation sin(3a/2) ^ TT ——.—7-7- = 2 cos — sm(a/2) n or, equivalently. (34)
2 c o s a + l = 2 cos-. n
Let r and R be the circumradius of the triangles and the n-gons, respectively. Then trigonometric formulae yield , _. (35)
a TT 1 /I + cos a cos r = cot — cot — = 2 3 x/3 V 1 - cos a
and .
/
.
7T .
_
sin - = sin — sin R.
2 n Making use of (32) and (34), we finally obtain (36)
,/9
cos a)(3 + 2 cos a)
NON-SOLIDITY OF SOME CIRCLE PACKINGS AND COVERINGS
289
Let KI and K^ be the circles of radius R centred at the poles N and 5. Consider 2n circles of radius r whose centres are equidistantly arranged on the equator. Theorem 4 will be proved by showing that these 2n circles cover the ring between K\ and K^. Let C be one of the circles with centre A. Let 27 be the central angle of the arc on the boundary of K\ covered by C. Obviously, it is sufficient to show that
Let P be a point on the sphere with AP = r and NP = R. Since AN = Tr/2, we have cos r = sin R cos 7. Thus, by (35) and (36), inequality (37) is equivalent to
,orA (38)
/(I + cos a)(3 + 2 cos a) TT ^ >± i
Referring to (34), (38) can be written in the form
I (I + cos a) (3+ 2 cos a) V 6 But this is clearly true, as a > Tr/3. (<39}
<
\/3 + 2 cos a 2 '
D
4. SOME FURTHER UNIFORM TILINGS On the sphere there are six more-than-trihedral uniform tilings not discussed above. Two of them are the regular octahedral {3,4} and the regular icosahedral tiling {3,5}. The Archimedean tilings are (3,4,3,4), (3,5,3,5) (having faces concentric with the faces and vertices of {3,4} and {3, 5}, respectively), (3,4,4,4), and (3,4,5,4) (having faces concentric with the faces, vertices and midpoints of the edges of {3,4} and {3,5}, respectively). We shall show that the incircles and the circumcircles of these tilings form nonsolid sets. In each of the above tilings there is a proper subset of the edges forming the boundary of a regular n-gon II contained in a hemisphere, where n = 4,5,6,10,8 and 10, respectively. Let F\,... , FK be the faces of the tiling composing II. Furthermore, let c\,... , c^ be their incircles, and C\,... ,Ck their circumcircles. The incircle of II contains G I , . . . ,c&, and the circumcircle of II is covered by C i , . . . , C^. If ci,... , c^ (Ci,... , Ck) are rotated about the centre of II through an angle of an (a irrational) and all other circles are left in their original position, we obtain a packing (covering) not congruent to the original one. In the Euclidean plane there are seven more-than-trihedral uniform tilings. Two of them are the regular ones {3,6} and {4,4}. The systems of their incircles (circumcircles) are non-solid sets, because their densities are less than
290
FLORIAN AND HEPPES
(greater than) that of the incircles (circumcircles) of {6,3}. The Archimedean tilings are (3,6,3,6), (3,4,6,4), (3,3,3,4,4), (3,3,4,3,4), and (3,3,3,3,6). Their incircles form non-solid packings, and their circumcircles form nonsolid coverings. For the proof we refer to [6]. This completes the proofs of Fejes Toth's conjectures (ii) and (iv) (see Section 1) for the Euclidean plane and the sphere.
REFERENCES [I] Barany, I. and Dolbilin, N. P., A Stability Property of the Densest Circle Packing, Monatsh. Math., 106 (1988), 107-114. [2] Bezdek, A., Solid Packing of Circles in the Hyperbolic Plane, Studio, Sci. Math. Hungar., 14 (1979), 203-207. [3] Fejes Toth, G., Solid Sets of Circles. Studia Sci. Math. Hungar., 9 (1974), 101-109. [4] Fejes Toth, L., Solid Circle-Packings and Circle-Coverings, Studia Sci. Math. Hungar., 3 (1968), 401-409. [5] Fejes Toth, L., Solid Packing of Circles in the Hyperbolic Plane, Studia Sci. Math. Hungar., 15 (1980), 299-302. [6] Florian, A., Archimedean Tilings, and Solid and Non-Solid Sets of Circles, Rend. Sem. Mat. Messina, Ser. II, 6 (1999), 5-12. [7] Florian, A., Some Recent Results on Packing and Covering with Incongruent Circles, Suppl. Rend. Circ. Mat. Palermo, Ser. II, No. 65 (2000), 93-104. [8] Florian, A., An Infinite Set of Solid Packings on the Sphere, Sitzungsber. Osterr. Akad. Wiss. Math.-naturw. Kl., Abt. II, 209 (2000), 67-79. [9] Florian, A., Packing of Incongruent Circles on the Sphere, Monatsh. Math., 133 (2001), 111-129. [10] Florian, A. and Heppes, A., Solid Coverings of the Euclidean Plane with Incongruent Circles, Discrete Comput. Geom., 23 (2000), 225-245. [II] Heppes, A., Solid Circle-Packings in the Euclidean Plane, Discrete Comput. Geom., 7 (1992), 29-43. [12] Heppes, A., On the Solidity of the Hexagonal Tiling, Colloquia Math. Soc. J. Bolyai, 63, Intuitive Geometry 1991 (1994), 151-154. [13] Heppes, A. and Kertesz, G., Packing Circles of Two Different Sizes on the Sphere, Intuitive Geometry, Bolyai Soc. Mathem. Studies, 6 (1997), 357-365. [14] Imre, M., Kreislagerungen auf Flachen konstanter Kriimmung, Acta Math. Acad. Sci. Hungar., 15 (1964), 115-121. E-mail address: E-mail address:
august [email protected]. at ''August Florian'' hep9202Qella.hu ''Aladar Heppes''
ON THE mTH PETTY NUMBERS OF NORMED SPACES
KAROLY BEZDEK 1 Department of Geometry Eotvos University, Budapest, Hungary, H-1117 MARTON NASZODI 2 Department of Geometry Eotvos University, Budapest, Hungary, H-1117 BALAZS VISY3 Department of Geometry Eotvos University, Budapest, Hungary, H-1117
ABSTRACT. In this paper we study some old and new problems on the Petty numbers of finite dimensional normed spaces. Here the mth Petty number (m > 1) of the given finite dimensional normed space is the largest cardinality of a pointset having the property that among any m points always there are two lying at distance one. The main challenge is to find good upper bounds for the Petty numbers in terms of m and the dimension of the normed space.
1. INTRODUCTION A Minkowski space M = (R d , || ||) is just Rrf with distances measured using a norm || ||. A norm || || is completely determined by its unit ball
B = {xe Hd\ ||x|| < 1}, which is a compact convex set with nonempty interior (i.e. a convex body), centrally symmetric about the origin o in Rd. An elegant result of Petty [15] claims that the cardinality of any equilateral set in M.d is at most 2d i.e. the J
Part of this research was done while the author was visiting the Department of Mathematics at Cornell University in Ithaca, NY. Research was also supported by the Hung. Nat. Sci. Found. (OTKA), grant no. T029786. 2 Partially supported by the Hung. Nat. Sci. Found. (OTKA), grant no. T029786. 3 Partially supported by the Hung. Nat. Sci. Found. (OTKA), grant no. T029786. 291
292
BEZDEK, NASZODI AND VISY
cardinality of any family of pairwise different translates of the unit ball B in Md such that any two translates are tangent is at most 2d . Motivated by this result and the results in [3] and [17] we introduce the following definitions. Definition 1. For the integer m > 1 and the d— dimensional Minkowski space Md let P(m,M r f ) denote the largest integer k such that there are k unit balls in Md (i.e. k pairwise different translates of the unit ball B in M d ) with the property that among any m of them there are two touching ones. We call P(m,M r f ) the mth Petty number of arrangements of unit balls in Md. Definition 2. For the integer m > 1 and the d— dimensional Minkowski space Md let P p a c fc(m,M d ) denote the largest integer k such that there are k non-overlapping unit balls in Md (i.e. k non-overlapping translates of the unit ball B in Md) with the property that among any m of them there are two touching ones. We call Ppack(m,~M.d) the mth Petty number of packings of unit balls in Md. Using our notation the above cited result of Petty can be phrased as follows: (A nice alternative proof of this inequality can be found in [10].) In 1983, P. Erdos raised the following question: What is the largest number g ( n ) with the property that every system of n non-overlapping unit disks in the Euclidean plane has an independent subsystem with at least g(n} members i.e. there are g ( n ) members no two of which are tangent. Recently, Csizmadia [8] showed that \^n\ < g ( n ) moreover, Pach and Toth [14] proved the inequality g ( n ) < f^w] for large n. These results naturally lead us to the following definitions. Definition 3. For the integer n > 1 and d— dimensional Minkowski space Md let Ipack(n:*M.d) denote the largest integer / such that every packing of n unit balls in Md (i.e. every arrangement of n non-overlapping translates of the unit ball B in Md) has an independent subsystem with at least / members i.e. there are / members no two of which are tangent. / p a c fc(n,M d ) is called the independence number of packings of n unit balls in M . Definition 4. For the integer n > 1 and d— dimensional Minkowski space M d let /Y/?, M r f ) denote the largest integer / such that every arrangement of n unit balls in Md (i.e. every arrangement of n pairwise different translates of the unit ball B in M r f ) has an independent subsystem with at least I
ON THE mTH PETTY NUMBERS
293
members i.e. there are / members no two of which are tangent. I(n,~M.d) is called the independence number of arrangements of n unit balls in Md. In this paper we prove the following statements. The proofs are presented in separate sections. Obviously, the Petty numbers and the independence numbers are in inverse relation and satisfy some often used elementary inequalities that are summarized in the following claim. Proposition.
(1) I(n,Md) < I(n + l,M d ) and Ipack(n,Md) < Ipack(n + l,M d ) hold for all positive integers n > 1 and any d—dimensional Minkowski space M rf ; (2) P(m,M d ) + 2 < P(m + l,M d ) and Ppack(m,Md) + 2 < Ppack(m + 1, Md) hold for all positive integers m > 1 and any d—dimensional Minkowski space Md; (3) J(n,M d ) < Ipack(n^'M.d) holds for all positive integers n > 1 and any d—dimensional Minkowski space M rf ; (4) Ppack(m,Md) < P(m,Md} < (^"t^"1) hold for all positive integers m > 1 and any d—dimensional Minkowski space M rf ; (5) 7//(n,M r f ) > m, then P(m,Md) < n - 1; (6) If Ipack(n,Md) > m, then Ppack(m,Md) < n - 1; (7) //P(m,M d ) = 7 i - l , ^en /(n,M d ) = m; (8) If Ppack(m,Md) = n-l, then Ipack(n,Md} = m. Notice that (4) includes the Petty inequality Ppack(2,Md) = P(2,M r f ) < 2 . It seems a rather challenging question to find a better upper bound on P(m,M d ) than (2 t^"1) for m > 2. Our next claim does this for several values of m and d. d
Theorem 1. Let M d ,d > 2 be an arbitrary d—dimensional Minkowski space. Then (1) P(3,M d ) < 2-3d moreover, P(m,M d ) < ( m - l ) [ ( m - l ) 3 r f - ( m - 2 ) ] holds for all positive integers m > 3. Furthermore, (2) P(m,M d ) < (m - l)4 d holds for all positive integers m > 1 and (3) P(m,M 2 ) < 8(m — 1) holds for all positive integers m > 1. Corollary 1. 7 / n > 2 d + l , d > 2 are positive integers and M d is an arbitrary d—dimensional Minkowski space and I(n — l,M d ) < /( then ^j- < I(n,Md] and -^ < I(n,Md). 32 4
294
BEZDEK, NASZODI AND VISY
It is easy to check that the method of the proof of Theorem 1 yields also the inequalities P padc (3,M rf ) < 3 r f ,P p a c / c (m,M d ) < (m-l)3 rf for all m > 3,d > 2 moreover, if n > 2d + l,d > 2 and Ipack(n - l , M d ) < Ipack(n,Md), then 3~dn < /pocitl^M^) holds for any d—dimensional Minkowski space M d . This we can improve as follows. Theorem 2. If n > l,d > 1 are positive integers and M d—dimensional Minkowski space, then
?s an arbitrary
Corollary 2. If m > l,d > 1 are positive integers and Md is an arbitrary d—dimensional Minkowski space, then Pr,nrk(m,Md}
<
Til • 2 • S^" 1 .
The question of determining P pa cfc( m 7 M r f ) and /'(mjM^) is a definitely hard looking problem for most norms of Hd including also the Euclidean norm. However, H d with the maximum norm can be treated in a rather short way as it is shown in the next statement.
Theorem 3. Ifm>I,d>l with the maximum norm, then Ppack(m,MdJ
are positive integers and M^ denotes Hd = P(ro,M?J = (m - l)2 d .
Moreover, we can prove the following partial results for some special Minkowski spaces. Theorem 4. (1) P(3,M 2 ) < 8. ( 2 ) P ( 3 , M ? ? ) = 7. (3) P(m,M^ ) < (m — l)3 rf holds for all positive integers m > 1. (4) P(m,Mf ) < (m - l)3 d /io/ds /or all m > 1 provided that dl/p < 2.
ON THE mTH PETTY NUMBERS
295
Remark 1. In connection with Theorem 4 we mention the still wide open conjecture of Kusner [11] according to which P(2, M^ ) = d + 1 for all 1 < p < oo and d > 2. Finally, we call the attention to the norm /A whose unit ball is the difference body of a d—dimensional simplex in RA It is obvious that P(2, Mf ) > d + 1 for all d > 1 and that P(2, Mf A ) = 3. However, for d = 3 we have the following claim. Theorem 5. //M 3 cuboctahedra), then
denotes R3 with the /A norm (the balls of which are P(2,M?J = 5.
Remark 2. The highly interesting paper [12] shows that P(2,Mf ) > d + 2 holds for all d > 4. However, the exact value of P(2, Mf ) is not known to us for any d > 4. Finally, we cannot resist on raising the following question. Problem. Prove or disprove that if m > 2, d > 1 are positive integers and Mrf denotes an arbitrary d— dimensional Minkowski space, then P(m,M d ) <(m-
l)2 rf .
Remark 3. Recall that Petty [15] conjectures that each (/—dimensional Minkowski space contains d + 1 points at pairwise distance one. This challenging conjecture of Petty is still open for all d > 4. (For more details and partial results see the recent papers [4] and [9].) If this conjecture is true, then the inequality follows for any Minkowski space Mrf for all m > 1.
2. PROOF OF THE PROPOSITION The claims (1),(3),(5) and (6) follow from the definitions in a straightforward way. Proof of (2): If P(m,Md] = fc, then let Bi,...,Bk be a family of k pairwise different translates of the unit ball B in M such that among any
296
BEZDEK, NASZODI AND VISY
m of them there are two touching ones. Then let P>A;+I, -^fc+2 be two touching unit balls in Md that are different from the unit balls P»i, . . . , B^. It is easy to see that the family 5i, . . . , 5^,5/ c+1 ,-B / t + 2 of k + 2 unit balls in Mrf possesses the property that among any m + 1 members always there are two touching ones. Thus, k + 2 < P(m + l,M r f ) finishing the proof of the first inequality of (2). The second inequality of (2) namely, P poc fc(m,M d ) + 2 < -Ppacfc(m + l,M d ) can be proved in the same way. Proof of (4): The inequality Ppack(m,Md) < P(ra,M d ) is trivial. Then recall the following fact from [1], p. 130. For any r, s > 2 let R(r,s] denote the minimum value of n such that every graph with n vertices contains either a complete subgraph of r vertices or an empty subgraph of 5 vertices. (A graph is called empty if it has no edges.) Then R(r,s) < ( r ^f.^ 2 ). Now, let P(m,M d ) = k and let J 9 i , . . . , _ 0 f c be a family of k pairwise different translates of the unit ball B in Md such that among any m of them there are two touching ones. Then let G be the graph whose vertices are the centers of B\ , . . . , Bk and whose two vertices are connected by an edge if and only if the corresponding two unit balls are tangent in Md. Thus, Petty's result [15] applied to the graph G easily implies that ^
finishing the proof of (4). Proof of (7): If P(ra, M rf ) = ra — 1, then every arrangement of n unit balls in Md has m members no two of which are tangent. Thus, m < J(n,M d ). Assume that m < /(n,M d ) say, m -f- m' = J(n,M d ) with some m' > 1. Recall that P(m,M d ) = n— 1 and so there are n— 1 (pairwise different) unit balls say, B\, . . . , Bn-\ in Md such that among any m of them there are two touching ones. Now, take an additional unit ball Bn different from the unit balls 5i, . . . , J9 n _i in Md. By assumption the arrangement B\, . . . , -B n _i, Bn of n unit balls must have m -f 1 independent members in M d and so the arrangement BI , . . . , Bn-\ possesses m members no two of which are tangent in Md, a contradiction. Thus, /(ri,M d ) = m indeed. Proof of (8}: This can be proved in the same way as (7).
3. PROOF OF (1) IN THEOREM 1 We prove our claim by induction on m > 3. Case of m = 3: Let P(3,M d ) = k and let Bi,...,Bk be the family of k pairwise different translates of the unit ball B in Md with the centers c i , . . . , Cfc such that among any three translates there are two touching ones.
ON THE mTH PETTY NUMBERS
297
Then either there are two centers say, ct- and GJ with ||c; — Cj|| > 4 or the diameter diam|| ||{ci, . . . , cjj of the set {GI, . . . , c^} is at most 4 in Md i.e. diamy ||{ci, . . . , c^} — max{||cz- — Cj|| | 1 < i < j < k} < 4. First, assume that there are two centers say, c; and Cj with ||c2- — Cj|| > 4. By assumption any unit ball 5S, 1 < s < k different from the unit balls B{ and Bj must be tangent either to B{ or to Bj. Moreover, if BSl and 5S2, 1 < s\ < 52 < k are two unit balls tangent to the unit ball B{ (resp., B j } , then BSl must be tangent to BS2 because among the unit balls BSl,BS2,Bj (resp., BSl,BS2,Bi) there must be two touching ones. Hence, the unit ball Bi (resp., Bj} together with the unit balls _BS, 1 < s < k that are tangent to it form a family of unit balls in which any two members are tangent. Now, recall Petty's result [15] according to which the cardinality of any family of pairwise different translates of the unit ball B in Mrf such that any two translates are tangent is at most 1d. Thus, k < 2 • 2d < 2 • 3d finishing the proof of Theorem 1 . Second, assume that diani|| ||{ci, . . . ,c/t} < 4. Then it is easy to see that diani|| \\(Bi U • • • U Bk) = diam|| y (conv(#i U • • • U Bk)) < 6. As a result the isodiametric inequality (see for example [6], p. 93) implies that the d— dimensional volume Vol^(conv(.Bi U ••• U Bk)) of the convex hull conv(Bi U • • • U Bk) of the unit balls f?i, . . . , Bk is at most as large as the d— dimensional volume of a ball of diameter 6 in Mrf i.e. it is at most 3d • Vold(B). Finally, as among any three unit balls of the family BI , . . . , Bk there must be two touching ones we get in a straightforward way that any point of the convex hull conv(5i U • • • U Bk) belongs to the interior of at most two unit balls from the family BI, . . . , Bk- Thus, k • Vold(B) < 2 • Volrf(conv(51 U • • • U Bk)) < 2 • 3d • Vold(B). This completes the proof of Theorem 1 in the case m — 3. Case of m > 3; Let P(m, Md) = k and let Bi,...,Bk be the family of k pairwise different translates of the unit ball B in Md with the centers ci , . . . , cj. such that among any m translates there are two touching ones. If among any m — 1 members of the family of the unit balls B\, . . . , Bk always there are two touching ones, then by induction our claim follows. Thus, we may assume that there are m — 1 members of the family B\,...,Bk say, Bi,...,Bm-i such that no two of them are tangent. Now, for each i,l < i < m — 1 let F; be the subfamily of the unit balls of the family 5i, . . . , Bk that are tangent to Bi and add to F; also the unit ball Bi. As among any m members of the family B\,...,Bk there are two touching ones we get that
298
BEZDEK, NASZODI AND VISY
Finally, for each z, 1 < i < m — I let Al - {xe Md I 1 < H x - C i U < 3). Obviously, for any Bj £ F,- different from Bi we have that Bj C A{. Moreover, as among any m members of the subfamily F? \ {Bi} there are two touching ones every point of A; belongs to the interior of at most m— I unit balls of F,\{Bi}. Thus, card(F t - \ {£,-}) Vol rf (fl) < (m - 1) • Vol d (A t -) = (m - I) • (3rf - l)Vold(5). As a result we get that m —l
k
finishing the proof of (1) in Theorem 1.
4. PROOF OF COROLLARY 1 According to the subclaim (5) of the Proposition if I(n,M r f ) = m, then P(m, Md) < n ~ 1. Assume that P(m, Md) - ri - I < n - 1. Then subclaim (7) of the Proposition implies that J(n',M d ) = m with n' < n. Finally, subclaim (1) of the Proposition and the assumption I(n— l,M d ) < /(n,M d ) imply that m - I(n',Md} < I(n - l,M d ) < /(n,M d ) = m, a contradiction. Hence, P(m,M r f ) = n - 1. Thus, subclaim (1) of Theorem 1 and Petty's result [15] imply that if m > 2, then n - 1 = P(m,M r f ) < (m - I)2 • 3d and so
n< 3d-m2 = 3d-I2(n,Md) d
provided that J(n,M ) = m > 2. Finally, applying again Petty's result [15] we get that I(n,Md) > 2 for all n > 2d + 1. In a very similar way, subclaim (2) of Theorem 1 implies the inequality ^ < I(n,M.d). This completes the proof of Corollary 1.
5. PROOF OF THEOREM 2 The following statement has been proved in [2]. Lemma 1. Let M d ,d > 2 be an arbitrary d—dimensional Minkowski space with the unit ball B centered at the origin o. // h(B) denotes the
ON THE mTH PETTY NUMBERS
299
one-sided Hadwiger number of B i.e. h(B} denotes the maximum number of non-overlapping translates of B that are all (outer) tangent to B lying in a closed supporting half space to B, then
h(B} < 2 • 3d'1 - 1.
Based on Lemma 1 we prove Theorem 2 as follows. Let jBj, . . . , Bn be a packing of n,n > 1 unit balls with centers C i , . . . , c n in M^,c? > 1. Take a vertex say, c,- of the convex hull of the centers ci, . . . ,cn in Md. Then it is obvious that the number of the unit balls in the family J?i,...,.Z? n that are (outer) tangent to Bi is at most h(B). As the Lemma claims that h(B) < 2 • 3d-1 - 1 it follows by induction (on n) that
This completes the proof of Theorem 2.
6. PROOF OF COROLLARY 2 If Ppackfa, Md) = n — 1, then subclaim (8) of the Proposition implies that Ipack(n,Md) = m. Thus, Theorem 2 yields that 2.3d-i < m or equivalently, Ppack(™"> Md) + 1 = n < m • 2 • 3d"1 finishing the proof of Corollary 2.
7. PROOF OF THEOREM 3 Let P(m, M^ ) = k and let J?i, . . . , B& be an arrangement of k pairwise different translates of the unit ball B with centers GI , . . . , c^ in Md such that among any m translates there are two touching ones. Hence, among any m points of {GI, . . . , c^} always there are two lying at distance 2 in Md . Now, if c'- = |cz-, 1 < i < k, then among any m points of {c'1: . . . , c^.} always there are two lying at distance 1 in Mf . Let C = [0, 1) X • • • X [0, 1) be the "partially open" unit d— cube of Rd with 2d vertices of 0 — 1 coordinates. If Zd denotes the integral points of Rd, then the family {z + C \ z 6 Zd} is a tiling of Rd into pairwise disjoint "partially open" unit cubes. Thus, for each c'- there is a uniquely determined Z{ 6 Zd with c( G z; + C, where 1 < i < k. As the norm in Mf is the maximum norm it is easy to see that
300
BEZDEK, NASZODI AND VISY
the multiset of the points Z i , . . . , z & (which is a pointset with points having multiplicity) has the property that among any m not necessarily different points always there are two lying at distance 1 in M^ . Finally, for each z; let u z be the uniquely determined 0—1 vector of R d whose coordinates are congruent to the corresponding coordinates of zt- mod 2, where 1 < i < k. It is obvious that the multiset of the points u i , . . . , u/- has the property that among any m not necessarily different points always there are two lying at distance 1 in M^ . As the points m , . . . , u^ are vertices of the unit d— cube C it is easy to see that the inequality k < (m — 1)2^ must hold. From this it follows that PpadbKM/J < P(m,Mfj
< (m-l)2d.
As the reversed inequality (m - l)2 d < P pacfc (m,MO < P(m,M?J is trivial, this completes the proof of Theorem 3.
8. PROOF OF (1) AND (2) IN THEOREM 4 Proof of (I) in Theorem 4. Theorem 3 implies that P(3,Mf oo ) = 8. Thus, we may assume that the norm is different from the maximum norm. We prove that the touching pairs graph G, constructed in the proof of subclaim (4) of the Proposition, has maximum degree at most 4. Taking any vertex say, c let G(c) denote the subgraph spanned by the vertices connected to c by an edge. Since among any 3 vertices there are always 2 connected by an edge, G(c) contains no empty triangle, and since the norm is not the maximum norm, G'(c) contains no complete subgraph on 3 vertices. Thus, we get from [1], p. 130, that |G(c)| < 5. It is easy to see that if |G(c)| = 5, then G(c) is a cycle on 5 vertices. This is however a contradiction, since if the norm is different from the maximum norm, then no unit disk can be touched by five unit disks in M2 such that any two consecutive unit disks in the cyclic ordering of the five unit disks are tangent. (This elementary fact one can prove in several different ways but, one can get an elegant and clean-cut approach using the angular measure introduced by Brass in [5].) Finally, it is obvious, that the number of vertices not connected to c by an edge is at most 3 thus, indeed G has at most 8 vertices. Proof of (2) in Theorem 4. Assume that P(3,Mf ) = 8. Then according to the subclaim in the proof of (1) of Theorem 4 every vertex of G must have degree 4. Taking an arbitrary vertex say, c let ci, 02, 03, 04 denote the vertices connected to c by an edge of G and let c5, ce, €7 denote the rest
ON THE mTH PETTY NUMBERS
301
of the vertices of G. It is easy to see, that among ci, 02, 03, 04 there are always 2, or 3 edges. Having 2 edges between GI , . . . , 04 implies that the degree of these vertices in the subgraph G1 of G spanned by c, GI, ... ,04 is 2, so each vertex in the family {ci,... ,04} has 2 edges going to the vertex set {05, eg, CT}. Hence 8 edges connect G" to the vertices 05, eg, cy, a contradiction. If 3 edges occur between GI , . . . , 04, then c is in the convex hull of GI , . . . , 04 contradicting to the arbitrary choice of c.
9. PROOF OF THEOREM 5 We consider R3 with the cuboctahedron obtained from the unit cube [— |, |]3 by proper truncation (by taking the convex hull of the midpoints of the edges) as the unit ball for the norm || ||/ A . Then we take an arbitrary l&equilateral set. First, we prove that the angles of any triangle with vertices in the /^-equilateral set are non-obtuse. Let a, b and c denote the Euclidean lengths of the sides of a triangle of the /^-equilateral set. Since c2 = (a - 6)2 + 2a6(l - cos 7) > 2a6(l - 0037), 2
we have that cos 7 > 1 — ^ > 0. The later inequality is due to the fact that v/2 > a,6,c > 1. Hence 7 < 90°. If every triangle spanned by the points of the /^-equilateral set is acute, then Croft's result [7] yields, that we can have at most 5 points in the l&equilateral set, finishing the proof of Theorem 5. So, suppose that there is a right triangle spanned by three points of the /^-equilateral set in question. Then a — b = 1, c — \/2 for some proper labelling of the sidelengths moreover, each leg must be parallel to a coordinate axis of R3. Thus, we can assume that the vertices of the right triangle in question are a(0, 1,0), b(l,0,0) and c(0,0,0). By taking a closer look of the cuboctahedron we get that {p € R3 : ||p - a||,A - ||p - b||/A = ||p - c||/A - d(l, 1, 0) U El U
where E\ = {(x, y,z,) € R 3 : 0 < # = y < | , 2
= l} and
E2 = { ( x , y , z , ) € R3 : 0 < x = y < \,z = -1}. Since no 2 points of E\ (resp., E^) are at distance 1 from each other in the norm j| ||/A and the /^-distance between the sets EI and E% is at least 2, we get that at most d and one additional point from either EI or E<2 can belong to the //^-equilateral set. Thus, again we get at most five points for our /^-equilateral set. This finishes the proof of Theorem 5.
302
BEZDEK, NASZODI AND VISY 10. PROOF OF (2) AND (3) IN THEOREM 1 AND (3) AND (4) IN THEOREM 4
We say that a distance h > 0 is realized within a given set of a metric space if there are two points of the given set whose distance is equal to h. We will need the following claim which is equivalent to Theorem 1 in [13]. Lemma 2. If a measurable set in a d-dimensional Minkowski space has upper density larger than m7l with the property that some distance is not realized in that set, then there is no configuration of k points having the property that there are two points lying at distance one among any m of the k points. Thus, in order to establish the inequality P(m,M d ) < (m — l)/c it is sufficient to find a set of upper density at least £ not realizing all distances. Proof o/(2) in Theorem 1. Take a saturated packing of unit balls in M and take the Voronoi cells V\, V?,... of the balls. As the Voronoi cell of each unit ball is the collection of points that are as near to the center of that ball as to the center of any other, it follows from the saturated property of the packing that each Voronoi cell is covered by the open ball of radius 2 concentric to the unit ball of the Voronoi cell. Let V? denote the contraction of Vi by factor ^ from the center of the unit ball contained in V;, i'. — 1, 2 , . . . . Finally, let V = |J£i V{. As Hd = (J^ Vl the upper density of V is at least ^j. Finally, as each cell V[ is contained in an open ball of radius \ in M rf , it easy to see that the distance 1 is not realized in V finishing the proof of (2) in Theorem 1. Proof of (3) in Theorem 4- Again we take a saturated packing of unit balls this time, in M^ . Also, just as before let Vi, V^ • • • denote the Voronoi cells of the unit balls in the given saturated packing. However, now we contract each Voronoi cell Vi by factor ^ from the center of the unit ball contained in Vi. Let V[ be the contracted cell obtained from Vt, i = 1 , 2 , . . . . As a result we get that each V{ is contained in an open ball of radius ^ in M^ . Consequently, the distance | is not realized in any V?. Moreover, if Vi and Vj are two Voronoi cells, then they can be separated by the perpendicular bisector hyperplane of the linesegment connecting the centers of the unit balls lying in the cells Vi and Vj. As a result it is easy to see that the distance between the contracted cells V-' and V-J is at least f.o Thus, in the * set V = Ui^i intV/ the distance | is not realized and the upper density of V is obviously at least ^. This completes the proof of (3) in Theorem 4 via Lemma 2. Proof of (3) in Theorem, 1. Using Lemma 2 it is sufficient to construct a set of upper density at least ^ not realizing all distances. Auerbach's lemma
ON THE mTH PETTY NUMBERS
303
(for a proof see [16]) states that a proper choice of a basis of the Minkowski space ensures that the unit ball is inscribed in the unit ball of the l^ norm and is circumscribed the unit ball of the /i norm. That is Vx = (xi,x 2 ) €M2 = (R 2 ,|| ||) :max{|x 1 |,|x 2 |} < ||x|| < |zi|-Hz 2 |. For any 1 < p < oo denote by Bp(x,r) the open ball of center x and radius r according to the lp norm. Let A
'-= l'l=
oo
oo
U
U
1
*i((M2)>4)-
— 00 12 = — 00
Then the (upper) density of A is | while the distance ^ is not realized in A. Proof of (4) in Theorem 4- Now we want to find a set of upper density (\>}d not realizing a given distance, say 2. Let A:=
U
U •" U
This set is the desired one. Namely, the diameter of one open cell of A is i less than dp < 2, and the distance between any two cells of A is larger than 2.
REFERENCES [1] Agarwal, P.K. and Pach, J., Combin