An improvement on the Rado bound for the centerline depth

DOI10.1007/S00454-016-9848-5zbMATH Open1385.52019arXiv1603.01641OpenAlexW2765403333MaRDI QIDQ1704902FDOQ1704902

Authors: Alexander Magazinov, Attila Pór 

Publication date: 13 March 2018

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: Let $mu$ be a Borel probability measure in $mathbb{R}^d$. For a $k$-flat $alpha$ consider the value $infmu(H)$, where $H$ runs through all half-spaces containing $alpha$. This infimum is called the half-space depth of $alpha$. Bukh, Matouv{s}ek and Nivasch conjectured that for every $mu$ and every $0leqk<d$ there exists a $k$-flat with the depth at least $frack+1k+d+1$. The Rado Centerpoint Theorem implies a lower bound of $frac1d+1-k$ (the Rado bound), which is, in general, much weaker. Whenever the Rado bound coincides with the bound conjectured by Bukh, Matouv{s}ek and Nivasch, i.e., for $k=0$ and $k=d-1$, it is known to be optimal. In this paper we show that for all other pairs $(d,k)$ one can improve on the Rado bound. If $k=1$ and $dgeq3$ we show that there is a 1-dimensional line with the depth at least $frac1d+frac13d^3$. As a corollary, for all $(d,k)$ satisfying $0<k<d-1$ there exists a $k$-flat with depth at least $frac1d+1-k+frac13(d+1-k{)}^3$.

Full work available at URL: https://arxiv.org/abs/1603.01641

Recommendations

• Upper bounds for centerlines
• A center transversal theorem for an improved Rado depth
• Regression depth and center points.
• Multivariate regression depth
• Depth in an arrangement of hyperplanes

zbMATH Keywords

half-space depthcenterlinecenterflatRado boundRado centerpoint theorem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Cites Work

• 3264 and all that. A second course in algebraic geometry
• Title not available (Why is that?)
• Title not available (Why is that?)
• The number of triangles covering the center of an \(n\)-set
• Characteristic Classes. (AM-76)
• Real analysis
• A Theorem on General Measure
• Stabbing simplices by points and flats
• On nearly radial marginals of high-dimensional probability measures
• Upper bounds for centerlines

Cited In (4)

• A center transversal theorem for an improved Rado depth
• Ham-sandwich cuts and center transversals in subspaces
• Upper bounds for stabbing simplices by a line
• Tverberg’s theorem is 50 years old: A survey

Uses Software

• Book3264Examples

This page was built for publication: An improvement on the Rado bound for the centerline depth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1704902)