The main result reads as follows: Let \(\mathcal C\) be a finite family of convex sets in \({\mathbb R}^d\), \(k\in\{1, ldots, d\}\), and \(m(k, d) = \max\{d + 1, 2(d - k + 1)\}\). If \(\mathcal C\) contains a~\(k\)-dimensional cone for every subfamily \({\mathcal C}^*\) of \(\mathcal C\) of size at most \(m(k, d)\), then so does \(\bigcap {\mathcal C}\). The author also gives a Helly-type theorem, continuing [\textit{M. Katchalski}, Isr. J. Math. 10, 465--470 (1971; Zbl 0226.52002); Can. Math. Bull. 21, 121--123 (1978; Zbl 0373.52007)].
Recommendations
Cites work
- A Generalization of Helly's Theorem
- A Helly type Theorem for Convex Sets
- Convex and Discrete Geometry
- Helly-type problems
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 236540 (Why is no real title available?)
- scientific article; zbMATH DE number 3214278 (Why is no real title available?)
- The dimension of intersections of convex sets
- Two Helly Type Theorems
- Unique Minimal Representations with Positive Bases
This page was built for publication: Positive bases, cones, Helly-type theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563211)
