Partitions of points into intersecting tetrahedra
type: Item
instance of: scholarly article
title: Partitions of points into intersecting tetrahedra
zbMATH Open document ID: 0697.05007
DOI: 10.1016/0012-365X(90)90180-P
author: Jean-Pierre Roudneff
published in: Discrete Mathematics
publication date: 1990-01-01T00:00:00Z
review text: Radon's theorem asserts that any set S of \(d+2\) point in \({\mathbb{R}}^ d\) has a partition into two subsets \(S_ 1\) and \(S_ 2\) such that \(Conv(S_ 1)Conv(S_ 2)\neq \emptyset\) where \(Conv(S_ i)\) denotes the convex hull of \(S_ i\) Tverberg proved its generalization stated by the following theorem: Any set S of \((m-1)(d+1)+1\) points in \({\mathbb{R}}^ d\) has a partition into m disjoint subsets \(S_ 1,S_ 2,...,S_ m\) such that \(Conv(S_ 1)\cap Conv(S_ 2)\neq \emptyset,\) where \(Conv(S_ i)\) denotes the convex hull of \(S_ i\). Tverberg proved its generalization stated by the following theorem: Any set S of \((m-1)(d+1)\) points in \({\mathbb{R}}^ d\) has a partition into m disjoint subsets \(S_ 1,S_ 2,...,S_ m\) such that \(\cap^{m}_{i=1}Conv(S_ i)\neq \emptyset.\) Reay conjectured that any set of (m-1) \((d+1)+k+1\) points in general position in \({\mathbb{R}}^ d\), with \(0\leq k\leq d\) has a partition into m disjoint subsets \(S_ 1,S_ 2,...,S_ m\) such that \(\cap^{m}_{i=1}Conv(S_ i)\) is k-dimensional. The author proves this conjecture for \(d=3\).
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 4142045
zbMATH Keywords: intersecting tetrahedra
zbMATH Keywords: Radon's theorem
MaRDI profile type: Publication
cites work: An extension of Radon's theorem
cites work: Twelve general position points always form three intersecting tetrahedra
cites work: Tverberg-type theorems for pseudoconfigurations of points in the plane
cites work: A Generalization of Radon's Theorem
cites work: A generalization of Radon's theorem II
Wikidata QID: Q128109440
description: scientific article; zbMATH DE number 4142045