Related papers: A remark on covering

Given a finite covering by closed convex sets of $B_X$, the unit ball of an infinite-dimensional Banach space, we investigate whether there is a set of the covering that contains balls of radius close to $1$ and (a) arbitrarily high finite…

We study a local version of the ball-covering problem in Banach spaces, and obtain a complete solution to it in terms of the norm derivatives. We illustrate the advantage of the local approach by obtaining substantial refinements of several…

In this paper, we investigate geometrical properties of the rank metric space and covering properties of rank metric codes. We first establish an analytical expression for the intersection of two balls with rank radii, and then derive an…

We discuss the geometry of Banach spaces whose norm is octahedral or, more generally, locally or weakly octahedral. Our main results characterize these spaces in terms of covering of the unit ball.

The present work surveys problems in $n$-dimensional space with $n$ large. Early development in the study of packing and covering in high dimensions was motivated by the geometry of numbers. Subsequent results, such as the discovery of the…

As the main problem, we consider covering of a $d$-dimensional cube by $n$ balls with reasonably large $d$ (10 or more) and reasonably small $n$, like $n=100$ or $n=1000$. We do not require the full coverage but only 90\% or 95\% coverage.…

We determine upper and lower bounds for the minimal number of balls of a given radius needed to cover the space of schlicht functions.

The problem of covering a region of the plane with a fixed number of minimum-radius identical balls is studied in the present work. An explicit construction of bi-Lipschitz mappings is provided to model small perturbations of the union of…

We establish a general criterion for the existence of convex sets of fixed shape as, e.g., balls of a given radius, of maximal probability on Banach spaces. We also provide counterexamples showing that their existence my fail even in some…

We prove that, given any covering of any separable infinite-dimensional uniformly rotund and uniformly smooth Banach space $X$ by closed balls each of positive radius, some point exists in $X$ which belongs to infinitely many balls.

A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…

We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In…

In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…

We study the behaviour of Whitley's thickness constant of a Banach space with respect to $\ell_p$-products and we compute it for classical $L_p$-spaces.

We characterise the class of those Banach spaces in which every convex combination of slices of the unit ball intersects the unit sphere as the class of those spaces in which every convex combination of slices of the unit ball contains two…

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…

We show that there exists a Banach space in which every non-empty weakly open subset of its unit ball has radius one, the maximum possible value, but the infimum of the diameter of its slices is exactly one, so extremely far from its…

In Euclidean spaces, every closed, bounded, convex set can be characterized by two equivalent notions of separation properties. This is not true in general for arbitrary Banach spaces. In this work, we present a ball separation…

We consider the covering of a ball in certain normed spaces by its congruent subsets and show that if the finite number of sets is not greater than the dimensionality of the space, then the centre of the ball either belongs to the interior…

We survey techniques for constructing spaces with non-trivial self covers. These processes include methods for building low and high dimension continua which non-trivially self. We also discuss several related group theoretic and…