Related papers: Covering of high-dimensional sets

We introduce a pregeometry that provides a metric and dimensionality over a Borel set (Wheeler's "bucket of dust") without assuming probability amplitudes for adjacency. Rather, a non-trivial metric is produced over a Borel set X per a…

Many algorithmic problems can be solved (almost) as efficiently in metric spaces of bounded doubling dimension as in Euclidean space. Unfortunately, the metric space defined by points in a simple polygon equipped with the geodesic distance…

Multidimensional scaling (MDS) is a popular technique for mapping a finite metric space into a low-dimensional Euclidean space in a way that best preserves pairwise distances. We overview the theory of classical MDS, along with its…

Let $\mu$ be a translation invariant measure on $(\mathbb{R}^d,\mathcal{B}(\mathbb{R}^d))$ and let $\lambda$ denote the Lebesgue measure on $\mathbb{R}^d$. If there exists an open set $U$ such that $0<\mu(U)=\lambda(U)<\infty$, it is a…

We provide a systematic deterministic numerical scheme to approximate the volume (i.e. the Lebesgue measure) of a basic semi-algebraic set whose description follows a sparsity pattern. As in previous works (without sparsity), the underlying…

Given a nowheredense closed subset $X$ of a metrizable compact space $\tx$, we characterize the dimension of $X$ in terms of the multiplicity of the canonicals covers of the complementary of $X$, specially in some particular cases, like…

Let $(X, d)$ be a compact metric space and let $\mathcal{M}(X)$ denote the space of all finite signed Borel measures on $X$. Define $I \colon \mathcal{M}(X) \to \R$ by \[ I(\mu) = \int_X \int_X d(x,y) d\mu(x) d\mu(y), \] and set $M(X) =…

We show that whenever a separable subset $S$ of a complete metric space $X$ admits a $d$-dimensional weak tangent field, the set $S$ is close to being $d$-dimensional in the following sense. Whenever $\mu$ is a Borel finite measure on $X$…

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…

This work revolves around the two following questions: Given a convex body $C\subset\mathbb{R}^d$, a positive integer $k$ and a finite set $S\subset\mathbb{R}^d$ (or a finite Borel measure $\mu$ on $\mathbb{R}^d$), how many homothets of $C$…

Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…

Gaussian processes can be considered as subsets of a standard Hilbert space, but the geometric understanding that would relate the size of a set with the size of its convex hull is still lacking. In this work, we adopt a geometric approach…

Grade-$d$ measures on a $\sigma$-algebra $\mathcal{A}\subseteq 2^X$ over a set $X$ are generalizations of measures satisfying one of a hierarchy of weak additivity-type conditions initially introduced as interference operators in quantum…

The halfspace depth of a $d$-dimensional point $x$ with respect to a finite (or probability) Borel measure $\mu$ in $\mathbb{R}^d$ is defined as the infimum of the $\mu$-masses of all closed halfspaces containing $x$. A natural question is…

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…

Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given $k$ there is a minimal diameter of subsets at which there exists a covering with…

Let us denote $\lambda$ the Lebesgue measure on $[0,1]$, put$$ C(\lambda)=\{f\in C([0,1]);\ \forall~A\subset [0,1], A~\text{Borel}:\ \lambda(A)=\lambda(f^{-1}(A))\}.$$ We endow the set $C(\lambda)$ by the uniform metric $\rho$ and…

If $(X,d)$ is a Polish metric space of dimension $0$, then by Wadge's lemma, no more than two Borel subsets of $X$ can be incomparable with respect to continuous reducibility. In contrast, our main result shows that for any metric space…

Metric embeddings are a widely used method in algorithm design, where generally a ``complex'' metric is embedded into a simpler, lower-dimensional one. Historically, the theoretical computer science community has focused on bi-Lipschitz…

We study a generalization of the Set Cover problem called the \emph{Partial Set Cover} in the context of geometric set systems. The input to this problem is a set system $(X, \mathcal{S})$, where $X$ is a set of elements and $\mathcal{S}$…