Related papers: The width-volume inequality

The Kneser-Poulsen conjecture says that if a finite collection of balls in a d-dimensional Euclidean space is rearranged so that the distance between each pair of centers does not get smaller, then the volume of the union of these balls…

Given a warped product space $\mathbb{R} \times_{f} N$ with logarithmically convex warping function $f$, we prove a relative isoperimetric inequality for regions bounded between a subset of a vertical fiber and its image under an almost…

For any $\Lambda>0$, let $\mathcal{M}_{n,\Lambda}$ denote the space containing all locally Lipschitz minimal graphs of dimension $n$ and of arbitrary codimension $m$ in Euclidean space $\mathbb{R}^{n+m}$ with uniformly bounded 2-dilation…

We revisit the classical Unit Distance Problem posed by Erd\H{o}s in 1946. While the upper bound of $O(n^{4/3})$ established by Spencer, Szemer'edi, and Trotter (1984) is tight for systems of pseudo-circles, it fails to account for the…

Given any admissible $k$-dimensional family of immersions of a given closed oriented surface into an arbitrary closed Riemannian manifold, we prove that the corresponding min-max width for the area is achieved by a smooth (possibly…

The dimension of a graph $G$ is the smallest $d$ for which its vertices can be embedded in $d$-dimensional Euclidean space in the sense that the distances between endpoints of edges equal $1$ (but there may be other unit distances).…

This paper addresses to the problem of finding the (minimum) Euclidean distance between two linear varieties. This problem is, usually, solved minimising a target function. We propose a novel approach: to use the Moore-Penrose generalised…

A new intrinsic volume metric is introduced for the class of convex bodies in $\mathbb{R}^n$. As an application, an inequality is proved for the asymptotic best approximation of the Euclidean unit ball by arbitrarily positioned polytopes…

In this paper we develop some combinatorial models for continuous spaces. In this spirit we study the approximations of continuous spaces by graphs, molecular spaces and coordinate matrices. We define the dimension on a discrete space by…

It is known that any normed vector space which satisfies the parallelogram law is actually an inner product space. For finite dimensional normed vector spaces over R, we formulate an approximate version of this theorem: if a space…

A celebrated result of Dol'nikov, and of \v{Z}ivaljevi\'c and Vre\'cica, asserts that for every collection of $m$ measures $\mu_1,\dots,\mu_m$ on the Euclidean space $\mathbb R^{n + m - 1}$ there exists a projection onto an $n$-dimensional…

The width $w$ of a curve $\gamma$ in Euclidean space $R^n$ is the infimum of the distances between all pairs of parallel hyperplanes which bound $\gamma$, while its inradius $r$ is the supremum of the radii of all spheres which are…

This paper addresses the question: how should N n-dimensional subspaces of m-dimensional Euclidean space be arranged so that they are as far apart as possible? The results of extensive computations for modest values of N, n, m are…

By a well known result the treewidth of k-outerplanar graphs is at most 3k-1. This paper gives, besides a rigorous proof of this fact, an algorithmic implementation of the proof, i.e. it is shown that, given a k-outerplanar graph G, a tree…

We prove that the diameter of any unweighted connected graph G is O(k log n/lambda_k), for any k>= 2. Here, lambda_k is the k smallest eigenvalue of the normalized laplacian of G. This solves a problem posed by Gil Kalai.

Let $M$ be a perfect matching on a set of points in the plane where every edge is a line segment between two points. We say that $M$ is globally maximum if it is a maximum-length matching on all points. We say that $M$ is $k$-local maximum…

Various results are proved giving lower bounds for the $m$th intrinsic volume $V_m(K)$, $m=1,\dots,n-1$, of a compact convex set $K$ in ${\mathbb{R}}^n$, in terms of the $m$th intrinsic volumes of its projections on the coordinate…

We show some characterizations of hyperspheres in the $(n+1)$-dimensional Euclidean space ${\Bbb E}^{n+1}$ with intrinsic and extrinsic properties such as the $n$-dimensional area of the sections cut off by hyperplanes, the…

For a convex body $K\subset\mathbb{R}^d$ the mean distance $\Delta(K)=\mathbb{E}|X_1-X_2|$ is the expected Euclidean distance of two independent and uniformly distributed random points $X_1,X_2\in K$. Optimal lower and upper bounds for…

The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…