Fact-checked by Grok 2 weeks ago

Kepler conjecture

The Kepler conjecture is a theorem in geometry stating that no arrangement of congruent spheres in three-dimensional Euclidean space can achieve a greater density than the face-centered cubic (FCC) packing or its dual, the hexagonal close packing (HCP), both of which attain a maximum density of \pi / (3\sqrt{2}) \approx 0.74048.^[1]^[2] Formulated by the German mathematician and astronomer Johannes Kepler in his 1611 essay De nive sexangula (On the Six-Cornered Snowflake), the conjecture arose from observations of natural packings, such as those in fruit stacks or cannonballs, and posited that these intuitive arrangements represent the optimal configuration for minimizing wasted space.^[1]^[3] The conjecture remained unproven for nearly four centuries, despite early attempts and its inclusion as part of David Hilbert's 18th problem on crystal structure in 1900, highlighting its foundational role in discrete geometry and packing theory.^[3]^[4] In 1998, American mathematician Thomas C. Hales announced a proof using computer-assisted methods, including linear programming and exhaustive case analysis of possible sphere configurations, which was fully detailed in a series of papers culminating in a 2005 publication in the Annals of Mathematics.^[2]^[1] Due to the proof's complexity—spanning over 250 pages and relying on extensive computations—Hales initiated the Flyspeck project to formally verify it using automated theorem-proving software, achieving completion in 2014 and confirming the result with absolute rigor.^[1]^[4] This resolution not only settled one of mathematics' oldest open problems but also advanced computational geometry, demonstrating the viability of computer verification for intricate proofs in higher dimensions, with implications for materials science, coding theory, and crystallography where efficient sphere packings model atomic arrangements.^[3]^[4]

Background and Formulation

Sphere Packing Problem

The sphere packing problem involves arranging congruent non-overlapping spheres of equal radius in Euclidean space to maximize the proportion of space occupied by the spheres, known as the packing density.^[5] This arrangement ensures that the spheres touch but do not intersect interiors, with centers separated by at least twice the radius.^[5] The density \rho of a sphere packing is formally defined as the limit superior of the ratio of the total volume occupied by the spheres to the volume of the containing region as the region expands to infinity: \rho = \limsup_{V \to \infty} \frac{V_{\text{spheres}}}{V}, where V is the volume of a large bounded region and V_{\text{spheres}} is the volume of spheres within it.^[6] In practice, for periodic packings, this limit exists and equals the ratio of the sphere volume to the volume per sphere in the repeating unit cell.^[6] The study of sphere packings originated from motivations in crystallography, where efficient atomic arrangements model crystal structures, and in geometry, to understand spatial filling limits.^[7] Early examples include the simple cubic packing, where spheres align along a cubic grid, achieving a density of \pi/6 \approx 0.5236, and the denser hexagonal close packing, with density \pi/(3\sqrt{2}) \approx 0.7405.^[5] To derive the simple cubic density, consider spheres of radius r centered at integer lattice points with nearest-neighbor distance $2r

; the unit cell is a [cube](/page/Cube) of side &#36;2r

and volume $8r^3, containing one sphere of volume \frac{4}{3}\pi r^3, yielding \rho = \frac{\frac{4}{3}\pi r^3}{8r^3} = \frac{\pi}{6}.^[5] Three-dimensional sphere packing holds special significance due to the translational symmetry of Euclidean space \mathbb{R}^3, which favors lattice-based arrangements—periodic structures generated by translating a fundamental domain—often yielding the densest configurations, as seen in crystallographic applications.^[6] The Kepler conjecture specifically claims that no three-dimensional packing exceeds the density of the hexagonal close packing.^[5]

Statement of the Conjecture

The Kepler conjecture asserts that no packing of congruent spheres in three-dimensional Euclidean space can achieve a density greater than that of the face-centered cubic (FCC) lattice packing.^[2] This maximal density is given by

\frac{\pi}{3\sqrt{2}} \approx 0.74048,

which represents approximately 74% of the space filled by the spheres.^[2] The value arises from the geometry of the FCC unit cell, which contains four spheres of radius r. The edge length of this cubic cell is $2\sqrt{2} r, yielding a cell volume of (2\sqrt{2} r)^3 = 16\sqrt{2} r^3. The total volume occupied by the spheres in the cell is $4 \times \frac{4}{3} \pi r^3 = \frac{16}{3} \pi r^3, so the packing density is \frac{16/3 \pi r^3}{16\sqrt{2} r^3} = \frac{\pi}{3\sqrt{2}}.^[8] The FCC structure arranges sphere centers at the corners and face centers of a cubic lattice, resulting in each sphere touching 12 nearest neighbors (a coordination number of 12).^[9] An equivalent optimal packing is the hexagonal close packing (HCP), which achieves the same density through a different stacking sequence of close-packed planes: ABCABC for FCC versus ABAB for HCP.^[10] In both cases, the local arrangement forms layers of spheres in a hexagonal pattern, with each subsequent layer nesting in the depressions of the previous one, maximizing contacts while maintaining the \frac{\pi}{3\sqrt{2}} density.^[11] The conjecture implies that the FCC and HCP packings are uniquely optimal among all possible arrangements of equal spheres, such that any packing with density exceeding \frac{\pi}{3\sqrt{2}} is impossible.^[2] Kepler qualitatively inspired this formal statement in his 1611 treatise Strena Seu de Nive Sexangula (The Six-Cornered Snowflake), observing that pyramidal piles of oranges or cannonballs form hexagonal patterns with triangular interstices, suggesting a densest possible configuration.

Historical Development

Kepler's Proposal

Johannes Kepler (1571–1630) was a German astronomer, mathematician, and polymath renowned for his contributions to the Scientific Revolution, including the formulation of the three laws of planetary motion. Deeply influenced by ancient natural philosophy, particularly the Platonic ideal of geometric harmony in the cosmos, Kepler viewed the universe as structured according to divine mathematical principles. His early work, Mysterium Cosmographicum (1596), exemplified this by nesting Platonic solids between spheres to model planetary orbits, reflecting his belief that geometry underlay natural phenomena.^[12] In 1611, Kepler published Strena Seu de Nive Sexangula (A New Year's Gift, or On the Six-Cornered Snowflake), a short treatise dedicated to his patron, Johannes Matthäus Wacker von Wackenfels, which began as an exploration of the hexagonal symmetry observed in snowflakes. Drawing parallels to natural forms like pomegranate seeds and beehive honeycombs, Kepler transitioned from two-dimensional patterns to three-dimensional arrangements, intuiting that the hexagonal structure arose from the efficient packing of spherical particles, such as water molecules or atoms. This work marked the first explicit discussion of dense sphere packing in print, inspired by atomistic ideas from contemporaries like Thomas Harriot, though Kepler approached it through geometric and philosophical lenses rather than strict empiricism.^[13]^[14] Kepler's qualitative argument centered on the natural tendency of equal spheres to minimize empty space when compressed. In a single layer, he reasoned, spheres arrange in a hexagonal lattice, with each touching six neighbors, as this configuration—familiar from fruit stands or tiled floors—avoids the gaps inherent in square packing. For stacking layers, Kepler described how the next tier settles into the dimples or voids formed by the lower one, either in tetrahedral or octahedral positions, yielding a pyramidal structure like stacked cannonballs where interior spheres touch twelve others. He emphasized that this close packing, whether cubic or hexagonal in overall form, represented the most compact solid possible, stating that "the [cubic or hexagonal close] packing will be the tightest possible, so that in no other arrangement more spheres could be packed into the same volume."^[13]^[15]^[14] Kepler offered no rigorous mathematical proof for his intuition, presenting it instead as a conjecture grounded in observation and philosophical reasoning about nature's economy. His ideas drew from everyday examples, such as grocers' displays of oranges or military stacks of cannonballs, to illustrate efficient space-filling without delving into calculations.^[13] In the 17th and 18th centuries, Kepler's proposal gained traction among natural philosophers, who endorsed the close-packing arrangement as a model for crystalline structures and matter. René Descartes incorporated similar geometric packings into his vortex theory of light and planetary motion, while Christiaan Huygens referenced dense sphere arrangements in Traité de la Lumière (1690) to describe the ether as composed of closely packed particles explaining refraction and crystal properties. Despite this acceptance, no mathematical progress toward verifying the conjecture emerged during this period, leaving it as an influential but unproven assertion.^[14]

Attempts from the 19th to Mid-20th Century

In the 19th century, mathematicians began applying rigorous analytical methods to packing problems, drawing analogies from lower dimensions to inform the three-dimensional case. Norwegian mathematician Axel Thue made significant progress on the two-dimensional analogue by proving in 1910 that the hexagonal lattice packing of circles achieves the maximum density of \pi / \sqrt{12} \approx 0.9069, optimal among all possible arrangements without assuming a lattice structure.^[16] This result, building on his earlier 1890 attempt, provided a model for denser configurations and inspired extensions to sphere packing in three dimensions, though Thue did not fully resolve the 3D problem.^[16] Related to local structure in sphere packings, the Gregory-Newton problem—posed in the late 17th century concerning the maximum number of equal spheres touching a central one—saw partial resolutions in the 19th century that established key bounds on contacts. The problem was fully resolved in 1953 by Kurt Schütte and Bartel Leendert van der Waerden, who proved that exactly 12 spheres can touch a central one in three dimensions, confirming the local structure of the FCC packing.^[17] Studies during this period demonstrated that the average number of neighboring spheres (coordination number) in any dense packing cannot exceed 12, a limit derived from topological considerations of the dual graph and Euler's polyhedral formula applied to Voronoi cells.^[18] This average bound aligned with the 12 contacts in the face-centered cubic (FCC) arrangement, supporting the conjecture's local feasibility but not proving global optimality. Crystallographic investigations from the 1830s to 1900s further bolstered empirical acceptance of the FCC structure. In 1883, William Barlow proposed close-packed atomic models, identifying the FCC lattice as a natural arrangement for metals and compounds like alkali halides, based on symmetry and sphere-packing efficiency.^[19] Observations of metallic crystals, such as copper and aluminum, consistently revealed patterns consistent with FCC packing, reinforcing the conjecture through physical evidence without a mathematical proof.^[19] Advancing into the mid-20th century, Hungarian mathematician László Fejes Tóth provided foundational partial results in the 1940s and 1950s. In 1953, he proved that the FCC packing is locally optimal, meaning no finite cluster of spheres can achieve a higher density than the FCC arrangement within that cluster.^[13] Fejes Tóth also developed upper bound techniques using area and volume arguments on Voronoi decompositions, establishing inequalities such as \rho \leq \pi / \sqrt{18} \approx 0.74048 for certain classes of packings, though global equality required analysis beyond finite or local cases.^[13] These efforts reduced the Kepler conjecture to checking a finite (albeit large) number of configurations, paving the way for later computational approaches while highlighting the challenge of irregular global arrangements.

Progress in the Late 20th Century

Theoretical advances in the mid-20th century included C. A. Rogers' 1958 upper density bound of approximately 77.8% using a tetrahedral decomposition.^[20] In the 1960s and 1970s, László Fejes Tóth built on such work using Voronoi cells to derive improved bounds for certain packings while emphasizing the role of local configurations in global density limits. He further suggested in 1965 that verifying the conjecture might involve exhaustive analysis of finite clusters involving around 150 variables, foreshadowing computational strategies. Meanwhile, experimental confirmations by J.D. Bernal and G.D. Scott in the 1950s–1960s reinforced the face-centered cubic (FCC) packing's empirical density of \pi / \sqrt{18} \approx 74.05\%, providing a baseline for theoretical efforts. The late 1970s saw innovations in local analysis tools with broader applicability. Andrew Odlyzko and Neil J.A. Sloane developed a polynomial-based method in 1979 to establish upper bounds on kissing numbers, such as 24–25 in four dimensions, which informed three-dimensional local density constraints by linking sphere contacts to combinatorial optimization. This approach complemented graph-theoretic explorations by John Conway and Sloane in their 1988 book Sphere Packings, Lattices and Groups, where contact graphs of sphere arrangements were analyzed to affirm the FCC lattice's local optimality and to catalog known dense packings. Conway's 1982 lecture on the conjecture further stimulated interest, highlighting its reduction to finite graph enumerations. Computational progress accelerated in the 1980s, with simulations enumerating optimal finite packings up to several thousand spheres, consistently showing no configurations denser than the FCC arrangement and supporting the absence of local violations. The debate over "sausage" (linear) versus "slices" (clustered) arrangements for finite packings was resolved in three dimensions during this period, with studies demonstrating that clustered forms outperform linear ones for sufficiently large numbers of spheres, aligning with infinite packing expectations. By the early 1990s, these efforts narrowed the theoretical gap, as seen in Doug Muder's 1993 proof of an upper density bound of 77.306% using Voronoi cell modeling. In the mid-1990s, partial results targeted specific packing classes, including proofs that orthorhombic arrangements could not exceed FCC density, while Jeffrey Lagarias advanced local density inequalities for translative packings, providing rigorous upper bounds that reduced the problem's scope. Thomas Hales' 1990 introduction of Delaunay triangulation decomposed arbitrary packings into finite simplices for density evaluation, enabling the identification of potential counterexamples like the pentagonal prism at 74.08% density and setting the stage for exhaustive finite checks. Contributions from Gábor Fejes Tóth integrated graph theory with Voronoi decompositions to constrain contact networks, collectively establishing that the conjecture hinged on verifying a finite set of configurations.

Hales' Proof and Verification

Overview of the 1998 Proof

In 1998, Thomas C. Hales announced a proof of the Kepler conjecture through a series of preprints, culminating in the full publication in 2005 in the Annals of Mathematics as "A proof of the Kepler conjecture."^[2] This work established that the maximum density of a packing of congruent spheres in three-dimensional Euclidean space is \pi / \sqrt{18} \approx 0.74048, achieved by the face-centered cubic (FCC) and hexagonal close packings.^[2] Building on prior reductions from the late 20th century that bounded the problem to finite cases, Hales' strategy employed a combination of graph theory, linear programming, and exhaustive case analysis to derive a contradiction for any packing exceeding this density.^[13] The core method involves decomposing the space around a sphere packing into a triangulation using Delaunay simplices, which partition the ambient space into tetrahedra and other simplicial cells containing the spheres.^[2] Hales proves that any optimal packing must be contained within such a triangulation, allowing the global density to be bounded by the average density across these cells.^[13] Specifically, the proof shows that the volume per sphere in each cell type is at least as large as in the FCC packing, ensuring the overall density \rho satisfies \rho \leq \pi / \sqrt{18}.^[2] To achieve this, Hales and Ferguson classify several thousand tame plane graphs representing possible local configurations up to isomorphism and apply volume inequalities to derive bounds for each.^[13]^[2] For a hypothetical counterexample with \rho > \pi / (3\sqrt{2}), the triangulation leads to a contradiction via aggregated volume arguments that exceed the FCC bound.^[2] Hales manually established the majority of these inequalities through geometric and algebraic analysis, while delegating the exhaustive enumeration of approximately $10^5 configurations—arising from linear programming relaxations over planar graphs representing cell clusters—to computer-assisted verification.^[13]

Computer Assistance and Key Techniques

The computational backbone of Hales' proof involved an exhaustive search over possible realizations of sphere centers, represented as graphs in three-dimensional space, to verify local density bounds. Custom software classified thousands of tame plane graphs up to isomorphism, focusing on configurations near the face-centered cubic and hexagonal close packings, while eliminating those exceeding the target density.^[2] Interval arithmetic was integral to this process, providing rigorous enclosures for floating-point computations and ensuring that verified inequalities held within error bounds smaller than 10^{-8}, thus avoiding precision-related failures.^[2] Key techniques centered on linear programming relaxations to bound the density function σ in simplices formed by four mutually tangent spheres. These relaxations approximated nonlinear optimization problems by linear constraints, allowing efficient computation of upper bounds on σ, such as σ(D) < 8πt for relevant domains D, where t is the simplex thickness; the commercial solver CPLEX was employed for this purpose.^[2] Branch-and-bound algorithms complemented these by systematically enumerating subcases—such as divisions of decomposition stars into triangular and quadrilateral regions—refining bounds when single linear programs proved inconclusive and covering the remaining configurations.^[2] The implementation relied on custom C programs, totaling approximately 50,000 lines of code, for tasks including graph generation, inequality checking, and case analysis; these were executed on standard workstations, requiring about three months of continuous runtime to process the workload.^[21]^[22] Roughly 10^5 linear programs were solved, alongside hundreds of nonlinear inequalities verified via interval methods, confirming no violations of the density threshold.^[2] Significant challenges arose in the error-prone classification of over 10,000 graph types, where subtle geometric distinctions demanded meticulous programming to avoid omissions or misclassifications. These computations, while informal, laid the groundwork for subsequent formal verification efforts and successfully demonstrated that every admissible local configuration achieves a density at most π/√18, with equality only for the optimal packings.^[2]

Formal Verification Efforts

Although Hales' 1998 proof of the Kepler conjecture was ultimately accepted for publication in the Annals of Mathematics, the extensive reliance on computer calculations led to significant skepticism among referees, who struggled to independently verify the computational components despite forming a panel of twelve experts.^[23] The editors required additional independent checks before publication, which was delayed until 2005–2006, highlighting broader concerns in the mathematical community about the reliability of computer-assisted proofs at the time.^[24] In response to these issues, Thomas Hales launched the Flyspeck project in 2003 to produce a fully formal, machine-checkable proof of the conjecture using interactive theorem provers.^[24] The project involved translating the original proof's mathematical content and computer code into verifiable formal languages, culminating in a complete verification after over a decade of collaborative effort. Key milestones included a partial formal verification in 2006 of the major code components, such as the classification of local sphere configurations, achieved by Gertrud Bauer and Tobias Nipkow using the Isabelle prover.^[24] The project expanded internationally in 2009 and reached completion in 2014, resulting in the publication of "A Formal Proof of the Kepler Conjecture" in 2017, which details the verified proof across more than 500,000 lines of code in HOL Light and Isabelle. Central techniques in Flyspeck included encoding the geometry of sphere packings within constructive mathematics frameworks to ensure machine readability, alongside automated case analysis for enumerating configurations using satisfiability modulo theories (SMT) solvers to handle nonlinear inequalities.^[24] These methods allowed for rigorous checking of the proof's combinatorial and analytic elements without manual recomputation. The Flyspeck verification marked the first formal machine proof of a major theorem in classical geometry, establishing a benchmark for the reliability of computer-assisted mathematics and rendering earlier concerns about the 1998 proof obsolete; as of 2025, it remains the accepted standard proof of the Kepler conjecture.

Higher-Dimensional Packings

The Kepler conjecture generalizes to higher-dimensional Euclidean spaces as the problem of determining the maximum density of a packing of equal spheres in \mathbb{R}^n for n > 3. Unlike the three-dimensional case, where the face-centered cubic lattice achieves the optimal density of \pi / \sqrt{18} \approx 0.7405, the analogous problem remains unsolved for most dimensions greater than three, with only specific cases resolved. Lattice packings, which arrange sphere centers on a regular grid, are often candidates for optimality, but proving this requires showing no non-lattice packing exceeds their density.^[25] In two dimensions, the problem reduces to circle packing, where Axel Thue proved in 1910 that the hexagonal lattice provides the densest arrangement, achieving a density of \pi / \sqrt{12} \approx 0.9069. This result, later rigorized by László Fejes Tóth in 1940, establishes a benchmark for low dimensions and confirms that no arrangement of equal circles in the plane surpasses this density. For four dimensions, partial results exist: the D_4 lattice yields a density of approximately 0.6168, and linear programming bounds from Cohn and Elkies (2003) provide an upper limit of about 0.6235, but the optimality of D_4 or any packing remains unproven.^[16]^[25] Significant progress occurred in dimensions eight and twenty-four. In dimension eight, the E_8 lattice packing has a density of \pi^4 / 384 \approx 0.2537, and Cohn and Elkies (2003) derived an upper bound matching this value up to negligible error, strongly suggesting optimality; this was rigorously proven by Maryna Viazovska in 2016 using modular forms to construct a suitable auxiliary function that certifies no denser packing exists. Similarly, in dimension twenty-four, the Leech lattice achieves a density of \pi^{12} / 12! \approx 0.00193, with Cohn and Elkies (2003) providing a matching upper bound; Viazovska, along with Henry Cohn, Abhinav Kumar, Stephen D. Miller, and Danylo Radchenko, extended the modular forms approach in 2017 to prove this is indeed the optimal density. These results highlight the exceptional symmetry of the E_8 and Leech lattices in their respective dimensions.^[25]^[26]^[27] For general n, upper bounds demonstrate that packing densities decay exponentially with dimension. Kabatiansky and Levenshtein (1978) established a seminal bound of \rho \leq 2^{-0.599n} for large n, using spherical codes and zonal functions to limit possible configurations, which implies that the maximum density approaches zero as n increases. This bound remains the best asymptotic upper limit in high dimensions, underscoring the challenge of maintaining high densities beyond low dimensions. (Note: Direct PDF link inferred from MathNet; abstract at https://www.mathnet.ru/eng/ppi1518) As of 2025, the Kepler analog lacks full proofs for dimensions four through seven, though computational searches and improved bounds suggest that lattice packings, such as D_4 in four dimensions, are likely optimal. Ongoing efforts focus on adapting techniques like modular forms and linear programming to these intermediate dimensions, but the exponential drop in density and increasing complexity continue to pose formidable obstacles.^[25]

Other Sphere Packing Variants

Variants of the sphere packing problem arise when spheres of unequal radii are considered, relaxing the assumption of identical sizes in the Kepler conjecture. One prominent example is the Tammes problem, which seeks the arrangement of N equal non-overlapping spherical caps on the surface of a unit sphere to maximize the minimum angular separation between their centers, effectively modeling the packing of equal spheres on a curved two-dimensional manifold. This configuration has applications in virology, where it approximates the optimal distribution of protein subunits on viral capsids to maximize stability.^[28] For unequal spheres in three-dimensional space, the average number of touching neighbors in a packing is approximately 6 in disordered arrangements, lower than the kissing number of 12 for equal spheres around a central one, reflecting reduced coordination due to size variability.^[29] Recent progress in 2025 has advanced understanding of kissing configurations in higher dimensions using novel approaches.^[30] Finite sphere packings differ from the infinite lattices of the Kepler setting by considering bounded collections of spheres, where optimality is measured by the minimal enclosing volume. The cannonball problem addresses stacking equal spheres into a square pyramid with a square base, where the total number of spheres must form a perfect square; Édouard Lucas proved in 1875 that only base sizes of 1 and 24 layers yield such pyramids, containing 1 and 4900 spheres, respectively, highlighting constraints absent in infinite packings.^[31] Another key phenomenon is the sausage catastrophe, identified by Betke, Henk, and Wills in the early 1990s, which describes the abrupt shift in optimal finite packings in three dimensions: for up to 56 spheres, a linear "sausage" arrangement minimizes volume more effectively than clustered configurations, but beyond this threshold, three-dimensional clusters become denser, challenging intuitions from infinite Euclidean packings.^[32] In curved geometries, sphere packings can achieve densities surpassing the Euclidean limit of \pi / \sqrt{18} \approx 0.74. On the sphere, the Tammes problem inherently involves positive curvature, where finite packings of caps yield configurations like the icosahedral arrangement for 12 points, with angular distances exceeding those in flat space. In hyperbolic space, negative curvature allows for horocyclic packings or lattice-based arrangements that fill space more densely, enabling packings where spheres touch more neighbors on average than in Euclidean space. These variants find practical applications beyond pure geometry. In materials science, unequal sphere packings model colloidal suspensions, where polydisperse particles self-assemble into structures like random close packings with densities around 0.64, influencing the design of photonic crystals and glasses by optimizing void fractions for light manipulation or mechanical properties.^[33] In coding theory, sphere packings provide bounds for error-correcting codes, where the Hamming bound equates code capacity to the density of non-overlapping spheres in discrete spaces, enabling constructions like Leech lattice-derived codes that achieve near-optimal error correction in high-dimensional data transmission.^[34] Unlike the Kepler conjecture's focus on equal spheres in infinite flat space achieving maximal density via lattices, these variants often yield suboptimal densities under relaxed constraints; for instance, random close packings of equal spheres, which approximate amorphous solids, stabilize at approximately 0.64 density, below the crystalline \pi / \sqrt{18}, due to the absence of long-range order.^[35]

References

[1]
Kepler Conjecture -- from Wolfram MathWorld
This assertion is known as the Kepler conjecture. Finding the densest (not necessarily periodic) packing of spheres is known as the Kepler problem.
[2]
[PDF] A proof of the Kepler conjecture - Annals of Mathematics
The Kepler conjecture is an optimization problem in an in- finite number of variables (the coordinates of the points of Λ). The maximiza- tion of σ on DS is an ...
[3]
A FORMAL PROOF OF THE KEPLER CONJECTURE
This conjecture is the oldest problem in discrete geometry. The Kepler conjecture forms part of Hilbert's 18th problem, which raises questions about space ...
[4]
The Formal Proof of the Kepler Conjecture: a critical retrospective
Feb 12, 2024 · The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic ...
[5]
Sphere Packing -- from Wolfram MathWorld
Define the packing density eta of a packing of spheres to be the fraction of a volume filled by the spheres. In three dimensions, there are three periodic ...
[6]
[PDF] Tables of Sphere Packings and Spherical Codes - Neil Sloane
The density A of any (lattice or nonlattice) sphere packing is, loosely speaking, the fraction of the space R” that is covered by the spheres. For a lattice ...
[7]
[PDF] REVIEWS - UT Math
) As noted by Hilbert, the crystallographic groups in E3 were classi- fied in the nineteenth century, motivated in part by sphere packing and its connection.
[8]
Derivation of the packing density - tec-science
May 26, 2018 · Packing density is the ratio of atomic volume within a unit cell to the total volume of the unit cell, calculated as PD=VAVU.
[9]
Primary Metallic Crystalline Structures - NDE-Ed.org
The coordination number of the atoms in this structure is 12. There are six nearest neighbors in the same close packed layer, three in the layer above and three ...
[10]
Close Packed Structures: fcc and hcp - Physics in a Nutshell
The closest packing of spheres in two dimensions is realised by a hexagonal structure: Each sphere is in contact with six neighboured spheres.Missing: simple | Show results with:simple
[11]
[PDF] SPHERE PACKINGS, LATTICES AND GROUPS Material for Third ...
Sep 16, 1998 · packings, see below) with the same density as the f.c.c. lattice packing. In [Schn98] it is shown that large finite subsets of the f.c.c. ...
[12]
Johannes Kepler - Stanford Encyclopedia of Philosophy
May 2, 2011 · Johannes Kepler (1571–1630) is one of the most significant representatives of the so-called Scientific Revolution of the 16 th and 17 th centuries.Missing: polymath | Show results with:polymath
[13]
Cannonballs and Honeycombs, Volume 47, Number 4
The two-dimensional version of Kepler's conjecture asks for the densest packing of unit disks in the plane. If we inscribe a disk in each hexagon in the.
[14]
None
Summary of each segment:
[15]
In retrospect: On the Six-Cornered Snowflake - Nature
Dec 21, 2011 · Kepler asserted that hexagonal packing “will be the tightest possible, so that in no other arrangement could more pellets be stuffed into the ...Missing: Strena Seu
[16]
[PDF] A Simple Proof of Thue's Theorem on Circle Packing - arXiv
Sep 22, 2010 · Theorem 3 (Axel Thue) The hexagonal lattice is the densest of all possible circle packings. References. [1] B. Delaunay, Sur la sph`ere vide, ...Missing: optimality 1890
[17]
[PDF] Contact numbers for sphere packings - arXiv
Jan 22, 2016 · The problem originated in the 17th century from a disagreement between Newton and Gregory about how many 3-dimensional unit spheres without ...
[18]
[PDF] History of Crystal Structure Theory
Crystal structure theory includes early 19th-century work, Louis Pasteur's 1848 discovery, and the 1912 x-ray diffraction discovery by Max von Laue.
[19]
In Computers We Trust? | Quanta Magazine
Feb 22, 2013 · In 1998, Thomas Hales astounded the world when he used a computer to solve a 400-year-old problem called the Kepler conjecture. The ...<|control11|><|separator|>
[20]
Pitt professor solves math mystery - The Pitt News
Nov 26, 2012 · Hales earned this distinction for his work on the Kepler Conjecture ... Kepler proposed the cannonball arrangement in 1611 as the ...
[21]
Thomas Hales: The Proof of the Proof - Pittsburgh Quarterly
After more than a decade of work, Hales had completed a proof of the Kepler conjecture, a centuries-old conundrum about how best to pack together three- ...<|control11|><|separator|>
[22]
[1501.02155] A formal proof of the Kepler conjecture - arXiv
Jan 9, 2015 · This article describes a formal proof of the Kepler conjecture on dense sphere packings in a combination of the HOL Light and Isabelle proof assistants.Missing: verification | Show results with:verification
[23]
[PDF] New upper bounds on sphere packings I - Annals of Mathematics
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the.
[24]
[1603.04246] The sphere packing problem in dimension 8 - arXiv
Mar 14, 2016 · In this paper we prove that no packing of unit balls in Euclidean space \mathbb{R}^8 has density greater than that of the E_8-lattice packing.
[25]
[1603.06518] The sphere packing problem in dimension 24 - arXiv
Mar 21, 2016 · Building on Viazovska's recent solution of the sphere packing problem in eight dimensions, we prove that the Leech lattice is the densest ...Missing: n= 2018
[26]
From the separable Tammes problem to extremal distributions of ...
Jan 26, 2022 · The separable Tammes problem asks for the largest density of given number of congruent spherical caps forming a TS-packing in \mathbb{S}^2.
[27]
[1601.00145] Contact numbers for sphere packings - arXiv
Jan 2, 2016 · In this paper, we investigate the problem in general and emphasize important special cases including contact numbers of minimally rigid and totally separable ...
[28]
[PDF] Lucas' Square Pyramid Problem Revisited
Abstract. We discuss positive integer solutions to Diophantine equa- tions of the shape x(x + 1)(x + 2) = ny2, where n is a fixed positive integer.Missing: cannonball stacking
[29]
Spheres and Sausages, crystals and catastrophes- and a joint ...
Spheres and Sausages, crystals and catastrophes- and a joint packing theory ... Betke, M. Henk, and J.M. Wills, Finite and infinite packings, J. Reine ...
[30]
Relevance of packing to colloidal self-assembly - PMC - NIH
Since the 1920s, packing arguments have been used to rationalize crystal structures in systems ranging from atomic mixtures to colloidal crystals. Packing ...
[31]
Sphere Packing and Error-Correcting Codes | SpringerLink
Error-correcting codes are used to construct dense sphere packings in n-dimensional Euclidean space R n, and other packings are obtained by taking ...
[32]
Random-close packing limits for monodisperse and polydisperse ...
For monodisperse spheres, random-close packing (RCP) is around φ ≈ 0.64. For polydisperse spheres, RCP is determined with log-normal sphere radii distributions.