Highly Saturated Packings and Reduced Coverings
نویسنده
چکیده
We introduce and study certain notions which might serve as substitutes for maximum density packings and minimum density coverings. A body is a compact connected set which is the closure of its interior. A packing P with congruent replicas of a body K is n-saturated if no n− 1 members of it can be replaced with n replicas of K, and it is completely saturated if it is n-saturated for each n ≥ 1. Similarly, a covering C with congruent replicas of a body K is n-reduced if no n members of it can be replaced by n− 1 replicas of K without uncovering a portion of the space, and it is completely reduced if it is n-reduced for each n ≥ 1. We prove that every body K in d-dimensional Euclidean or hyperbolic space admits both an n-saturated packing and an n-reduced covering with replicas of K. Under some assumptions on K ⊂ Ed (somewhat weaker than convexity), we prove the existence of completely saturated packings and completely reduced coverings, but in general, the problem of existence of completely saturated packings and completely reduced coverings remains unsolved. Also, we investigate some problems related to the the densities of n-saturated packings and n-reduced coverings. Among other things, we prove that there exists an upper bound for the density of a d +2reduced covering of Ed with congruent balls, and we produce some density bounds for the n-saturated packings and n-reduced coverings of the plane with congruent circles.
منابع مشابه
O ct 2 00 1 On the existence of completely saturated packings and completely reduced coverings
We prove the following conjecture of G. Fejes Toth, G. Kuperberg, and W. Kuperberg: every body K in either n-dimensional Euclidean or n-dimensional hyperbolic space admits a completely saturated packing and a completely reduced covering. Also we prove the following counterintuitive result: for every ǫ > 0, there is a body K in hyperbolic n-space which admits a completely saturated packing with ...
متن کاملConstructions of uniform designs by using resolvable packings and coverings
In this paper, uniform designs are constructed based on nearly U-type designs and the discrete discrepancy. The link between such uniform designs and resolvable packings and coverings in combinatorial design theory is developed. Through resolvable packings and coverings without identical parallel classes, many infinite classes of new uniform designs are then produced.
متن کاملReformulation of the covering and quantizer problems as ground states of interacting particles.
It is known that the sphere-packing problem and the number-variance problem (closely related to an optimization problem in number theory) can be posed as energy minimizations associated with an infinite number of point particles in d-dimensional Euclidean space R(d) interacting via certain repulsive pair potentials. We reformulate the covering and quantizer problems as the determination of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998