Partitions of points into intersecting tetrahedra

DOI10.1016/0012-365X(90)90180-PMaRDI QIDQ911598zbMATH OpenWikidataFDO

Authors Jean-Pierre Roudneff

Publication date 1990

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(90)90180-P

zbMATH Keywords

intersecting tetrahedraRadon's theorem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

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\).

Recommendations

• Partitions of points into simplices with k-dimensional intersection. I: The conic Tverberg's theorem
• A partition theorem of Tverberg-type for boxes in \(R^3\)
• Some variations on Tverberg's theorem
• The partition conjecture
• A generalisation of Tverberg's theorem

Cites work

• A Generalization of Radon's Theorem
• A generalization of Radon's theorem II
• An extension of Radon's theorem
• Tverberg-type theorems for pseudoconfigurations of points in the plane
• Twelve general position points always form three intersecting tetrahedra

Cited in

(13)

• New cases of Reay's conjecture on partitions of points into simplices with \(k\)-dimensional intersection
• Partitioning linear spaces into complete quadrilaterals and n-gons
• Intersection of linear and convex hulls of some partition of a given \((m+2)\)-point set in \({\mathbb R}^m\)
• The partition conjecture
• Average adjacencies for tetrahedral skeleton-regular partitions
• scientific article; zbMATH DE number 1522576 (Why is no real title available?)
• Some variations on Tverberg's theorem
• Tverberg partitions of points on the moment curve
• Partitions of points into simplices with k-dimensional intersection. I: The conic Tverberg's theorem
• Partitions of points into simplices with k-dimensional intersection. II: Proof of Reay's conjecture in dimensions 4 and 5
• A partition theorem of Tverberg-type for boxes in \(R^3\)
• Dimension of the Radon set
• Finite sets which contain their Radon points

This page was built for publication: Partitions of points into intersecting tetrahedra

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