Points surrounding the origin
A finite set \(P\subset \mathbb R^d\) \((d\geq 2)\) is said to be in general position resp.\ \(\mathbf 0\) iff no \(k\) \((2\leq k\leq d)\) elements of \(P\) are contained in a \((k-1)\)-dimensional linear subspace of \(\mathbb R^d\). It is shown that in case \(d>2\) each such set \(P\) with \(| P| >d+1\) contains a \(d\)-tuple \(Q\) such that \(\mathbf 0\notin \text{conv}(\{\mathbf x\}\cup Q)\) for any \(\mathbf x \in P\). A finite set \(P\subset \mathbb R^d\) is said to have property \(S(k)\) \((0\leq k\leq d+1)\) iff to each \(k\)-subset \(Q\) of \(P\) there exists a \((d+1-k)\)-subset \(R\) of \(P\) such that \(\mathbf 0\in \text{conv}\{Q\cup R\}\). Asking for the largest number \(k=k(d)\) such that there are arbitrarily large finite sets \(P\subset \mathbb R^d\) in general position resp.\ \(\mathbf 0\) having property \(S(k)\) the result mentioned above shows \(k(d)<d\) for \(d>2\). On the other hand the authors show using Gale transforms that \(k(d)\geq \lfloor \frac d2\rfloor+1\). Another result varies Barany's colored Caratheodory theorem as follows: Let \(A_1,\dots,A_{d+1}\) be nonempty finite sets in \(\mathbb R^d\) such that \(\mathbf 0\in \text{conv}(A_i\cup A_j)\) for each pair \(i\neq j\), then \(\mathbf 0\in \text{conv}S\) for some \((d+1)\)-set \(S\) with \(| S\cap A_i| =1\) for \(1\leq i\leq d+1\). The proof of this result uses spherical convexity, and a dual version can be interpreted as a colored version of the spherical Helly theorem.
- A generalization of Caratheodory's theorem
- An improved bound for \(k\)-sets in three dimensions
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
- scientific article; zbMATH DE number 480237 (Why is no real title available?)
- scientific article; zbMATH DE number 3368644 (Why is no real title available?)
- Improved bounds for planar k-sets and related problems
- Lectures on Polytopes
- On the minimum size of tight hypergraphs
- The minimum number of vertices of a simple polytope
- Around tight points
- Colorful linear programming, Nash equilibrium, and pivots
- The points of a linear manifold nearest the origin of coordinates
- Badges and rainbow matchings
- Cooperative conditions for the existence of rainbow matchings
- Further consequences of the colorful Helly hypothesis
- Theorems of Carathéodory, Helly, and Tverberg without dimension
- Topology of geometric joins
- Matching points with disks with a common intersection
- The Caratheodory number for the k-core
- Tropical Carathéodory with matroids
- Colorful theorems for strong convexity
- Helly’s theorem: New variations and applications
- Enumerating neighborly polytopes and oriented matroids
- On a rainbow version of Dirac's theorem
- Crossing-free perfect matchings in wheel point sets
- Robust Tverberg and Colourful Carathéodory Results via Random Choice
- Topological Drawings Meet Classical Theorems from Convex Geometry
- Further consequences of the colorful Helly hypothesis
- Quantitative combinatorial geometry for continuous parameters
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- [Russian Text Ignored.]
- Topological drawings meet classical theorems from convex geometry
- Choice functions
- Transversals and colorings of simplicial spheres
- Carathéodory-type theorems à la Bárány
- More colourful simplices
- Rainbow Hamiltonicity and the spectral radius
- Transversals to colorful intersecting convex sets
- The intersection of a matroid and an oriented matroid
This page was built for publication: Points surrounding the origin
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1046738)
