Related papers: Covering of high-dimensional sets

Ordinal embedding aims at finding a low dimensional representation of objects from a set of constraints of the form "item $j$ is closer to item $i$ than item $k$". Typically, each object is mapped onto a point vector in a low dimensional…

Packing is a classical problem where one is given a set of subsets of Euclidean space called objects, and the goal is to find a maximum size subset of objects that are pairwise non-intersecting. The problem is also known as the Independent…

Let $\mu$ be a Borel measure on a compactum $X$. The main objects in this paper are $\sigma$-ideals $I(dim)$, $J_0(\mu)$, $J_f(\mu)$ of Borel sets in $X$ that can be covered by countably many compacta which are finite-dimensional, or of…

We show that if $X$ is a uniformly perfect complete metric space satisfying the finite doubling property, then there exists a fully supported measure with lower regularity dimension as close to the lower dimension of $X$ as we wish.…

We discuss the problem of optimizing the distance function from a given point, subject to polynomial constraints. A key algebraic invariant that governs its complexity is the Euclidean distance degree, which pertains to first-order…

We prove that there exists a diffusion process whose invariant measure is the three dimensional polymer measure $\nu_\lambda$ for all $\lambda>0$. We follow in part a previous incomplete unpublished work of the first named author with M.…

Sobolev embeddings, of arbitrary order, are considered into function spaces on domains of $\mathbb R^n$ endowed with measures whose decay on balls is dominated by a power $d$ of their radius. Norms in arbitrary rearrangement-invariant…

New partial results are obtained related to the following old problem of Erd\"os: for any infinite set $X$ of real numbers to show that there is always a measurable (or, equivalently, closed) subset of reals of positive Lebesgue measure…

We study a random partial covering model on the $(d-1)$-dimensional unit sphere, where $N$ spherical caps are placed independently and uniformly at random, each covering a surface fraction of $1/N$. This model provides a continuous…

The bootstrap is a popular data-driven method to quantify statistical uncertainty, but for modern high-dimensional problems, it could suffer from huge computational costs due to the need to repeatedly generate resamples and refit models. We…

The symmetries of surfaces which can be embedded into the symmetries of the 3-dimensional Euclidean space $\mathbb{R}^3$ are easier to feel by human's intuition. We give the maximum order of finite group actions on $(\mathbb{R}^3, \Sigma)$…

Increasingly large parameter spaces, used to more accurately model precision observables in physics, can paradoxically lead to large deviations in the inferred parameters of interest -- a bias known as volume projection effects -- when…

We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…

It has been found empirically that quasi-Monte Carlo methods are often efficient for very high-dimensional problems, that is, with dimension in the hundreds or even thousands. The common explanation for this surprising fact is that those…

We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

Let $\lambda$ be a probability measure on $\mathbb T^{n-1}$ where $n=2$ or 3. Suppose $\lambda$ is invariant, ergodic and has positive entropy with respect to the linear transformation defined by a hyperbolic matrix. We get a measure $\mu $…

Exhibiting a new type of measure concentration, we prove uniform concentration bounds for measurable Lipschitz functions on product spaces, where Lipschitz is taken with respect to the metric induced by a weighted covering of the index set…

A covering system is a finite collection of arithmetic progressions whose union is the set of integers. The study of these objects was initiated by Erd\H{o}s in 1950, and over the following decades he asked many questions about them. Most…

A three-dimensional orthoscheme is defined as a tetrahedron whose base is a right-angled triangle and an edge joining the apex and a non-right-angled vertex is perpendicular to the base. A generalization, called complete orthoschemes, of…

We study the problem of finding, for a given one-dimensional topological space $X$, a cover of $X$ of smallest size by geodesics with respect to some metric. The infimal size of such a set is called the metric geodesic cover number of $X$.…