相关论文: Covering spheres with spheres

We consider rational points on the sphere and investigate their equidistribution in shrinking spherical caps. For the two-dimensional sphere, we leverage Hecke operators to obtain a significantly improved small-scale equidistribution bound,…

Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…

We study lattice points in d-dimensional spheres, and count their number in thin spherical segments. We found an upper bound depending only on the radius of the sphere and opening angle of the segment. To obtain this bound we slice the…

A notorious problem in mathematics and physics is to create a solvable model for random sequential adsorption of non-overlapping congruent spheres in the $d$-dimensional Euclidean space with $d\geq 2$. Spheres arrive sequentially at…

A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which…

An essential cover of the vertices of the $n$-cube $\{0,1\}^n$ by hyperplanes is a minimal covering where no hyperplane is redundant and every variable appears in the equation of at least one hyperplane. Linial and Radhakrishnan gave a…

Classic mass partition results are about dividing the plane into regions that are equal with respect to one or more measures (masses). We introduce a new concept in which the notion of partition is replaced by that of a cover. In this case…

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…

The rich variety of densest columnar structures of identical hard spheres inside a cylinder can surprisingly be constructed from a simple and computationally fast sequential deposition of cylinder-touching spheres, if the cylinder-to-sphere…

We give an optimal bound for the remainder when counting the number of rational points on the $n$-dimensional sphere with bounded denominator for any $n\geq 2$.

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,…

We explore upper bounds on the covering radius of non-hollow lattice polytopes. In particular, we conjecture a general upper bound of $d/2$ in dimension $d$, achieved by the "standard terminal simplices" and direct sums of them. We prove…

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…

We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…

A family of potential-density pairs that represent spherical shells with finite thickness is obtained from the superposition of spheres with finite radii. Other families of shells with infinite thickness with a central hole are obtained by…

The study on the relationship between the spheres and voids in packing system suggests that the edge effect at the interface between the container and the particles is an important factor lowering the packing ratio. To pack spheres in a…

We study subsets of the $n$-dimensional vector space over the finite field $\mathbb{F}_q$, for odd $q$, which contain either a sphere for each radius or a sphere for each first coordinate of the center. We call such sets radii spherical…

This paper encompasses the mathematical derivations of the analytic and generalized formula and recurrence relations to find out the radii of n umber of circles inscribed or packed in the plane region bounded by circular arcs (including…

We investigate the intersections of balls of radius $r$, called $r$-ball bodies, in Euclidean $d$-space. An $r$-lense (resp., $r$-spindle) is the intersection of two balls of radius $r$ (resp., balls of radius $r$ containing a given pair of…