𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tilings, packings, coverings, and the approximation of functions

✍ Scribed by Aicke Hinrichs; Christian Richter

Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
279 KB
Volume
267
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A packing (resp. covering) ℱ of a normed space X consisting of unit balls is called completely saturated (resp. completely reduced) if no finite set of its members can be replaced by a more numerous (resp. less numerous) set of unit balls of X without losing the packing property (resp. covering property) of ℱ. We show that a normed space X admits completely saturated packings with disjoint closed unit balls as well as completely reduced coverings with open unit balls, provided that there exists a tiling of X with unit balls.

Completely reduced coverings by open balls are of interest in the context of an approximation theory for continuous real‐valued functions that rests on so‐called controllable coverings of compact metric spaces. The close relation between controllable coverings and completely reduced coverings allows an extension of the approximation theory to non‐compact spaces. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

📜 SIMILAR VOLUMES

Efficient Approximation Algorithms for T
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles
✍ Piotr Berman; Bhaskar DasGupta; S Muthukrishnan; Suneeta Ramaswami 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 202 KB

We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE, and d-RPACK) studied in the literature. Most of our algorithms are highly efficient since their running times are near-linear in the sparse input size rather than in the domain size. In add

Slope packings and coverings, and generi
Slope packings and coverings, and generic algorithms for the discrete logarithm problem
✍ M. Chateauneuf; A. C. H. Ling; D. R. Stinson 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB

## Abstract We consider the set of slopes of lines formed by joining all pairs of points in some subset __S__ of a Desarguesian affine plane of prime order __p__. If all the slopes are distinct and non‐infinite, we have a __slope packing__; if every possible non‐infinite slope occurs, then we have

Maximal resolvable packings and minimal
Maximal resolvable packings and minimal resolvable coverings of triples by quadruples
✍ Xiande Zhang; Gennian Ge 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB

## Abstract Determination of maximal resolvable packing number and minimal resolvable covering number is a fundamental problem in designs theory. In this article, we investigate the existence of maximal resolvable packings of triples by quadruples of order __v__ (MRPQS(__v__)) and minimal resolvabl

Approximation of vector valued smooth fu
Approximation of vector valued smooth functions
✍ Eva C. Farkas 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB

## Abstract A real locally convex space is said to be __convenient__ if it is separated, bornological and Mackey‐complete. These spaces serve as underlying objects for a whole theory of differentiation and integration (see [4]) upon which infinite dimensional differential geometry is based (cf. [8]

On the Approximation of Positive Functio
On the Approximation of Positive Functions by Power
✍ U. Schmid 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 124 KB

The problem to be studied goes back to a question of Erdös and Kövari, concerning functions \(M(x), x \in R_{0}{ }^{+}\), which are positive and logarithmically convex in \(\ln x\). The question to find necessary and sufficient conditions for the existence of a power series \[ N(x)=\sum c_{n} x^{n}