Barycentric cuts through a convex body

03/27/2020
by   Zuzana Patáková, et al.
0

Let K be a convex body in ℝ^n (i.e., a compact convex set with nonempty interior). Given a point p in the interior of K, a hyperplane h passing through p is called barycentric if p is the barycenter of K ∩ h. In 1961, Grünbaum raised the question whether, for every K, there exists an interior point p through which there are at least n+1 distinct barycentric hyperplanes. Two years later, this was seemingly resolved affirmatively by showing that this is the case if p=p_0 is the point of maximal depth in K. However, while working on a related question, we noticed that one of the auxiliary claims in the proof is incorrect. Here, we provide a counterexample; this re-opens Grünbaum's question. It follows from known results that for n ≥ 2, there are always at least three distinct barycentric cuts through the point p_0 ∈ K of maximal depth. Using tools related to Morse theory we are able to improve this bound: four distinct barycentric cuts through p_0 are guaranteed if n ≥ 3.

READ FULL TEXT

page 13

page 15

research
06/19/2019

Existence of a Convex Polyhedron with Respect to the Given Radii

Given a set of radii measured from a fixed point, the existence of a con...
research
03/20/2023

On Intersecting Polygons

Consider two regions in the plane, bounded by an n-gon and an m-gon, res...
research
03/15/2023

Economical Convex Coverings and Applications

Coverings of convex bodies have emerged as a central component in the de...
research
12/02/2019

Proof of Dudley's Convex Approximation

We provide a self contained proof of a result of Dudley [Dud64] which sh...
research
12/08/2017

How to Net a Convex Shape

We revisit the problem of building weak -nets for convex ranges over...
research
04/15/2021

Lipschitz Selectors may not Yield Competitive Algorithms for Convex Body Chasing

The current best algorithms for convex body chasing problem in online al...
research
02/09/2019

On the maximal minimal cube lengths in distinct DNF tautologies

Inspired by a recent article by Anthony Zaleski and Doron Zeilberger, we...

Please sign up or login with your details

Forgot password? Click here to reset