The third edition of this book continues to pursue the question, what is the most efficient way to pack a large number. Im going to start by describing a game that seems completely unrelated to sphere packing. Related to both symmetry numbers and chirality are point groups. Sphere packings, lattices and groups by john conway, 97814419344, available at book depository with free delivery worldwide. It has minimum norm 4 whereas the others have minimum norm 2. From errorcorrecting codes through sphere packings to simple. 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. Sphere packing problems have a rich history in both mathematics and physics. The program allows hardsphere packing generation and packing postprocessing see the sphere packing and the randomclose packing wikipedia pages it supports the lubachevskystillinger, jodreytory, and forcebiased generation algorithms. Figure 1 the hexagonal lattice and the corresponding circle packing. The third edition of this book continues to pursue th.
Random perfect lattices and the sphere packing problem. 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. 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. There are two sphere packings, one in eight dimensions, the e 8 lattice, and one in twentyfour dimensions, the leech lattice a, which are unexpectedly good and very 24 symmetrical packings, and have a number of remarkable and mysterious properties, not all of which are completely understood even today. Sphere packings, lattices and groups john conway springer. In most dimensions, the best sphere packings discovered to date didnt even come close to the density limits this method generated. Both have remarkable nite isometry groups and give sphere packings of. Within a crystalline material, each atom can be thought of as a sphere. Some lattices are really good ones, notably the e 8lattice in dimension 8 and the leech lattice in dimension 24. We will study the best currently known algorithms to solve the most important lattice problems, and how lattices are used in several representative applications.
Groups and lattices, which will include two earlier papers con36 and. 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 evaluated. Thus even modest improvements are hopefully not without interest. Mathematicians have been studying sphere packings since at least 1611, when johannes kepler conjectured that the densest way to pack together equalsized spheres in space is the familiar pyramidal piling of oranges seen in grocery stores.
The phases of hard sphere systems tutorial for spring 2015 icerm workshop crystals, quasicrystals and random networks. Kumar was supported by a summer internship in the theory group at microsoft. A key result needed for this was the determination of the covering radius of the leech lattice and the enumeration of the deep holes in that lattice 16, ch. Sphere packings, lattices and groups this is the third edition of this reference work in the literature on sphere packings and related subjects. The phases of hard sphere systems cornell university. Recently, the 7sphere s7 has been the subject of increased interest for mathematicians and theoretical physicists.
The fcc and hcp packings are the densest known packings of equal spheres with the highest symmetry smallest repeat units. Lattice packings of spheres kaplan background packings in two and three dimensions lattices lattice packings in dimensions two and three hermite, mordell, and voronoi poisson summation and n 24 lattice packings of spheres nathan kaplan harvard university cambridge, ma. Given a large number of equal spheres, what is the most efficient or densest way to pack them together. Sphere packings and lattices amsi vacation research. December 2, 2010 kaplan lattice packings of spheres.
There is one special one, the leech lattice, discovered by john leech in the mid 1960s in his study of sphere packings. The best sphere packings currently known are not always lattice. For example, the binary golay code is closely related to the 24dimensional leech lattice. Splag sphere packings, lattices and groups acronymfinder. These include the use of finite groups and sphere packings in highdimensional spaces for the design. This would imply that disorder wins over order in sufficiently high dimensions. But after some experimenting, you might find that some arrangements are better than others.
In this paper we prove an asymptotic lower bound for the sphere packing density in dimensions divisible by four. This asymptotic lower bound improves on previous asymptotic bounds by a constant factor and improves. 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. Sphere packings, lattices and groups 1988, springerverlag. Random perfect lattices and the sphere packing problem a. See also his list of spherepacking and lattice theory publications. Sphere packings, lattices and fruits complex projective 4space. Denser sphere packings are known, but they involve unequal sphere packing. Figure 5, showing the energy pdf for perfect lattices in d 819 is presented here for. Henry cohn iap math lecture series january 16, 2015. We now apply the algorithm above to find the 121 orbits of norm 2 vectors from the known nann 0 vectors, and then apply it again to find the 665 orbits of nann 4 vectors from the vectors of nann 0 and 2.
Multisized sphere packing louisiana tech university. For further details on these connections, see the book sphere packings, lattices and groups by conway and sloane. Lattices, sphere packings, spherical codes and energy minimization abhinav kumar mit november 10, 2009 2. There are two sphere packings, one in eight dimensions, the e 8 lattice, and one in twentyfour dimensions, the leech lattice a, which are unexpectedly good and very 24 symmetrical packings, and have a number of remarkable and mysterious properties, not all. Inevitably there will be some empty space, since spheres do not fit perfectly together. Sphere packing solved in higher dimensions a ukrainian mathematician has solved the centuriesold spherepacking problem in dimensions eight and 24. In this paper we give several general constructions for lattice packings of spheres in real wdimensionalw spac and complee r x space cn. Sphere packing bound how is sphere packing bound abbreviated. Improved sphere packing lower bounds from hurwitz lattices stephanie vance abstract.
Dec 01, 1987 sphere packings, lattices and groups book. This is a translation of the first edition of sphere packings, lattices and groups into russian 2 volume set. The conwayhamming game involves a halfinfinite row of green apples, each of which can either point up or down. Sphere packings chuanming zong springer to peter m. In the onedimensional sphere packing problem, the spheres are simply line segments. By erica klarreich in a pair of papers posted online this month, a ukrainian mathematician has solved two highdimensional versions of the centuriesold sphere packing problem. See also his list of sphere packing and lattice theory publications. Recently, lattices have also attracted much attention as a source of computational hardness for the design of secure cryptographic functions. 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.
I found this result while trying to understand the geometry of the space of lattices in rnin the limit when n. Here are some entries that looked relevant, although i havent read them. Optimality and uniqueness of the leech lattice among lattices. They naturally occur in many settings, like crystallograph,y sphere packings stacking oranges, etc. Implications for colloidal crystal nucleation robert s. Ann arbor, mi 48109 abstract in this elementary talk, we introduce basics about rational lattices and give examples. All homogeneous sphere packings and all interpenetrating layers of spheres were derived that refer to the 18 orthorhombic trivariant lattice complexes with mirror symmetry.
Sphere packings, lattices, and groups by conway, john horton. The leech lattice has very large isometry group and displays rich combinatorics. Dense packings of equal discs on the surface of the 2 sphere, are more. 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. This weeks finds in mathematical physics week 20 john baez.
Lattices lattice packings in dimensions two and three hermite, mordell, and voronoi poisson summation and n 24 sphere packings how can we most e ciently pack spheres of xed radius in ndimensional space. These lead to denser lattice packings than any previously known in r36, r64, r80. Here is an active link to the database of lattices mentioned on page xvi. Sphere packing solved in higher dimensions quanta magazine.
There are other, subtler relationships between euclidean sphere packing and errorcorrecting codes. The laminated lattice in ndimensional space is constructed from that in n1dimensional space by a layering operation similar to that we just outlined. This book is mainly concerned with the problem of packing spheres in euclidean space of dimensions 1,2,3,4,5. Highaccuracy semidefinite programming bounds for kissing numbers mittelmann, hans d. Feb 01, 20 im going to start by describing a game that seems completely unrelated to sphere packing. 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. Page of links to other pages, collected by anton sherwood. Groups and lattices, which will include two earlier papers con36 and con37 not.
This suggests that the relevant modular group is the congruence subgroup. Daniele micciancio ucsd cse lattices are regular arrangements of points in euclidean space. Publication date 1999 topics combinatorial packing and covering, finite groups, lattice theory, sphere publisher. Sloane 1 the sphere packing problem i i packing ball bearings 1. In any configuration, all but finitely many green apples occasionally referred to as grapples point upwards. Mar 30, 2016 in every dimension, cohn and elkies showed, there is an infinite sequence of auxiliary functions that can be used to compute upper limits on how dense sphere packings are allowed to be in that dimension. The latest version of the table of record packing densities is available on the web at the database of lattices web site. Without going into details see sphere packings, lattices and groups by. I think ill depart from my usual concerns this week and talk about a book id been meaning to get my hands on for ages. 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. Lattice packings of spheres kaplan background packings in two and three dimensions lattices lattice packings in. The best sphere packings currently known are not always lattice packings, but many good packings are.
A packing density of 1, filling space completely, requires nonspherical shapes, such as honeycombs. Packing index of subsets in polish groups banakh, taras, lyaskovska, nadya, and repovs, dusan, notre dame journal of formal logic, 2009. What are all the best sphere packings in low dimensions. Each sphere that participates in a crystal structure has a coordination number, which corresponds to the number of spheres within the crystalline.
Polyhedra and packings from hyperbolic honeycombs ncbi. In addition to the content of the preceding editions, the present edition provides in its preface a detailed survey on recent. In geometry, closepacking of equal spheres is a dense arrangement of congruent spheres in an infinite, regular arrangement or lattice. Sloane, sphere packings, lattices and groups springerverlag, new york, 1998. The full preface to the third edition is also available, in postscript or pdf format. Sloane contents preface to first edition v preface to second edition xv list of symbols xxx chapter 1 sphere packings and kissing numbers j. Sphere packings, lattices and fruits complex projective. Sphere packings, lattices and groups pdf free download. The intuition for the kepler conjecture can be shown by the following construction of the fcc structure see figure, which shows the relationship with the densest one and two dimensional sphere packings. In any configuration, all but finitely many green apples occasionally referred to as grapples. These lattices ha v e a greater densit y than an y previously kno wn in dimensions from ab out 80 to 4096, and.
174 989 675 930 1073 47 499 637 1006 482 403 156 174 776 1017 369 780 1323 893 1150 1257 1056 502 315 685 1499 654 918 6 393 1481 6 1280 1405 1496 192 398 1199 229 192 764 264 1255 750 630 114 642