Highly saturated packings and reduced coverings

Abstract

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 $\cal 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\ge 1$. Similarly, a covering $\cal 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\ge 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\subset \mathbb{E}^d$, 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+2$-reduced covering of $\mathbb{E}^d$ with congruent balls, and we produce some density bounds for the $n$-saturated packings and $n$-reduced coverings of the plane with congruent circles.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

An omitting types theorem for saturated structures.A. D. Greif & M. C. Laskowski - 1993 - Annals of Pure and Applied Logic 62 (2):113-118.
Equality-free saturated models.P. Dellunde - 2003 - Reports on Mathematical Logic:3-22.
Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.
For what Filters is Every Reduced Product Saturated?Saharon Shelah - 1975 - Journal of Symbolic Logic 40 (3):456-456.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Saturated models in institutions.Răzvan Diaconescu & Marius Petria - 2010 - Archive for Mathematical Logic 49 (6):693-723.

Analytics

Added to PP
2017-06-17

Downloads
3 (#1,644,941)

6 months
1 (#1,444,594)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references