Related papers: Ball polytopes and the Vazsonyi problem

There are two positive, absolute constants $c_{1}$ and $c_{2}$ so that the volume of the difference set of the $d$-dimensional Euclidean ball and an inscribed polytope with n vertices is larger than $$ c_{2}\ d\…

Let $P$ be a polytope defined by the system $A x \leq b$, where $A \in R^{m \times n}$, $b \in R^m$, and $\text{rank}(A) = n$. We give a short geometric proof of the following tight upper bound on the number of vertices of $P$: $$ n! \cdot…

The paper characterizes the convex hull of the closure of the cone-volume set $C_\cv(U)$, consisting of all cone-volume vectors of polygons with outer unit normals vectors contained in $U$, for any finite set $U \subseteq \R^2, \pos(U) =…

It is conjectured since long that for any convex body $P\subset \mathbb{R}^n$ there exists a point in its interior which belongs to at least $2n$ normals from different points on the boundary of $P$. The conjecture is known to be true for…

We investigate the interrelations between the metric properties, order properties and combinatorial properties of the set of balls in totally bounded ultrametric space. In particular, the Gurvich-Vyalyi representation of finite, ultrametric…

A simple n-gon is a polygon with n edges such that each vertex belongs to exactly two edges and every other point belongs to at most one edge. Brass, Moser and Pach asked the following question: For n > 3 odd, what is the maximum perimeter…

Given a finite covering by closed convex sets of $B_X$, the unit ball of an infinite-dimensional Banach space, we investigate whether there is a set of the covering that contains balls of radius close to $1$ and (a) arbitrarily high finite…

We give a deterministic nearly-linear time algorithm for approximating any point inside a convex polytope with a sparse convex combination of the polytope's vertices. Our result provides a constructive proof for the Approximate…

We show that a realization of a closed connected PL-manifold of dimension n-1 in Euclidean n-space (n>2) is the boundary of a convex polyhedron if and only if the interior of each (n-3)-face has a point, which has a neighborhood lying on…

Given two subsets of R^d, when does there exist a projective transformation that maps them to two sets with a common centroid? When is this transformation unique modulo affine transformations? We study these questions for 0- and…

For $B \subseteq \mathbb F_q^m$, the $n$-th affine extremal number of $B$ is the maximum cardinality of a set $A \subseteq \mathbb F_q^n$ with no subset which is affinely isomorphic to $B$. Furstenberg and Katznelson proved that for any $B…

In the setting of a metric space equipped with a doubling measure that supports a Poincar\'e inequality, we show that any set of finite perimeter can be approximated in the BV norm by a set whose topological and measure theoretic boundaries…

The Euclidean mixed isoperimetric-isodiametric inequality states that the round ball maximizes the volume under constraint on the product between boundary area and radius. The goal of the paper is to investigate such mixed…

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…

In this work, we consider static manifolds $M$ with nonempty boundary $\partial M$. In this case, we suppose that the potential $V$ also satisfies an overdetermined Robin type condition on $\partial M$. We prove a rigidity theorem for the…

The Illumination Problem may be phrased as the problem of covering a convex body in Euclidean $n$-space by a minimum number of translates of its interior. By a probabilistic argument, we show that, arbitrarily close to the Euclidean ball,…

One classical result of Freimann gives the optimal lower bound for the cardinality of A+A if A is a d-dimensional finite set in the Euclidean d-space. Matolcsi and Ruzsa have recently generalized this lower bound to |A+kB| if B is…

We consider the neutral inclusion problem in three dimensions which is to prove if a coated structure consisting of a core and a shell is neutral to all uniform fields, then the core and the shell must be concentric balls if the matrix is…

Let us have in S^2, R^2 or H^2 a pair of convex bodies, for S^2 different from S^2, such that the intersections of any congruent copies of them are centrally symmetric. Then our bodies are congruent circles. If the intersections of any…

Shephard (Canad. J. Math. 26: 302-321, 1974) proved a decomposition theorem for zonotopes yielding a simple formula for their volume. In this note we prove a generalization of this theorem yielding similar formulas for their intrinsic…