相关论文: On approximations by projections of polytopes with…

Approximate a smooth convex body $K$ with nonvanishing curvature by the convex hull of $n$ independent random points sampled from its boundary $\partial K$. In case the points are distributed according to the optimal density, we prove that…

In convex geometry, the Blaschke surface area measure on the boundary of a convex domain can be interpreted in terms of the complexity of approximating polyhedra. In response to a question raised by D. Barrett, this approach is formulated…

Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…

We prove that there are arbitrarily large equilateral sets of planar and symmetric convex bodies in the Banach--Mazur distance. The order of the size of these $d$-equilateral sets asymptotically matches the bounds of the size of…

Let $K$ be a convex body in $\mathbb R^n$. We prove that in small codimensions, the sections of a convex body through the centroid are quite symmetric with respect to volume. As a consequence of our estimates we give a positive answer to a…

This paper presents bounds for the best approximation, with respect to the Hausdorff metric, of a convex body $K$ by a circumscribed polytope $P$ with a given number of facets. These bounds are of particular interest if $K$ is elongated. To…

Given two disjoint convex polyhedra, we look for a best approximation pair relative to them, i.e., a pair of points, one in each polyhedron, attaining the minimum distance between the sets. Cheney and Goldstein showed that alternating…

We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…

We determine the maximal hyperplane sections of the regular $n$-simplex, if the distance of the hyperplane to the centroid is fairly large, i.e. larger than the distance of the centroid to the midpoint of edges. Similar results for the…

We prove that the length of the projection of the vector joining the centers of mass of a convex body on the plane and of its boundary to an arbitrary direction does not exceed $\frac{1}{6}$ of the body width in this direction. It follows…

In [SZ], Soprunov and Zvavitch have translated the Bezout inequalities (from Algebraic Geometry) into inequalities of mixed volumes satisfied by the simplex. They conjecture this set of inequalities characterizes the simplex, among all…

We prove sharp inequalities for the average number of affine diameters through the points of a convex body $K$ in ${\mathbb R}^n$. These inequalities hold if $K$ is either a polytope or of dimension two. An example shows that the proof…

We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We…

Given a Borel measure $\mu$ on ${\mathbb R}^{n}$, we define a convex set by \[ M({\mu})=\bigcup_{\substack{0\le f\le1,\\ \int_{{\mathbb R}^{n}}f\,{\rm d}{\mu}=1 } }\left\{ \int_{{\mathbb R}^{n}}yf\left(y\right)\,{\rm…

Let $K$ and $L$ be two convex bodies in ${\mathbb R^4}$, such that their projections onto all $3$-dimensional subspaces are directly congruent. We prove that if the set of diameters of the bodies satisfy an additional condition and some…

Let $M$ be a compact $n$-dimensional Riemannian manifold with nonnegative Ricci curvature and mean convex boundary $\partial M$. Assume that the mean curvature $H$ of the boundary $\partial M$ satisfies $H \geq (n-1) k >0$ for some positive…

In ["Illumination of convex bodies with many symmetries", Mathematika 63 (2017)], Tikhomirov verified the Hadwiger-Boltyanski Illumination Conjecture for the class of 1-symmetric convex bodies of sufficiently large dimension. We propose an…

In geometry, there are several challenging problems studying numbers associated to convex bodies. For example, the packing density problem, the kissing number problem, the covering density problem, the packing-covering constant problem,…

This paper is motivated by Davenport's problem and the subsequent work regarding badly approximable points in submanifolds of a Euclidian space. We study the problem in the area of twisted Diophantine approximation and present two different…

Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which…