Related papers: Barycentric cuts through a convex body

Let $K\subset \mathbb{R}^n$, $n\geq 3$, be a convex body. A point $p$ the interior of $K$ is said to be a Larman point of $K$ if for every hyperplane $\Pi$ passing through $p$ the section $\Pi\cap K$ has a $(n-2)$-plane of symmetry. If $p$…

Given a finite set of points $C \subseteq \mathbb{R}^d$, we say that an ordering of $C$ is protrusive if every point lies outside the convex hull of the points preceding it. We give an example of a set $C$ of $5$ points in the Euclidean…

Let $K$ be a set of $q^2+2q+1$ points in $PG(4,q)$. We show that if every 3-space meets $K$ in either one, two or three lines, a line and a non-degenerate conic, or a twisted cubic, then $K$ is a ruled cubic surface. Moreover, $K$…

We strongly believe that in order to prove two important geometrical pro\-blems in convexity, namely, the G. Bianchi and P. Gruber's Conjecture \cite{bigru} and the J. A. Barker and D. G. Larman's Conjecture \cite{Barker}, it is necessary…

Let $K$ be a convex body in an affine chart of the $n$ dimensional real Projective space $\mathbb{RP}^n$, $n \geq 3$, let $H$ be a hyperplane which is not a support hyperplane of $K$ and let $p_1,p_2 \in \mathbb{RP}^n \setminus H$ be two…

We provide a reformulation of the hyperplane conjecture (the slicing problem) in terms of the floating body and give upper and lower bounds on the logarithmic Hausdorff distance between an arbitrary convex body $K\subset \mathbb{R}^{d}$\…

A classical question in PL topology, asked among others by Hudson, Lickorish, and Kirby, is whether every linear subdivision of the d-simplex is simplicially collapsible. The answer is known to be positive for d<4. We solve the problem up…

Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls…

Let $K$ be a $d$ dimensional convex body with a twice continuously differentiable boundary and everywhere positive Gauss-Kronecker curvature. Denote by $K_n$ the convex hull of $n$ points chosen randomly and independently from $K$ according…

We show that the hyperplane conjecture holds for the classes of $k$-intersection bodies with arbitrary measures in place of volume.

The Rolling Ball Theorem asserts that given a convex body K in Euclidean space and having a smooth surface bd(K) with all principal curvatures not exceeding c>0 at all boundary points, K necessarily has the property that to each boundary…

Let $d \ge 2$, and let $K \subset {\Bbb{R}}^d$ be a convex body containing the origin $0$ in its interior. In a previous paper we have proved the following. The body $K$ is $0$-symmetric if and only if the following holds. For each $\omega…

Heinz Huber (1956) considered the following problem on the the hyperbolic plane H. Consider a strictly hyperbolic subgroup of automorphisms on H with compact quotient, and choose a conjugacy class in this group. Count the number of vertices…

Consider a finite collection of affine hyperplanes in $\mathbb R^d$. The hyperplanes dissect $\mathbb R^d$ into finitely many polyhedral chambers. For a point $x\in \mathbb R^d$ and a chamber $P$ the metric projection of $x$ onto $P$ is the…

Denote by ${\mathcal K}^d$ the family of convex bodies in $E^d$ and by $w(C)$ the minimal width of $C \in {\mathcal K}^d$. We ask for the greatest number $\Lambda_n ({\mathcal K}^d)$ such that every $C \in {\mathcal K}^d$ contains a…

Ball's celebrated cube slicing (1986) asserts that among hyperplane sections of the cube in $\mathbb{R}^n$, the central section orthogonal to $(1,1,0,\dots,0)$ has the greatest volume. We show that the same continues to hold for slicing…

Gr\"unbaum's inequality guarantees that the centroid of a convex body has halfspace depth at least $1/e$: every halfspace containing the centroid captures at least a $1/e$ fraction of the body's volume. For mixed-integer convex sets…

A celebrated result of Alon and F\"{u}redi gives a tight lower bound on the number of hyperplanes required to cover all points of the Boolean cube $B^n$ except the origin $\bm{0}$. Recent breakthroughs by Sauermann and Wigderson generalized…

We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…

The Heilbronn triangle problem asks for the placement of $n$ points in a unit square that maximizes the smallest area of a triangle formed by any three of those points. In $1972$, Schmidt considered a natural generalization of this problem.…