A proof of the Kepler conjecture

From MaRDI portal
Revision as of 02:24, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2494223

DOI10.4007/ANNALS.2005.162.1065zbMath1096.52010OpenAlexW2159130720WikidataQ55884843 ScholiaQ55884843MaRDI QIDQ2494223

Thomas C. Hales

Publication date: 19 June 2006

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4007/annals.2005.162.1065




Related Items (only showing first 100 items - show all)

Cell Shape Analysis of Random Tessellations Based on Minkowski TensorsAlgorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU FactorizationA FORMAL PROOF OF THE KEPLER CONJECTUREBirds on a wireIntroduction to rigorous numerics in dynamics: General functional analytic setup and an example that forces chaosA Computer Approach to Determine the Densest Translative Tetrahedron PackingsA rigorous study of possible configurations of limit cycles bifurcating from a hyper-elliptic Hamiltonian of degree fiveSimulation study of random sequential deposition of binary mixtures of lattice animals on a three-dimensional cubic latticeIrrationality and Transcendence Criteria for Infinite Series in Isabelle/HOLRandom sequential coveringUnique optima of the Delsarte linear programThe foundations of spectral computations via the solvability complexity index hierarchyThe BCC Lattice in a Long-Range Interaction SystemIsoperimetric problems for zonotopesGeneralized geometric criteria for the absence of effective many-body interactions in the Asakura–Oosawa modelDensity of triangulated ternary disc packingsMoment ratio inequality of bivariate Gaussian distribution and three-dimensional Gaussian product inequalityThe smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 verticesThe work of Maryna ViazovskaMathematics and the formal turnEmergence of Wulff-crystals from atomistic systems on the FCC and HCP latticesFrom sphere packing to Fourier interpolationEfficient algorithms for the dense packing of congruent circles inside a squareMaximal theta functions universal optimality of the hexagonal lattice for Madelung-like lattice energiesUnnamed ItemConic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022Computing Semigroups with Error ControlEntropic Trust Region for Densest Crystallographic Symmetry Group PackingsSome questions related to the reverse Minkowski theoremA quantitative stability result for the sphere packing problem in dimensions 8 and 24ON THE HARD SPHERE MODEL AND SPHERE PACKINGS IN HIGH DIMENSIONSPacking, tiling, and covering with tetrahedraEfficient Approximations for the Online Dispersion ProblemExtreme lattices: symmetries and decorrelationCovering and Packing with Spheres by Diagonal Distortion in ℝ nMinimal 𝑁-point diameters and 𝑓-best-packing constants in ℝ^{𝕕}Glass phenomenology in the hard matrix modelON A STRONG VERSION OF THE KEPLER CONJECTUREPacking congruent spheres into a multi‐connected polyhedral domainProof Checking and Logic ProgrammingDiscrete Fourier analysis on a dodecahedron and a tetrahedronEfficient Formal Verification of Bounds of Linear ProgramsDense crystalline dimer packings of regular tetrahedraEigenfunctions of the Fourier transform with specified zerosTheory of Quantum Computation and Philosophy of Mathematics. Part IIShapes of Delaunay Simplexes and Structural Analysis of Hard Sphere PackingsUnnamed ItemA Combinatorial Approach to Small Ball Inequalities for Sums and DifferencesBounds for several-disk packings of hyperbolic surfacesSocial processes, program verification and all thatCATEGORY-BASED CO-GENERATION OF SEMINAL CONCEPTS AND RESULTS IN ALGEBRA AND NUMBER THEORY: CONTAINMENT-DIVISION AND GOLDBACH RINGSExact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic WorkMetrically homogeneous graphs of diameter 3Upper bounds for packings of spheres of several radiiEstimates of the optimal density of sphere packings in high dimensionsWhy Monte Carlo Simulations Are Inferences and Not ExperimentsVarieties of mathematical understandingThe Significance of Relativistic Computation for the Philosophy of MathematicsAsymptotics of best-packing on rectifiable setsDual linear programming bounds for sphere packing via modular formsFormal Proofs for Nonlinear OptimizationAn isoperimetric problem for three-dimensional parallelohedraKähler packings and Seshadri constants on projective complex surfacesDensest geodesic ball packings to \({\mathbf S^2 \times \mathbf R}\) space groups generated by screw motionsOn computer-assisted proving the existence of periodic and bounded orbitsRotation invariant patterns for a nonlinear Laplace-Beltrami equation: a Taylor-Chebyshev series approachProof checking and logic programmingBusy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)Flyspeck II: The basic linear programsCrystallographic texture and group representationsHyperuniform states of matterFormalising mathematics -- in praxis; a mathematician's first experiences with Isabelle/HOL and the why and how of getting startedTypical ground states for large sets of interactionsHigh-dimensional sphere packing and the modular bootstrapSolution of the propeller conjecture in \(\mathbb R^3\)Big Math and the one-brain barrier: the tetrapod model of mathematical knowledgeApproximation on the Voronoi cells of the \(A_d\) latticeOptimal recovery of isotropic classes of twice-differentiable multivariate functionsGenerating candidate busy beaver machines (or how to build the zany zoo)The set of packing and covering densities of convex disksChecking ProofsSphere packing bounds via spherical codesA note on Schwartz functions and modular formsThe 3-ball is a local pessimum for packingRhombellane space fillingComputer-aided proof of Erdős discrepancy propertiesNew 3D geometrical deposition methods for efficient packing of spheres based on tangencyAsymptotically self-similar blowup of the Hou-Luo model for the 3D Euler equationsDEM Simulation of Random Loose Packings of Micron-Sized Particles with Both Adhesion and FrictionStudy of the Kepler's conjecture: the problem of the closest packingATP and presentation service for Mizar formalizationsPacking congruent hyperspheres into a hypersphereComputer-assisted proof of performance ratios for the differencing methodOn a computer-aided approach to the computation of Abelian integralsOn a generalization of Craig latticesContact numbers for congruent sphere packings in Euclidean 3-spacePerfect, strongly eutactic lattices are periodic extremeUpper bound on the packing density of regular tetrahedra and octahedraA candidate for the densest packing with equal balls in Thurston geometriesAutomated theorem provers: a practical tool for the working mathematician?







This page was built for publication: A proof of the Kepler conjecture