相关论文: The Sphere-Packing Problem

The paper described a generalized integrated glance to bin packing problems including a brief literature survey and some new problem formulations for the cases of multiset estimates of items. A new systemic viewpoint to bin packing problems…

Many of the classic problems of coding theory are highly symmetric, which makes it easy to derive sphere-packing upper bounds and sphere-covering lower bounds on the size of codes. We discuss the generalizations of sphere-packing and…

We develop an algorithm to construct new self-similar space-filling packings of spheres. Each topologically different configuration is characterized by its own fractal dimension. We also find the first bi-cromatic packing known up to now.

We consider spectral minimal partitions. Continuing work of the the present authors about problems for planar domains, [23], we focus on the sphere and obtain a sharp result for 3-partitions which is related to questions from harmonic…

I survey problems concerning Lindelof spaces which have partial set- theoretic solutions.

The most efficient way to pack equally sized spheres isotropically in 3D is known as the random close packed state, which provides a starting point for many approximations in physics and engineering. However, the particle size distribution…

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…

The possible existence of a complex structure on the 6-sphere has been a famous unsolved problem for over 60 years. In that time many "solutions" have been put forward, in both directions. Mistakes have always been found. In this paper I…

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…

This paper deals with the problem of circle packing, in which the largest radii circle is to be fit in a confined space filled with arbitrary circles of different radii and centers. A circle packing problem is one of a variety of cutting…

This short note describes the tentative form of a finite-dimensional optimization problem that may be of use in a second-generation proof of the Kepler conjecture. In the original 1998 proof of the Kepler conjecture, the form of the…

We study packings of bidispersed spherical particles on a spherical surface. The presence of curvature necessitates defects even for monodispersed particles; bidispersity either leads to a more disordered packing for nearly equal radii, or…

A problem that is simple to state in the context of spherical geometry, and that seems rather interesting, appears to have been unexamined to date in the mathematical literature. The problem can also be recast as a problem in the real…

In this paper we study the hard sphere packing problem in the Hamming space by the cavity method. We show that both the replica symmetric and the replica symmetry breaking approximations give maximum rates of packing that are asymptotically…

When are athermal soft sphere packings jammed ? Any experimentally relevant definition must at the very least require a jammed packing to resist shear. We demonstrate that widely used (numerical) protocols in which particles are compressed…

Spherical coverings on the S2 sphere and their algebraic numbers are given for the putatively optimal global solutions for some n-congruent spherical caps with minimal radius to completely cover the S2 sphere. A few locally optimal…

We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…

This paper concerns the number of lattice points in a circle.

We summarize here the discussions around photospheric constraints, current uncertainties in models of stellar atmospheres, and reports on ongoing spectroscopic surveys. Rather than a panorama of the state of the art, we chose to present a…

A subset of the sphere is said short if it is contained in an open hemisphere. A short closed set which is geodesically convex is called a cap. The following theorem holds: 1. The minimal number of short closed sets covering the $n$-sphere…