The following result was proved by \textit{I. Bárány} [Discrete Math. 40, 141--152 (1982; Zbl 0492.52005)]: For every \(d \geq 1\) there exists \(c_d > 0\) such that for every \(n\)-point set~\(S\) in~\({\mathbb R}^d\) there is a~point \(p \in {\mathbb R}^d\) contained in at least \(c_dn^{d+1} -O(n^d)\) of the \(d\)-dimensional simplices spanned by~\(S\). The authors of the present paper examine the largest possible value of~\(c_d\), construct sets showing that \(c_d \leq (d + 1)^{-(d+1)}\), and conjecture that this estimate is tight; in this method \(p\) is~chosen as any centerpoint of~\(S\). It is also proved that, for every \(n\)-point set \(S\subset {\mathbb R}^d\), there exists a~\((d-2)\)-flat that stabs at least \(c_{d,d-2} n ^3-O(n^2)\) of the triangles spanned by~\(S\), with \(c_{d,d-2}\geq \frac 1{24} (1-1/ (2d-1)^2)\). This is established with the help of an~equipartition result of independent interest (generalizing planar results of \textit{R.~C.~Buck} and \textit{E.~F.~Buck} [Math. Mag. 22, 195--198 (1948/49)] and and of \textit{J.~Ceder} [Bol. Soc. Mat. Mexicana (2) 9, 28--32 (1964; Zbl 0158.19802)]: Every mass distribution in~\({\mathbb R}^d\) can be divided into \(4d - 2\) equal parts by \(2d - 1\) hyperplanes intersecting in a~common \((d - 2)\)-flat.
- A generalization of Caratheodory's theorem
- A point in many triangles
- A Problem in Geometric Probability.
- A Theorem on General Measure
- Algorithms in real algebraic geometry
- An ideal-valued cohomological index theory with applications to Borsuk—Ulam and Bourgin—Yang theorems
- Borsuk-Ulam type theorems on Stiefel manifolds
- Counting triangle crossings and halving planes
- Entering and leaving \(j\)-facets
- Eppstein's bound on intersecting triangles revisited
- scientific article; zbMATH DE number 4171944 (Why is no real title available?)
- scientific article; zbMATH DE number 3674107 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 3254645 (Why is no real title available?)
- scientific article; zbMATH DE number 3303831 (Why is no real title available?)
- scientific article; zbMATH DE number 3111118 (Why is no real title available?)
- Improved bounds for intersecting triangles and halving planes
- On the number of halving planes
- Point Selections and Weak ε-Nets for Convex Hulls
- The colored Tverberg's problem and complexes of injective functions
- The number of triangles covering the center of an \(n\)-set
- User's guide to equivariant methods in combinatorics. II
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- An improvement on the Rado bound for the centerline depth
- A center transversal theorem for an improved Rado depth
- Extremal problems for pairs of triangles
- Intersection theorems for triangles
- Ham-sandwich cuts and center transversals in subspaces
- Upper bounds for stabbing simplices by a line
- Hypergraph expanders from Cayley graphs
- An elementary exposition of topological overlap in the plane
- Homogeneous selections from hyperplanes
- A proof of the Oja depth conjecture in the plane
- Complete Kneser transversals
- \(k\)-centerpoints conjectures for pointsets in \(\mathbb{R}^d\)
- A new lower bound based on Gromov's method of selecting heavily covered points
- Stellar discriminants and equipartitions
- Codimension two and three Kneser transversals
- One-sided epsilon-approximants
- Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
- Tverberg’s theorem is 50 years old: A survey
- scientific article; zbMATH DE number 763368 (Why is no real title available?)
- A slight improvement to the colored Bárány's theorem
- A survey of mass partitions
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Stabbing simplices of point sets with \(k\)-flats
- Positive-fraction intersection results and variations of weak epsilon-nets
- Homogeneous selections from hyperplanes
- Hitting simplices with points in \(\mathbb R^{3}\)
- Faces in rectilinear drawings of complete graphs
- k-hull depth: in between simplicial and halfspace depth
- Stabbing Delaunay tetrahedralizations
- Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
- On Gromov's method of selecting heavily covered points
- Centerpoints and Tverberg's technique
This page was built for publication: Stabbing simplices by points and flats
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848667)