Some basic properties of packing and covering constants (Q1080185)

Let \(K=\{K_{\nu}\}_{\nu \in N}\) be a given collection of distinct convex bodies in \(E^ n\), and let G be a given group of isometries of \(E^ n\) that contains as subgroup the group of all translations of \(E^ n\). This paper concerns packings of convex bodies in \(E^ n\) and coverings of \(E^ n\) by convex bodies which are obtained by the application of rigid motions from G to the members of the ''supply'' K. There are two possibilities of generating such packings and coverings. One may permit that the sets from K are used repeatedly \((K^ r\)-packing or \(K^ r\)-covering), or one may require that each set from K is used at most once (K-packing or K-covering). Both aspects appear in the literature on packing and covering, the first following a more traditional line. By using the standard concepts of upper and lower density of a packing or a covering the author introduces two packing and two covering constants. E.g., \(d_ p(K,G)\) is the supremum of the upper densities of all K-packings with respect to G, and the other three quantities \(d^ r_ p(K,G)\), \(d_ c(K,G)\), \(d^ r_ c(K,G)\) are similarly defined; in the case of covering the upper density is replaced by the lower density, and the supremum is replaced by the infimum. The first theorem states, under very general assumptions, that there are always K- and \(K^ r\)-packings and coverings with densities equal to the corresponding packing and covering constants. Second, a quantitative continuity theorem is proved showing that the packing and covering constants depend, with respect to the Hausdorff metric, continuously on K. Theorem 3 (''Transference Theorem'') states, for a wide class of supply sets K, that \(d_ p(K)=d^ r_ p(K')\) and \(d_ c(K)=d^ r_ c(K')\), where K' is a certain supply set connected with K. Various applications of these theorems are discussed, especially consequences of the Transference Theorem.