Related papers: The maximum relative diameter for multi-rotational…
We study relations of some classes of $k$-convex, $k$-visible bodies in Euclidean spaces. We introduce and study \textrm{circular projections} in normed linear spaces and classes of bodies related with families of such maps, in particular,…
We prove several estimates for the volume, mean width, and the value of the Wills functional of sections of convex bodies in John's position, as well as for their polar bodies. These estimates extend some well-known results for convex…
For special $d$-dimensional hyperbolic shells $E$ with $ d\geq 5$ we show that the number of lattice points in $E$ intersected with a $d$-dimensional cube $C_r$ of edge length $r$, can be approximated by the volume of $E\cap C_r$, as $r$…
We study the large scale geometry of the mapping class group, MCG. Our main result is that for any asymptotic cone of MCG, the maximal dimension of locally compact subsets coincides with the maximal rank of free abelian subgroups of MCG. An…
Under study are some vector optimization problems over the space of Minkowski balls, i.e., symmetric convex compact subsets in Euclidean space. A typical problem requires to achieve the best result in the presence of conflicting goals;…
The smallest $r$ so that a metric $r$-ball covers a metric space $M$ is called the radius of $M$. The volume of a metric $r$-ball in the space form of constant curvature $k$ is an upper bound for the volume of any Riemannian manifold with…
Approximating convex bodies is a fundamental problem in geometry. Given a convex body $K$ in $\mathbb{R}^d$ for a fixed dimension $d$, the objective is to minimize the number of facets of an approximating polytope for a given Hausdorff…
We study maximal sublattices of finite semidistributive lattices via their complements. We focus on the conjecture that such complements are always intervals, which is known to be true for bounded lattices. Since the class of…
Finding the $r\times r$ submatrix of maximum volume of a matrix $A\in\mathbb R^{n\times n}$ is an NP hard problem that arises in a variety of applications. We propose a new greedy algorithm of cost $\mathcal O(n)$, for the case $A$…
In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…
We study the optimality of the minimax risk of truncated series estimators for symmetric convex polytopes. We show that the optimal truncated series estimator is within $O(\log m)$ factor of the optimal if the polytope is defined by $m$…
Given a centrally symmetric convex body $K \subset \mathbb{R}^d$ and a positive number $\lambda$, we consider, among all ellipsoids $E \subset \mathbb{R}^d$ of volume $\lambda$, those that best approximate $K$ with respect to the symmetric…
Let $M_{n, m}(\mathbb{R})$ be the space of $n\times m$ real matrices. Define $\mathcal{K}_o^{n,m}$ as the set of convex compact subsets in $M_{n,m}(\mathbb{R})$ with nonempty interior containing the origin $o\in M_{n, m}(\mathbb{R})$, and…
The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inverse degree, and that this ratio is tight. To develop a…
We consider moments of the normalized volume of a symmetric or nonsymmetric random polytope in a fixed symmetric convex body. We investigate for which bodies these moments are extremized, and calculate exact values in some of the extreme…
We give a simple conceptual proof of the consistency of a test for multivariate uniformity in a bounded set $K \subset \mathbb{R}^d$ that is based on the maximal spacing generated by i.i.d. points $X_1, \ldots,X_n$ in $K$, i.e., the volume…
Large deviation estimates are by now a standard tool inthe Asymptotic Convex Geometry, contrary to small deviationresults. In this note we present a novel application of a smalldeviations inequality to a problem related to the diameters of…
The sum of the first $n \geq 1$ eigenvalues of the Laplacian is shown to be maximal among triangles for the equilateral triangle, maximal among parallelograms for the square, and maximal among ellipses for the disk, provided the ratio…
Let X be a normed space. A subset A of X is approximately convex if $d(ta+(1-t)b,A) \le 1$ for all $a,b \in A$ and $t \in [0,1]$ where $d(x,A)$ is the distance of $x$ to $A$. Let $\Co(A)$ be the convex hull and $\diam(A)$ the diameter of…
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…