相关论文: Sphere packings I

The recent discovery of planets orbiting main sequence binaries will provide crucial constraints for theories of binary and planet formation. The formation pathway for these planets is complicated by uncertainties in the formation mechanism…

We show that every irreducible integral Apollonian packing can be set in the Euclidean space so that all of its tangency spinors and all reduced coordinates and co-curvatures are integral. As a byproduct, we prove that in any integral…

We present DisPerSE, a novel approach to the coherent multi-scale identification of all types of astrophysical structures, and in particular the filaments, in the large scale distribution of matter in the Universe. This method and…

In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…

We present a method for discovering dense packings of general convex hard particles and apply it to study the dense packing behavior of a one-parameter family of particles with tetrahedral symmetry representing a deformation of the ideal…

This article gives the construction and complete classification of all three-dimensional spherical manifolds, and orders them by decreasing volume, in the context of multiconnected universe models with positive spatial curvature. It…

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…

Delaunay has shown that the Delaunay complex of a finite set of points $P$ of Euclidean space $\mathbb{R}^m$ triangulates the convex hull of $P$, provided that $P$ satisfies a mild genericity property. Voronoi diagrams and Delaunay…

A set is star-shaped if there is a point in the set that can see every other point in the set in the sense that the line-segment connecting the points lies within the set. We show that testing whether a non-empty compact smooth region is…

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…

We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lov\'asz theta number to Cayley graphs on the special orthogonal group…

Sphere packing, Hilbert's eighteenth problem, asks for the densest arrangement of congruent spheres in n-dimensional Euclidean space. Although relevant to areas such as cryptography, crystallography, and medical imaging, the problem remains…

We investigate the star-free closure, which associates to a class of languages its closure under Boolean operations and marked concatenation. We prove that the star-free closure of any finite class and of any class of groups languages with…

Packing problems have been of great interest in many diverse contexts for many centuries. The optimal packing of identical objects has been often invoked to understand the nature of low temperature phases of matter. In celebrated work,…

Simplicial approximation provides a framework for constructing simplicial complexes that are homotopy equivalent to a given manifold, provided a CW structure is explicitly known. However, its conventional implementation quickly becomes…

Given a topological property $\mathcal{P}$, a space $X$ is called star-$\mathcal{P}$ if for any open cover $\mathcal{U}$ of the space $X$, there exists a set $Y\subseteq X$ with property $\mathcal{P}$ such that $St(Y,\mathcal{U})=X$; the…

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…

This article explains an optimization-based approach for counting and localizing stars within a small cluster, based on photon counts in a focal plane array. The array need not be arranged in any particular way, and relatively small numbers…

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…

A significant fraction of Kepler systems are closely-packed, largely coplanar and circular. We study the stability of a 6-planet system, Kepler-11, to gain insights on the dynamics and formation history of such systems. Using a technique…