Related papers: The Antipode Construction for Sphere Packings
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 $\pi/\sqrt{18}\approx 0.74048...$. This is the…
Understanding how particles are arranged on the sphere is not only central to numerous physical, biological, and materials systems but also finds applications in mathematics and in analysis of geophysical and meteorological measurements. In…
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…
We investigate dimension-theoretic properties of concentric topological spheres, which are fractal sets emerging both in pure and applied mathematics. We calculate the box dimension and Assouad spectrum of such collections, and use them to…
Dense packings have served as useful models of the structure of liquid, glassy and crystal states of matter, granular media, heterogeneous materials, and biological systems. Probing the symmetries and other mathematical properties of the…
One of the most fundamental topics in subspace coding is to explore the maximal possible value ${\bf A}_q(n,d,k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$ such that the subspace distance satisfies $\operatorname{d_S}(U,V) =…
We show that near densest-packing the perturbations of the HCP structure yield higher entropy than perturbations of any other densest packing. The difference between the various structures shows up in the correlations between motions of…
Sphere packing problems have a rich history in both mathematics and physics; yet, relatively few analytical analyses of sphere packings exist, and answers to seemingly simple questions are unknown. Here, we present an analytical method for…
We present an efficient Monte Carlo method for the lattice sphere packing problem in d dimensions. We use this method to numerically discover de novo the densest lattice sphere packing in dimensions 9 through 20. Our method goes beyond…
Sphere decoding (SD) of polar codes is an efficient method to achieve the error performance of maximum likelihood (ML) decoding. But the complexity of the conventional sphere decoder is still high, where the candidates in a target sphere…
It is commonly believed that the most efficient way to pack a finite number of equal-sized spheres is by arranging them tightly in a cluster. However, mathematicians have conjectured that a linear arrangement may actually result in the…
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 $\pi/\sqrt{18}\approx 0.74048...$. This is the…
In 6D general relativity with a scalar field as a source of gravity, a new type of static wormhole solutions is presented: such wormholes connect our universe with a small 2D extra subspace with a universe where this extra subspace is…
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.
Inspired by the linear programming method developed by Cohn and Elkies (Ann. Math. 157(2): 689-714, 2003), we introduce a new linear programming method to solve the sphere packing problem. More concretely, we consider sequences of auxiliary…
We study static packings of frictionless and frictional spheres in three dimensions, obtained via molecular dynamics simulations, in which we vary particle hardness, friction coefficient, and coefficient of restitution. Although…
In this work, shells are mathematically constructed by applying the cut and paste procedure to D-dimensional spherically symmetric geometries. The weak energy condition for the matter on the shells is briefly analyzed. The dynamical…
This review paper is devoted to the problems of sphere packings in 4 dimensions. The main goal is to find reasonable approaches for solutions to problems related to densest sphere packings in 4-dimensional Euclidean space. We consider two…
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of…
The purpose of this paper is to give an effective construction for some induced structures on spheres or product of spheres of codimension 1, 2 or 3, respectively, in Euclidean space endowed with an almost product structure.