Related papers: The width-volume inequality

In a geometric network G = (S, E), the graph distance between two vertices u, v in S is the length of the shortest path in G connecting u to v. The dilation of G is the maximum factor by which the graph distance of a pair of vertices…

We study periodic tessellations of the Euclidean space with unequal cells arising from the minimization of perimeter functionals. Existence results and qualitative properties of minimizers are discussed for different classes of problems,…

Minimum $k$-Section denotes the NP-hard problem to partition the vertex set of a graph into $k$ sets of sizes as equal as possible while minimizing the cut width, which is the number of edges between these sets. When $k$ is an input…

We give a topological characterization of the n-dimensional pseudo-boundary of the (2n+1)-dimensional Euclidean space.

We obtain in this paper bounds for the capacity of a compact set $K$. If $K$ is contained in an $(n+1)$-dimensional Cartan-Hadamard manifold, has smooth boundary, and the principal curvatures of $\partial K$ are larger than or equal to…

Let $M$ be a smooth, connected, compact submanifold of $\mathbb{R}^n$ without boundary and of dimension $k\geq 2$. Let $\mathbb{S}^k \subset \mathbb{R}^{k+1}\subset \mathbb{R}^n$ denote the $k$-dimesnional unit sphere. We show if $M$ has…

Any affine map on the (n+1)-dimensional Euclidean space gives rise to a natural map on the n-dimensional sphere whose dynamical aspects are not so well-studied in the literature. We explore the dynamical aspects of these maps by…

For some self-similar sets K in d-dimensional Euclidean space we obtain certain lower bounds for the lower Minkowski dimension of K+E in terms of the lower Minkowski dimension of E.

The detour between two points u and v (on edges or vertices) of an embedded planar graph whose edges are curves is the ratio between the shortest path in in the graph between u and v and their Euclidean distance. The maximum detour over all…

We state a general formula to compute the volume of the intersection of the regular $n$-simplex with some $k$-dimensional subspace. It is known that for central hyperplanes the one through the centroid containing $n-1$ vertices gives the…

It is shown that each continuous transformation $h$ from Euclidean $m$-space ($m>1$) into Euclidean $n$-space that preserves the equality of distances (that is, fulfils the implication $|x-y|=|z-w|\Rightarrow|h(x)-h(y)|=|h(z)-h(w)|$) is a…

We derive concentration inequalities for the supremum norm of the difference between a kernel density estimator (KDE) and its point-wise expectation that hold uniformly over the selection of the bandwidth and under weaker conditions on the…

We consider the volume of a Boolean expression of some congruent balls about a given system of centers in the $d$-dimensional Euclidean space. When the radius $r$ of the balls is large, this volume can be approximated by a polynomial of…

Let $M^d$ denote the $d$-dimensional Euclidean, hyperbolic, or spherical space. The $r$-dual set of given set in $M^d$ is the intersection of balls of radii $r$ centered at the points of the given set. In this paper we prove that for any…

In the first part of this paper we study a best approximation of a vector in Euclidean space R^n with respect to a closed semi-algebraic set C and a given semi-algebraic norm. Assuming that the given norm and its dual norm are…

In this paper, we give a conditional lower bound of $n^{\Omega(k)}$ on running time for the classic k-median and k-means clustering objectives (where n is the size of the input), even in low-dimensional Euclidean space of dimension four,…

Examples show that Riemannian manifolds with almost-Euclidean lower bounds on scalar curvature and Perelman entropy need not be close to Euclidean space in any metric space sense. Here we show that if one additionally assumes an…

In this paper we find surprisingly small Oka domains in Euclidean spaces $\mathbb C^n$ of dimension $n>1$ at the very limit of what is possible. Under a mild geometric assumption on a closed unbounded convex set $E$ in $\mathbb C^n$ we show…

In this paper we present a mathematical framework on linking of embeddings of compact topological spaces into Euclidean spaces and separability of linked embeddings under a specific class of dimension reduction maps. As applications of the…

We study the problem of representing all distances between $n$ points in $\mathbb R^d$, with arbitrarily small distortion, using as few bits as possible. We give asymptotically tight bounds for this problem, for Euclidean metrics, for…