Martin Henk
We show that for every lattice packing of $n$-dimensional spheres there exists an $(n/\log_2(n))$-dimensional affine plane which does not meet any of the spheres in their interior, provided $n$ is large enough. Such an affine plane is called a free plane and our result improves on former bounds.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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 not just lower bounds for the sphere packing density, but also for the lattice sphere packing density and, in fact, the Hurwitz lattice sphere packing density.
We prove upper bounds on the average kissing number $k(\mathcal{P})$ and contact number $C(\mathcal{P})$ of an arbitrary finite non-congruent sphere packing $\mathcal{P}$, and prove an upper bound on the packing density $δ(\mathcal{P})$ of an arbitrary infinite non-congruent sphere packing $\mathcal{P}$.
In an Euclidean $d$-space, the container problem asks to pack $n$ equally sized spheres into a minimal dilate of a fixed container. If the container is a smooth convex body and $d\geq 2$ we show that solutions to the container problem can not have a ``simple structure'' for large $n$. By this we in particular find that there exist arbitrary small $r>0$, such that packings in a smooth, 3-dimensional convex body, with a maximum number of spheres of radius $r$, are necessarily not hexagonal close packings. This contradicts Kepler's famous statement that the cubic or hexagonal close packing ``will…
We study the relationship between local and global density for sphere packings, and in particular the convergence of packing densities in large, compact regions to the Euclidean limit. We axiomatize key properties of sphere packing bounds by the concept of a packing bound function, and we study the special case of sandwich functions, which give a framework for inequalities given by the Lovász sandwich theorem. We show that every packing bound function tends to a Euclidean limit on rectifiable sets, generalizing the work of Borodachov, Hardin, and Saff. Linear and semidefinite programming bound…
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 density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.
In "Dense Sphere Packings: A Blueprint for Formal Proofs" Hales proves that for every packing of unit spheres, the density in a ball of radius $r$ is at most $π/\sqrt{18}+c/r$ for some constant $c$. When $r$ tends to infinity, this gives a proof to the famous Kepler conjecture. As formulated by Hales, $c$ depends on the packing. We follow the proofs of Hales to calculate a constant $c'$ independent of the sphere packing that exists as mentioned in "A Formal Proof of the Kepler Conjecture" by Hales et al..
The topic of totally separable sphere packings is surveyed with a focus on regular constructions, uniform tilings, and contact number problems. An enumeration of all regular totally separable sphere packings in $\mathbb{R}^2$, $\mathbb{R}^3$, and $\mathbb{R}^4$ which are based on convex uniform tessellations, honeycombs, and tetracombs, respectively, is presented, as well as a construction of a family of regular totally separable sphere packings in $\mathbb{R}^d$ that is not based on a convex uniform $d$-honeycomb for $d \geq 3$.
We define three-point bounds for sphere packing that refine the linear programming bound, and we compute these bounds numerically using semidefinite programming by choosing a truncation radius for the three-point function. As a result, we obtain new upper bounds on the sphere packing density in dimension 4 through 7 and 9 through 16. We also give a different three-point bound for lattice packing and conjecture that this second bound is sharp in dimension 4.
We algorithmically characterize the maximal contact number problem for finite congruent lattice sphere packings in $\mathbb{R}^d$ and show that in $\mathbb{R}^3$ this problem is equivalent to determining the maximal coordination of a monatomic crystal.
Optimal packing of spheres in $\mathbb R^d$ is studied by optimization of the energy $E$ (effective conductivity) of composites with ideally conducting spherical inclusions. It is demonstrated that the minimum of $E$ over locations of spheres is attained at the optimal packing. The energy is estimated in the framework of structural approximations. This method yields upper bounds and sometimes exact values for the maximal concentrations of spheres in $\mathbb R^d$. A constructive algorithm for the optimal locations of spheres associated to the classes of the Delaunay graphs is constructed.
In 1969, Fejes Toth conjectured that in Euclidean 3-space any packing of equal balls such that each ball is touched by twelve others consists of hexagonal layers. This article verifies this conjecture.
This paper is an exposition, written for the Nieuw Archief voor Wiskunde, about the two recent breakthrough results in the theory of sphere packings. It includes an interview with Henry Cohn, Abhinav Kumar, Stephen D. Miller, and Maryna Viazovska.
Empirical constructions having maximal contact numbers of unit balls as putative best ones are presented for 20-27 balls.
The Koebe circle packing theorem states that every finite planar graph can be realized as the nerve of a packing of (non-congruent) circles in R^3. We investigate the average kissing number of finite packings of non-congruent spheres in R^3 as a first restriction on the possible nerves of such packings. We show that the supremum k of the average kissing number for all packings satisfies 12.566 ~ 666/53 <= k < 8 + 4*sqrt(3) ~ 14.928 We obtain the upper bound by a resource exhaustion argument and the upper bound by a construction involving packings of spherical caps in S^3. Our result contradict…
We continue the study of the linear programming bounds for sphere packing introduced by Cohn and Elkies. We use theta series to give another proof of the principal theorem, and present some related results and conjectures.
This article sketches the proofs of two theorems about sphere packings in Euclidean 3-space. The first is K. Bezdek's strong dodecahedral conjecture: the surface area of every bounded Voronoi cell in a packing of balls of radius 1 is at least that of a regular dodecahedron of inradius 1. The second theorem is L. Fejes Toth's contact conjecture, which asserts that in 3-space, any packing of congruent balls such that each ball is touched by twelve others consists of hexagonal layers. Both proofs are computer assisted. Complete proofs of these theorems appear in the author's book "Dense Sphere Pa…
The contact number of a packing of finitely many balls in Euclidean $d$-space is the number of touching pairs of balls in the packing. A prominent subfamily of sphere packings is formed by the so-called totally separable sphere packings: here, a packing of balls in Euclidean $d$-space is called totally separable if any two balls can be separated by a hyperplane such that it is disjoint from the interior of each ball in the packing. Bezdek, Szalkai and Szalkai (Discrete Math. 339(2): 668-676, 2016) upper bounded the contact numbers of totally separable packings of $n$ unit balls in Euclidean $d…
Contact numbers are natural extensions of kissing numbers. In this paper we give estimates for the number of contacts in a totally separable packing of n unit balls in Euclidean d-space for all n>1 and d>1.
This paper is being withdrawn because an error was discovered in lemma 4.3. Although the rest of the paper appears to be correct, this error invalidates the proof of theorem 3.1 and theorem 3.3.
An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper carries out the second step of that program. A sphere packing leads to a decomposition of $R^3$ into polyhedra. The polyhedra are divided into two classes. The first class of polyhedra, called quasi-regular tetrahedra, have density at most that of a regular tetrahedron. The polyhedra in the remaining class have density at most that of a regular octahedron (about 0.7209).
We study some sequences of functions of one real variable and conjecture that they converge uniformly to functions with certain positivity and growth properties. Our conjectures imply a conjecture of Cohn and Elkies, which in turn implies the complete solution to the sphere packing problem in dimensions 8 and 24. We give numerical evidence for these conjectures as well as some arithmetic properties of the hypothetical limiting functions. The conjectures are of greatest interest in dimension 24, in light of Viazovska's recent solution to the Cohn-Elkies conjecture (and consequently the sphere p…
This is the sixth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $π/\sqrt{18}\approx 0.74048...$. This is the oldest problem in discrete geometry and is an important part of Hilbert's 18th problem. An example of a packing achieving this density is the face-centered cubic packing. This paper completes part of the fourth step of the program outlined in math.MG/9811073: A proof that if some standard region has more than four sides, then the star scores less than $8 \pt$.
This paper describes the local density inequality approach to getting upper bounds for sphere packing densities in R^n. This approach was first suggested by L. Fejes-Toth in 1956 to prove the Kepler conjecture that the densest sphere packing in R^3 is the "cannonball packing". The approaches of L. Fejes-Toth, W.-Y. Hsiang, and T. Hales to the Kepler conjecture are each based on (different) local density inequalities. Recently T. Hales and S. P. Ferguson have presented extensive details carrying out a modified version of the otrignal Hales approach to prove the Kepler conjecture. We describe th…
The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which if completed, will jointly comprise a proof of the conjecture. We carry out step five of the program [outlined in math.MG/9811073], a proof that the local density of a certain combinatorial arrangement, the pentahedral prism, is less than that of the face-centered cubic lattice packing. We prove various relations on the local density using computer-based interval arithmetic methods. Together, these relations imply the local density bound.
This is the fifth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $π/\sqrt{18}\approx 0.74048...$. This is the oldest problem in discrete geometry and is an important part of Hilbert's 18th problem. An example of a packing achieving this density is the face-centered cubic packing. This paper carries out the third step of the program outlined in math.MG/9811073: A proof that if all of the standard regions are triangles or quadrilaterals, then the total score is less than $8 …
New Sphere Packings from the Antipode Construction
本文利用对跖方法作用于 $Λ_{24}$ 和 $P_{48p}$ 的次优截面，在七个维度上构造出创纪录密度的非格球体堆积。
We describe a program to prove the Kepler conjecture on sphere packings. We then carry out the first step of this program. Each packing determines a decomposition of space into Delaunay simplices, which are grouped together into finite configurations called Delaunay stars. A score, which is related to the density of packings, is assigned to each Delaunay star. We conjecture that the score of every Delaunay star is at most the score of the stars in the face-centered cubic and hexagonal close packings. This conjecture implies the Kepler conjecture. To complete the first step of the program, we s…
Packings of identical objects have fascinated both scientists and laymen alike for centuries, in particular the sphere packings and the packings of identical regular tetrahedra. Mathematicians have tried for centuries to determine the densest packings; Crystallographers and chemists have been fascinated by the lattice packings for centuries as well. On the other hand, physicists, geologists, material scientists and engineers have been challenged by the mysterious random packings for decades. Experiments have shown the existence of the dense random sphere packings and the loose random sphere pa…
Continuing the investigations of Harborth (1974) and the author (2002) we study the following two rather basic problems on sphere packings. Recall that the contact graph of an arbitrary finite packing of unit balls (i.e., of an arbitrary finite family of non-overlapping unit balls) in Euclidean 3-space is the (simple) graph whose vertices correspond to the packing elements and whose two vertices are connected by an edge if the corresponding two packing elements touch each other. One of the most basic questions on contact graphs is to find the maximum number of edges that a contact graph of a p…
In this paper, we describe and visualize the densest ball and horoball packing configurations belonging to the simply truncated $3$-dimensional hyperbolic Coxeter orthoschemes with parallel faces. These beautiful packing arrangements describe and show the very interesting structure of the mentioned orthoschemes and the corresponding Coxeter groups. We use for the visualization the Beltrami-Cayley-Klein ball model of $3$-dimensional hyperbolic space $\boldsymbol{H}^3$ and the pictures were made by the Python software.
The sphere packing problem asks for the greatest density of a packing of congruent balls in Euclidean space. The current best upper bound in all sufficiently high dimensions is due to Kabatiansky and Levenshtein in 1978. We revisit their argument and improve their bound by a constant factor using a simple geometric argument, and we extend the argument to packings in hyperbolic space, for which it gives an exponential improvement over the previously known bounds. Additionally, we show that the Cohn-Elkies linear programming bound is always at least as strong as the Kabatiansky-Levenshtein bound…
Compact packings are specific packings of spheres which can be seen as tilings and are good candidates to maximize the density. We show that the compact packings of the Euclidean space with two sizes of spheres are exactly those obtained by filling with smaller spheres the octahedral holes of a close-packing of equal spheres.
We say that a tiling separates discs of a packing in the Euclidean plane, if each tile contains exactly one member of the packing. It is a known elementary geometric problem to show that for each locally finite packing of circular discs, there exists a separating tiling with convex polygons. In this paper we show that this separating property remains true for circle packings on the sphere and in the hyperbolic plane. Moreover, we show that in the Euclidean plane circles are the only convex discs, whose packings with similar copies can be always separated by polygonal tilings. The analogous sta…
A sphere packing of the three-dimensional Euclidean space is compact if it has only tetrahedral holes, that is, any local maximum of the distance to the spheres is at equal distance to exactly four spheres. This papers describes all the compact packings with spheres of three different sizes. They are close-compact packings of unit spheres with holes filled in four different ways by smaller spheres.
An Improved Lower Bound for Packing 203 Equal Spheres in a Unit Cube
针对单位立方体中203个等球堆积问题，本文从Packomania公开构型出发优化得到更大可行半径的新构型，经100位算术验证满足所有约束，补充材料包含构型坐标与相关程序。
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds for packings of spherical caps and of convex bodies through the use of semidefinite programming. We perform explicit computations, obtaining new bounds for packings of spherical caps of two different sizes and for binary sphere packings. We also slightly improve bounds for the classical problem of packing identical spheres.
We introduce an analog of Bianchi groups for rational quaternion algebras and use it to construct sphere packings that are analogs of the Apollonian circle packing known as integral crystallographic packings.
We introduce an orthoplicial Apollonian sphere packing, which is a sphere packing obtained by successively inverting a configuration of 8 spheres with 4-orthplicial tangency graph. We will show that there are such packings in which the bends of all constituent spheres are integral, and establish the asymptotic local-global principle for the set of bends in these packings.
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.
This expository paper describes Viazovska's breakthrough solution of the sphere packing problem in eight dimensions, as well as its extension to twenty-four dimensions by Cohn, Kumar, Miller, Radchenko, and Viazovska.
Inversive geometry can be used to generate exactly self-similar space-filling sphere packings. We present a construction method in two dimensions and generalize it to search for packings in higher dimensions. We newly discover 29 three-dimensional and 13 four-dimensional topologies of which 10 and 5, respectively, are bearings. To distinguish and characterize the packing topologies, we numerically estimate their fractal dimensions and we analyze their contact networks.
On Dense Tetrahedra in Binary Sphere Packings
本文研究三维空间中不等球体堆积分解中四面体的密度，通过结合几何洞察与区间算术计算，改进了特定尺寸球体堆积密度的上界。
Using graph-theoretic methods we give a new proof that for all sufficiently large $n$, there exist sphere packings in $\R^n$ of density at least $cn2^{-n}$, exceeding the classical Minkowski bound by a factor linear in $n$. This matches up to a constant the best known lower bounds on the density of sphere packings due to Rogers, Davenport-Rogers, and Ball. The suggested method makes it possible to describe the points of such a packing with complexity $\exp(n\log n)$, which is significantly lower than in the other approaches.
We obtain new restrictions on the linear programming bound for sphere packing, by optimizing over spaces of modular forms to produce feasible points in the dual linear program. In contrast to the situation in dimensions 8 and 24, where the linear programming bound is sharp, we show that it comes nowhere near the best packing densities known in dimensions 12, 16, 20, 28, and 32. More generally, we provide a systematic technique for proving separations of this sort.
The Apollonian circle packing, generated from three mutually-tangent circles in the plane, has inspired over the past half-century the study of other classes of space-filling packings, both in two and in higher dimensions. Recently, Kontorovich and Nakamura introduced the notion of crystallographic sphere packings, $n$-dimensional packings of spheres with symmetry groups that are isometries of $\mathbb{H}^{n+1}$. There exist at least three sources which give rise to crystallographic packings, namely polyhedra, reflective extended Bianchi groups, and various higher dimensional quadratic forms. …
Recently, we enumerate up to isometry, all locally rigid circle packings on the unit sphere with number of circles N<12. This problem is equivalent to the enumeration of irreducible contact graphs. In this paper we show that by using the list of irreducible graphs can solve various problems of extreme packings such as the Tammes problem for the sphere and the projective plane, the maximal contacts problem, Danzer's and other problems on irreducible contact graphs.
It is shown that there is no quasi-sphere packing of the lattice grid Z^{d+1} or a co-compact hyperbolic lattice of H^{d+1} or the 3-regular tree \times Z, in R^d, for all d. A similar result is proved for some other graphs too. Rather than using a direct geometrical approach, the main tools we are using are from non-linear potential theory.
The sphere packing problem is an old puzzle. We consider packings with m spheres in the unit cell (m-periodic packings). For the case m = 1 (lattice packings), Voronoi proved there are finitely many inequivalent local optima and presented an algorithm to enumerate them, and this computation has been implemented in up to d = 8 dimensions. We generalize Voronoi's method to m > 1 and present a procedure to enumerate all locally optimal 2-periodic sphere packings in any dimension, provided there are finitely many. We implement this computation in d = 3, 4, and 5 and show that no 2-periodic packing…
We prove a lower bound on the entropy of sphere packings of $\mathbb R^d$ of density $Θ(d \cdot 2^{-d})$. The entropy measures how plentiful such packings are, and our result is significantly stronger than the trivial lower bound that can be obtained from the mere existence of a dense packing. Our method also provides a new, statistical-physics-based proof of the $Ω(d \cdot 2^{-d})$ lower bound on the maximum sphere packing density by showing that the expected packing density of a random configuration from the hard sphere model is at least $(1+o_d(1)) \log(2/\sqrt{3}) d \cdot 2^{-d}$ when the …
Identifying contact graphs of sphere packings with generic radii
本文证明了Ozkan等人关于通用半径球体填充的无应力猜想对接触图形式为G⊕K2的球体填充成立，并证明了其逆命题，即G⊕K2是通用半径球体填充的接触图当且仅当G是无环的penny graph。
On compact packings of Euclidean space with spheres of finitely many sizes
本文研究欧几里得空间中恰好含 n 种半径的紧致球体堆积，引入异微扰集概念，证明固定异微扰集下所有可能半径配置的集合是有限的。
Variations on five-dimensional sphere packings
本文分析了Szöllősi最近提出的猜想最优五维 kissing 配置，并构造了新的配置，扩展了Conway和Sloane的猜想最优堆叠列表，同时提出了新的九维 kissing 配置。
The densest local packings of N three-dimensional identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained for selected values of N up to N = 1054. In the predecessor to this paper [A.B. Hopkins, F.H. Stillinger and S. Torquato, Phys. Rev. E 81 041305 (2010)], we described our method for finding the putative densest packings of N spheres in d-dimensional Euclidean space Rd and presented those packings in R2 for values of N up to N = 348. We analyze the properties and characteristics of the densest local packings in R3 and employ knowledge…
We carry out a numerical study of the spinless modular bootstrap for conformal field theories with current algebra $U(1)^c \times U(1)^c$, or equivalently the linear programming bound for sphere packing in $2c$ dimensions. We give a more detailed picture of the behavior for finite $c$ than was previously available, and we extrapolate as $c \to \infty$. Our extrapolation indicates an exponential improvement for sphere packing density bounds in high dimensions. Furthermore, we study when these bounds can be tight. Besides the known cases $c=1/2$, $4$, and $12$ and the conjectured case $c=1$, our…
We establish a precise relation between the modular bootstrap, used to constrain the spectrum of 2D CFTs, and the sphere packing problem in Euclidean geometry. The modular bootstrap bound for chiral algebra $U(1)^c$ maps exactly to the Cohn-Elkies linear programming bound on the sphere packing density in $d=2c$ dimensions. We also show that the analytic functionals developed earlier for the correlator conformal bootstrap can be adapted to this context. For $c=4$ and $c=12$, these functionals exactly reproduce the "magic functions" used recently by Viazovska [1] and Cohn et al. [2] to solve the…
The densest local packing (DLP) problem in d-dimensional Euclidean space Rd involves the placement of N nonoverlapping spheres of unit diameter near an additional fixed unit-diameter sphere such that the greatest distance from the center of the fixed sphere to the centers of any of the N surrounding spheres is minimized. Solutions to the DLP problem are relevant to the realizability of pair correlation functions for packings of nonoverlapping spheres and might prove useful in improving upon the best known upper bounds on the maximum packing fraction of sphere packings in dimensions greater tha…
The sphere packing problem in dimension 24
本文借鉴Viazovska八维球堆积问题的解法，证明24维空间中Leech格是最密且唯一的周期堆积，并构造了相应的最优辅助函数。
We introduce the notion of a "crystallographic sphere packing," defined to be one whose limit set is that of a geometrically finite hyperbolic reflection group in one higher dimension. We exhibit for the first time an infinite family of conformally-inequivalent such with all radii being reciprocals of integers. We then prove a result in the opposite direction: the "superintegral" ones exist only in finitely many "commensurability classes," all in dimensions below 30.
Six-dimensional sphere packing and linear programming
本文通过模形式空间上的对偶与优化，推广 Cohn–Triantafillou 构造，证明六维球堆积的 Cohn–Elkies 线性规划界非紧。
The densest local packings of N identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained using a nonlinear programming method operating in conjunction with a stochastic search of configuration space. Knowledge of Rmin(N) in d-dimensional Euclidean space allows for the construction both of a realizability condition for pair correlation functions of sphere packings and an upper bound on the maximal density of infinite sphere packings. In this paper, we focus on the two-dimensional circular disk problem. We find and present the putative dens…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。