Related papers: A conceptual breakthrough in sphere packing
In this paper, on envelopes created by circle families in the plane, all four basic problems (existence problem, representation problem, problem on the number of envelopes, problem on relationships of definitions) are solved.
In this research, we introduce an algorithm that produces what appears to be a new mathematical object as a consequence of projecting the \( n \)-dimensional \( Z \)-curve onto an \( n \)-dimensional sphere. The first part presents the…
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…
The problem of packing equal spheres in a spherical container is a classic global optimization problem, which has attracted enormous studies in academia and found various applications in industry. This problem is computationally…
A famous result of Hausdorff states that a sphere with countably many points removed can be partitioned into three pieces A,B,C such that A is congruent to B (i.e., there is an isometry of the sphere which sends A to B), B is congruent to…
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…
We construct examples of embedded flexible cross-polytopes in the spheres of all dimensions. These examples are interesting from two points of view. First, in dimensions 4 and higher, they are the first examples of embedded flexible…
Inspired by work of the first and second author, this paper studies the Gromov width of the disk cotangent bundle of spheroids and Zoll spheres of revolution. This is achieved with the use of techniques from integrable systems and embedded…
We introduce a new class of fractal circle packings in the plane, generalizing the polyhedral packings defined by Kontorovich and Nakamura. The existence and uniqueness of these packings are guaranteed by infinite versions of the…
We construct 2^{\Omega(n^{5/4})} combinatorial types of triangulated 3-spheres on n vertices. Since by a result of Goodman and Pollack (1986) there are no more than 2^{O(n log n)} combinatorial types of simplicial 4-polytopes, this proves…
We resolve a longstanding open problem by reformulating the Grassmannian fusion frames to the case of mixed dimensions and show that this satisfies the proper properties for the problem. In order to compare elements of mixed dimension, we…
We improve upper bounds on sphere packing densities and sizes of spherical codes in high dimensions. In particular, we prove that the maximal sphere packing densities $\delta_n$ in $\mathbb{R}^n$ satisfy \[\delta_n\leq \frac{1+o(1)}{e}\cdot…
The problem of packing a system of particles as densely as possible is foundational in the field of discrete geometry and is a powerful model in the material and biological sciences. As packing problems retreat from the reach of solution by…
The method, proposed in \cite{Za22} to derive the densest packing fraction of random disc and sphere packings, is shown to yield in two dimensions too high a value that (i) violates the very assumption underlying the method and (ii)…
We prove that the three-sphere recognition problem lies in the complexity class NP. Our work relies on Thompson's original proof that the problem is decidable [Math. Res. Let., 1994], Casson's version of her algorithm, and recent results of…
This paper proves a corner occupying theorem for the two-dimensional integral rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given integral rectangles into an integral rectangular container…
The exploration of the densest sphere packings is a fundamental problem in mathematics and a wide variety of sciences including materials science. We present our exhaustive computational exploration of the densest ternary sphere packings…
We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…
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…
In this article we obtain linear programming bounds for the maximal sphere packing density of commutative spaces. A special case of our results solves a conjecture by Cohn and Zhao on linear programming bounds for sphere packings in…