A Stability Property of the Densest Circle Packing. (Received 9 December 1987)

Similar documents
Thinnest Covering of a Circle by Eight, Nine, or Ten Congruent Circles

12-neighbour packings of unit balls in E 3

Density bounds for outer parallel domains of unit ball packings

The Densest Packing of 13 Congruent Circles in a Circle

Circumscribed Polygons of Small Area

Curved Hexagonal Packings of Equal Disks in a Circle

Covering the Plane with Translates of a Triangle

SUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS

Cylindrical Partitions of Convex Bodies

Packing and Minkowski Covering of Congruent Spherical Caps on a Sphere, II: Cases of N = 10, 11, and 12

arxiv: v1 [math.co] 28 Jan 2019

NOTE. On the Maximum Number of Touching Pairs in a Finite Packing of Translates of a Convex Body

On the number of cycles in a graph with restricted cycle lengths

Geometry. The k Most Frequent Distances in the Plane. József Solymosi, 1 Gábor Tardos, 2 and Csaba D. Tóth Introduction

Packing Congruent Bricks into a Cube

A Simplex Contained in a Sphere

#A45 INTEGERS 9 (2009), BALANCED SUBSET SUMS IN DENSE SETS OF INTEGERS. Gyula Károlyi 1. H 1117, Hungary

USAC Colloquium. Bending Polyhedra. Andrejs Treibergs. September 4, Figure 1: A Rigid Polyhedron. University of Utah

Research Article Translative Packing of Unit Squares into Squares

On Distance Sets in the Triangular Lattice

The 123 Theorem and its extensions

Families that remain k-sperner even after omitting an element of their ground set

THE DENSE PACKING OF 13 CONGRUENT CIRCLES IN A CIRCLE

Almost Cross-Intersecting and Almost Cross-Sperner Pairs offamilies of Sets

On prime factors of subset sums

Game saturation of intersecting families

64 P. ERDOS AND E. G. STRAUS It is possible that (1.1) has only a finite number of solutions for fixed t and variable k > 2, but we cannot prove this

Problems and Solutions

Packing of Rigid Spanning Subgraphs and Spanning Trees

Horoball Packings for the Lambert-cube Tilings in the Hyperbolic 3-space

Towards a de Bruijn Erdős Theorem in the L 1 -Metric

ON FREE PLANES IN LATTICE BALL PACKINGS ABSTRACT. 1. Introduction

252 P. ERDÖS [December sequence of integers then for some m, g(m) >_ 1. Theorem 1 would follow from u,(n) = 0(n/(logn) 1/2 ). THEOREM 2. u 2 <<(n) < c

RAINBOW 3-TERM ARITHMETIC PROGRESSIONS. Veselin Jungić Department of Mathematics, Simon Fraser University, Burnaby, B.C., Canada.

Janusz Januszewski TRANSLATIVE PACKING OF UNIT SQUARES INTO EQUILATERAL TRIANGLES

ON FUNCTIONS WHOSE GRAPH IS A HAMEL BASIS II

COM BIN ATOR 1 A L MATHEMATICS YEA R

On the Volume of Unbounded Polyhedra in the Hyperbolic Space

LATTICE POINT COVERINGS

Families of point-touching squares k-touching

D - E - F - G (1967 Jr.) Given that then find the number of real solutions ( ) of this equation.

Note on the chromatic number of the space

Graphs with Integer Matching Polynomial Roots

Partitions of the set of nonnegative integers with the same representation functions

Deviation Measures and Normals of Convex Bodies

STAR EXTENSION OF PLANE CONVEX SETS

Multi-colouring the Mycielskian of Graphs

Efficient packing of unit squares in a square

Created by T. Madas MIXED SURD QUESTIONS. Created by T. Madas

VAN DER WAERDEN S THEOREM.

R(p, k) = the near regular complete k-partite graph of order p. Let p = sk+r, where s and r are positive integers such that 0 r < k.

MATH 426, TOPOLOGY. p 1.

A note on [k, l]-sparse graphs

On bisectors in Minkowski normed space.

Isomorphisms and Normality of Cayley Digraphs of A5

COMPUTATION OF JACOBSTHAL S FUNCTION h(n) FOR n < 50.

Objectives. Cabri Jr. Tools

DISCRETIZED CONFIGURATIONS AND PARTIAL PARTITIONS

Math 110 HW 3 solutions

34 th United States of America Mathematical Olympiad

Algebra Mat: Working Towards Year 6

Decomposing oriented graphs into transitive tournaments

WORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:

IMA Preprint Series # 2385

Arithmetic progressions in sumsets

The Leech Lattice. Balázs Elek. November 8, Cornell University, Department of Mathematics

COMPLEX NUMBERS WITH BOUNDED PARTIAL QUOTIENTS

A NOTE ON RATIONAL OPERATOR MONOTONE FUNCTIONS. Masaru Nagisa. Received May 19, 2014 ; revised April 10, (Ax, x) 0 for all x C n.

On Contact Numbers of Finite Lattice Sphere Packings of Balls

DICKSON POLYNOMIALS OVER FINITE FIELDS. n n i. i ( a) i x n 2i. y, a = yn+1 a n+1 /y n+1

MORE EXERCISES FOR SECTIONS II.1 AND II.2. There are drawings on the next two pages to accompany the starred ( ) exercises.

Visit: ImperialStudy.com For More Study Materials Class IX Chapter 12 Heron s Formula Maths

Theoretical Computer Science

2010 Fermat Contest (Grade 11)

The unit distance problem for centrally symmetric convex polygons

On (δ, χ)-bounded families of graphs

arxiv: v1 [math.gm] 1 Oct 2015

ANSWER TO A QUESTION BY BURR AND ERDŐS ON RESTRICTED ADDITION, AND RELATED RESULTS Mathematics Subject Classification: 11B05, 11B13, 11P99

Minimal Decompositions of Hypergraphs into Mutually Isomorphic Subhypergraphs

A well-quasi-order for tournaments

Odd multiperfect numbers of abundancy four

ON THE SUM OF ELEMENT ORDERS OF FINITE ABELIAN GROUPS

Packing and Minkowski Covering of Congruent Spherical Caps on a Sphere for N = 2,..., 9

SUMSETS AND THE CONVEX HULL MÁTÉ MATOLCSI AND IMRE Z. RUZSA

Necessary and Sufficient Conditions for the Central Norm to Equal 2 h in the Simple Continued Fraction Expansion of 2 h c for Any Odd Non-Square c > 1

2012 Canadian Senior Mathematics Contest

AN INEQUALITY AND SOME EQUALITIES FOR THE MIDRADIUS OF A TETRAHEDRON

ON THE ERDOS-STONE THEOREM

Eves Equihoop, The Card Game SET, and Abstract SET

The primitive root theorem

MORE ON THE PEDAL PROPERTY OF THE ELLIPSE

Mic ael Flohr Representation theory of semi-simple Lie algebras: Example su(3) 6. and 20. June 2003

Solving a linear equation in a set of integers II

Coloring Vertices and Edges of a Path by Nonempty Subsets of a Set

We have been going places in the car of calculus for years, but this analysis course is about how the car actually works.

Notes on Systems of Linear Congruences

number. However, unlike , three of the digits of N are 3, 4 and 5, and N is a multiple of 6.

arxiv: v1 [math.nt] 10 Dec 2009

Two applications of the theorem of Carnot

THE FIXED POINT PROPERTY FOR CONTINUA APPROXIMATED FROM WITHIN BY PEANO CONTINUA WITH THIS PROPERTY

Transcription:

Monatshefte f/it (1988) Maihemalik 9 by Springer-Verlag 1988 A Stability Property of the Densest Circle Packing By Imre Bfirfiny 1, Budapest, and N. P. Dolbilin, Moscow (Received 9 December 1987) Abstract. A new stability property of the densest circle packing in the plane is proved. This property is related to a conjecture of L. FEJES T6T~. 1. The Result Let cg = { Co, C~, C2,... } be a densest packing of congruent circles (of unit diameter, say) in the plane. It is well-known [2, 4] that the centres of the circles in cd form a regular triangular lattice. Let cd 0 be the packing obtained from cd by removing one circle, C o say, from c#. L. FEJES TdTH [3] conjectures that cg has the following very interesting stability property: Assume (n + i) circles, Co, C1,. 9 Cn are removed from cd and n circles, C'~,..., C',, each congruent with Co are put back in such a way that the family ~' = { C],..., C',, C, + 1,.--} is again a packing. Then, according to the conjecture, ~f' is congruent to ~0. This conjecture is open and the solution seems to be difficult. In this paper we prove the following related result. Theorem. Assume the circles { C'I,..., C',, C, + 1,...}form a packing and the centre of C'i is within e distance of the centre of Ci (i = 1,..., n). Then C'i = Ci (i = 1,..., n) provided e < ~. Inspired by this result A. BEZDEK and R. CONNELLY [1] call a packing ~ of congruent circles in the plane uniformly stable if there is e > 0 such that no finite subset of the circles can be rearranged such that each circle is moved with a distance less than e and the rearranged circles together with the rest form a packing not congruent to the original one. In this terminology our theorem says that ~0 is uniformly stable. BEZDEK and CONNELLY establish in [1] that certain 1 Research of this author was partially supported by Hungarian National Foundation for Scientific Research grant no. 1812.

108 I. B~m~Nv and N. P. DOLBmIN circle packings are uniformly stable and some others are not. They show, for instance, that the packing where the centres of the circles form the integer lattice in R 2 is not uniformly stable. The Theorem says that cg 0 is uniformly stable with e 4 e0 -= ~. We have not tried to get the largest possible e0 here, though some considerations show that our proof works at e 0 = ~ and does not work 1 at ~0 = ~- 2. Two Lemmas and One Proof The proof of the Theorem is based on two lemmas. The first is quite simple: Lemma 1. If in a triangle T the length of every edge is at least 1 and an angle is ~ + 6 with I ~1 <., then Area T >/5/~ ~- + 0.229161. (1) In order to state the second lemma some preparation is needed. Let p~,p2,..-,p6 be the vertices of a regular hexagon in this order along the perimeter. Choose points q~..., q6 with Iqi-&l<~,i= 1,...,6. Then q~,..., q6 are the vertices of a hexagon H "close" to the regular. Let ~, 3, ~7 be the angle of H at vertex q2, q4 and q6, respectively, and define ~,/3, ~, by setting 2~ 2~ 2~ 3 -+7 Lemma 2. If the length of every edge of H is at least one, then AreaH~> ~ - 0.565 (g 2 +/~2 + 72). (2) 2 Proof of the Theorem using Lemma 1 and 2. Consider a packing! I ~' = {Cl,. 9 Cn, Q+I,...} with the eentres ql, q2,. " - of the circles as in Fig. 1.

A Stability Property of the Densest Circle Packing!09 q16 q7~ /~ ~? q,3 q8 ~ q12 %/\ /\ ql0 /\ql~ Figure 1 By our assumption, every q~ is within e ~< ~ distance of the corresponding lattice point Pi (when i -- 1,..., n) and coincides with pi when i > n. The centre of the missing circle is P0 = q0. The centres qi, %, qk are said to form the triangle qi % qk if the circles C i, Cj and C k pairwise touch each other. As the edges of a triangle T are of length at least one and the triangle is "close" to the regular, Area T t> ~ (3) 4" Denote by Kthe large hexagon with vertices q7, qg, q., q13, q15, q17. All triangles outside Khave area ~ at least and for q~ far enough from P0, we have qi = P~. This implies Area K ~< 24? = 6?/3. (4) Now write ~ + 0i, ~ + d2, ~ + d3, B- -t" (}4 for the angle at q: of the triangle ql q8 q;, q8 q9 q2, q9 qlo q2 and qm q3 q2, respectively. Let H be the hexagon with vertices q~, q2,..., q6. Then, with the notation of Lemma 2, c~ + d 2 + d3 + ~4 + ~ = 0 and so I~11 Jr" IC~21-I-]C~31 + ]d4] ~ I~(I. A simple computation shows that the conditions I qi - PiJ ~< a~ imply I,J i= 1,...,4,

10 I. B~RANY and N. P. DOLBILIN So Lemma 1 applies: the area of the four triangles at q2 is at least 4~ + 0.229(1~1k + 1~2] + 1~31 + 1041) >/3/3 + 0.2291 ~1 9 Estimating the area of the four triangles around q4 (and q6) in the same way we get Area (K\/4) >t 6 ~-+ 3 a/3 + 0.229 (I - J + I/31 + 17 I). (5) Furthermore, Lemma 2 applies to the hexagon H: AreaH >~ 33/j - 0.565 (, 2 + 132 + 72). (6) 2 Combining (4), (5) and (6) we have 6 3/3 ~> Area K = Area (K\ H) + Area H >~ >~ 6 3/J - 0.565 (2 + f12 _I_ y2) _j_ 0.229 (I ~ I + ] /31 + ] 71), which implies that 0.229(I-I + Ifll + 17{)~< 0.565(~z +/~2 + Y2)~< 0.565({~1 + 1/31 + [7[) 2 9 0.229 So either, = = = 0 or I-I + I/~{ + I Zl >/-- > 0.4. The latter 0.565 case contradicts to ]0~1, ]ill, I~l ~< 0.1. So ~ =/~ = 7 = 0. Repeating the same argument with vertices ql, q3, q5 (instead of q2, q4, q6) we get that all angles of H are equal to 2 7Z Then Area H > 3]3 unless all edges of H are equal to one. 3 2 Similarly, Area (K\ H) > -- lar. So we get qi = Pi, i = 1,2... [] unless all triangles in K\ H are regu- 3. Proof of Lemma 1 Let x and y be the lengths of the edges of the triangle, incident to Jl: the angle g + O. Assume first that ~ ~> 0. Then AreaT=~xysin +~ >~sm +~.

A Stability Property of the Densest Circle Packing 111 We are going to use Taylor expansion quite often so we describe its first use in more detail. The Taylor expansion of sin t around t = - ~s 3 this: sin (3 + 0) : sin3 + (c~ + ~(- sin (3 + 3))82 where ~ is between 0 and 8. Thus sin(3+3 ) sin~cosd+cos~sln 9 u =. ~ = Then 1 11 = cos~ + ~sm~ ~< ~- + ~l~l ~< ~- + ~. 10. AreaT~>~sin ~+0 ~>4-+48-4- 02 when 0 < 0 < 0.1, indeed. /> ~3 + 18 _ 0.2041 d 2 ~> 4 4- + 0.229 8 4 Consider now the case 8 < 0. It is an elementary exercise to see that Area T will be the smallest when the triangle is isosceles with two Yg 2"( angles equal to ~ + 0. The third is ~ - 2 0, then. Using Taylor expan- sion again Area T~> ~sm -28 ) ~>4--2 2 ~- + 0.229101 when-0.1<8~<0. [] 4. Proof of Lemma 2 Denote by xi the length of the edge qiq~+l of H (i = 1...,6, obviously q7 = q~ here). We want to estimate h 0 = min {Area H: I qi -- Pil <<- 7~y, Xi ~ 1, i : 1,..., 6}.

112 I. B~,RANY and N. P. DOLBILIN As we mentioned earlier these conditions imply I c~ I, I fll, I~1 ~ 0.1. Then h 0>~min{AreaH:l~l,L/31,l;el~<0.1,x~> 1, i= 1,...,6}. We claim that if the last minimum is attained then all xi = 1. Indeed, assume xl > 1 (say), keep ~,/3,,/, x2,x3,..., x6 fixed and decrease xl to 1. Then Area H = Area ql q2 q3-1- Area q3 q4 q5 "~- Area q5 q6 ql + Area ql q3 q5 (7) and in this formula, Area ql q2 q3 decreases and the triangles q3 q4 q5 and q5 q6 ql do not change. In the triangle ql q3 q5 the edges q~ qs and q3 q5 do not change and ql q3 decreases. Then the angle at q5 decreases and so does Area ql q3 qs. Thus h o~>h l=min{areah:l~l,]/3l,i;~[~<0.1,x~= 1, i= 1,...,6}. We estimate h~ using formula (7). Write max (I ~ l, I/3 l, ]?' I) = A. With Taylor expansion Area ql q2 q3 = ~ Xl X2 sin ff + ~ = ~ sm + ~ >/ (8) 4--4-4\2 + To compute the area of the triangle ql q3 q5 is more involved. Set I qb-q5 12 = a, I q5 - ql 12 = b, I ql -- q3 [2 = C. Clearly a = x~ + +x2-2xtx2cosc2=2-2cos~, b= 2-2cosfl, c=2-2cos~. Then, by Heron's formula Areaqlq3q5 = 88 a 2- b 2- c 2 + 2ab + 2bc + 2ca) ~ = = 89-2(cos2~ + cos2? + cos~) + (cos~ + cos? + cosp - 1)2] ~. Using Taylor expansion again and cos~=cos 3- + ~ ~< 2 2 ~ +A

A Stability Property of the Densest Circle Packing 113 (COS~ -}- COSfl q- COS~ -- 1) 2 ~.~ >~ 2 (~+/3+7)+ ~ ~+A (2+ +7) >t > + 5-{ +e+r)+ a - (~ + 4.06A)(~2 +/~2 + 72). Here the term 4.06 A comes from a routine estimation using A ~< 0.1. With another Taylor expansion and so COS 2 ~ ~- COS 2 q- C~ ~< ~ + ~ + 1 + 4 A) 2 COS2~ -}- COS2fl -{- coszp Then 3 <a+t Areaqlq3qs>~a/~ {l + (~ + fl + 7) + 9 (~ + t~ + -(~+ 1.2A)(c~2 + f12 q- y2)t}89. (9) Write t for the expression in square brackets here. We estimate t using A <~ ~ again J tl <~ 2~93 3 A + l (3 A)2 + (3 + 1.2A)3 A2 < l.4 A. The Taylor expansion for (1 + t) ~' around t = 0 with I t I ~< 1.4 A gives Also, (t+t)~>~l+lt--~-(1 +3.4A)t 2. t 2 ~< (~ + 0.27 4) (~ + {r + 7,) 2 + 1.55 A (c, 2 +/~2 + 2).

114 I. BARANY and N. P. DOLBILIN: A Stability Property Then we get (i+t)89 1+~ 1 (~+/~+7)+(;7-O.12A)(~+fl -(~+0.9A)(~z+/32+y2). Substituting (8), (9) and (10) into (7) we get ~-- +1.3A (2+/~2+ 2)+ + 7) 2 -- (lo) + ]~24 _0.2A (~+p+r)2> > ~_ 0.565@2 + ~2 + r2). [] 2 References [1] BEZDEK, A., CONNELLY, R.: Uniformly rigid circle packings. Manuscript. [2] FEJES T6Tn, L.: Lagerungen in der Ebene, auf der Kugel und im Raum. Berlin: Springer. 1953. [3] FEJES T6TH, L.: Solid circle packings and circle coverings. Studia Sci. Math. Hung. 3, 401--409 (1968). [4] THUE, A.: Uber die dichteste Zusammenstellung yon kongruenten Kreisen in einer Ebene. Christ. Vid. Selsk. Skr. 1, 3--9 (1910). I. B,/~RANY Mathematical Institute of the Hungarian Academy of Sciences H-1364 Budapest Refiltanoda u. 13--15, P.O.B. 127 Hungary N. P. DOLBILIN Steklov Institute of Mathematics 42 Vavilov 117333 Moscow, U.S.S.R