Dense packings of the platonic and archimedean solids nature. The latest version of the table of record packing densities is available on the web at the database of lattices web site. For further details on these connections, see the book sphere packings, lattices and groups by conway and sloane. Random perfect lattices and the sphere packing problem. Sphere packings, lattices and groups this is the third edition of this reference work in the literature on sphere packings and related subjects. You wrote, the problem is proving things, and in particular ruling out the huge unruly mob of nonlattice packings. The ukrainian mathematician maryna viazovska has solved the centuriesold spherepacking problem in dimensions eight and 24. They are close to a proof that the densest packing not necessarily lattice packing is the leech lattice packing, about 0. In this paper, we study this problem between sphere packing and sphere co vering for the special case when the sphere centers lie on a particular family of. The center density of the sphere packing is just s n sn, where s s is the radius of the balls used in the packing. Sphere packing is the problem of arranging nonoverlapping spheres within some space, with the goal of maximizing the combined volume of the spheres. Sphere packing, modular forms, fourier analysis ams subject classi cation. In geometry, closepacking of equal spheres is a dense arrangement of congruent spheres in an infinite, regular arrangement or lattice. Packing index of subsets in polish groups banakh, taras, lyaskovska, nadya, and repovs, dusan, notre dame journal of formal logic, 2009.
The sphere packing problem in dimension 8 maryna s. The hexagonal lattice gives the densest sphere packing in two dimensions. Sphere packing, lattices, and epstein zeta function. Page of links to other pages, collected by anton sherwood. Sphere packing is a rst step towards these more complex problems. Viazovska april 5, 2017 in this paper we prove that no packing of unit balls in euclidean space r8 has density greater than that of the e 8lattice packing. Im going to start by describing a game that seems completely unrelated to sphere packing. Gritzmann and wills, finite sphere packing and sphere covering. This book is mainly concerned with the problem of packing spheres in euclidean space of dimensions 1,2,3,4,5. I am most grateful to abhinav kumar for helpful remarks and catching errors. This problem, and its relationship to the spherepacking question, seems very interesting, and i hope to return to it elsewhere.
Scardicchio,2 1abdus salam ictp, strada costiera 11, 34151, trieste, italy 2infn, sezione di trieste, via valerio 2, 34127 trieste, italy received 31 july 2012. Improved sphere packing lower bounds from hurwitz lattices stephanie vance abstract. Lattices, sphere packings, spherical codes and energy minimization abhinav kumar mit november 10, 2009 2. In low dimensions, the best known sphere packings come from lattices. The density of the packing is a continuous function u. Combinatorial packing and covering, finite groups, lattice theory, sphere publisher new york.
Lattices lattice packings in dimensions two and three hermite, mordell, and voronoi poisson summation. Keplers sphere packing problem solved a four hundred year mathematical problem posed by the famous astronomer johannes kepler has finally been solved. In any configuration, all but finitely many green apples occasionally referred to as grapples. See also his list of spherepacking and lattice theory publications. For example, the binary golay code is closely related to the 24dimensional leech lattice. Pdf, dvi and plain tex files of papers and preprints by r. We observe that the densest packings of all of the platonic and archimedean solids reported here as well as the densest known packings of superballs 15 and ellipsoids 12. The fact that the maximal density of the ghost rsa packing implies that there may be disordered sphere packings in sufficiently high whose density exceeds minkowskis lower bound for bravais lattices, the dominant asymptotic term of which is. The full preface to the third edition is also available, in postscript or pdf format. The sphere packing problem in dimension 24 with abhinav kumar, stephen d. Splag sphere packings, lattices and groups acronymfinder. Mathematician thomas hales of the university of michigan announced last month that after six years effort, he had proved that a guess kepler made back in 1611 was correct.
Within a crystalline material, each atom can be thought of as a sphere. Here is an active link to the database of lattices mentioned on page xvi. Casselmans interactive proof source for next two pictures. New upper bounds on sphere packings i by henry cohn and noam elkies abstract we develop an analogue for sphere packing of the linear programming bounds for errorcorrecting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. Varying the dimension what if we didnt work in threedimensional space. These lattices ha v e a greater densit y than an y previously kno wn in dimensions from ab out 80 to 4096, and. It is important to note that there is no hope to get a precise circle packing which approximates an arbitrary shape. Sphere packings, lattices and fruits complex projective. This is a translation of the first edition of sphere packings, lattices and groups into russian 2 volume set. It is the threedimensional equivalent of the circle packing in a circle problem in two dimensions. The packing density of large lattice packings of spheres in euclidean e d measured by the parametric density depends on the parameter and on the shape of the convex hull p of the sphere centers. If a and b are neighboring niemeier lattices, there are three integral lattices containing a n b, namely a, b, and an odd unimodular lattice c cf.
In this paper we prove an asymptotic lower bound for the sphere packing density in dimensions divisible by four. Universal optimality of the e 8 and leech lattices and interpolation formulas with abhinav kumar, stephen d. Sphere packing in a sphere is a threedimensional packing problem with the objective of packing a given number of equal spheres inside a unit sphere. Sphere packing solved in higher dimensions quanta magazine. In addition to the content of the preceding editions, the present edition provides in its preface a detailed survey on recent developments in the field, and an exhaustive supplementary bibliography. Henry cohn iap math lecture series january 16, 2015. Given a large number of equal spheres, what is the most efficient or densest way to pack them together. In the classical case, the spheres are all of the same sizes, and the space in question is threedimensional space e. Soddys hexlet, six spheres in a ring tangent to three others, and soddys bowl of integers, a sphere packing combining infinitely many hexlets, from mathworld. Sphere packings, lattices and groups john conway springer. The sphere packing problem i i packing ball bearings 1.
From sphere packing to the theory of optimal lattice sampling. We apply this to get sharp bounds for packing problems, and we use these sharp bounds to prove that certain optimal packing configurations are unique up. This is because circles touching each other lie on a common sphere and their axes of rotation are co. Multisized sphere packing shuji yamada1 jinko kanno2 miki miyauchi3 1department of computer science kyoto sangyo university, japan 2mathematics and statistics program louisiana tech university, u. Sphere packings, lattices and groups third edition with additional contributions by e.
Carl friedrich gauss proved that the highest average density that is, the greatest fraction of space occupied by spheres that can be achieved by a lattice packing is. There are other, subtler relationships between euclidean sphere packing and errorcorrecting codes. Given a large number of equal spheres, what is the most efficient sphere packings, lattices and groups springerlink. Sloane niemeier lattices nodes nonlattice packings nonzero notation obtained octad orthogonal padic permutation pgit. We now apply the algorithm above to find the 121 orbi. Although the book sphere packings, lattices and groups by conway and sloane deals mostly with infinite packings, it has an extensive bibliography that gives some references for the problem youre interested in too. Which groups are amenable to proving exponent two for matrix multiplication. The conwayhamming game involves a halfinfinite row of green apples, each of which can either point up or down. Each sphere that participates in a crystal structure has a coordination number, which corresponds to the number of spheres within the crystalline structure that touch the sphere that is being. In this paper we introduce reconstruction kernels for the 3d optimal sampling lattice and demonstrate a practical realisation of a few. I found this result while trying to understand the geometry of the space of lattices in rnin the limit when n. A lattice packing is a packing of rn equipped with the usual euclidean inner product by nonoverlapping spheres of maximumpossible equal radius centered at the points of a lattice k.
1434 192 795 487 1172 589 1662 1568 1434 664 1150 124 421 1637 554 495 899 195 1261 814 743 1192 1548 318 823 710 380 1097 241 59 1426 1279 1012 316 1401 1105 963 346 235 1487 1273 835 978