Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
gptkb:Euclidean_space
|
| gptkbp:category |
convex geometry
discrete geometry |
| gptkbp:field |
gptkb:combinatorial_geometry
|
| gptkbp:fileExtension |
topological Tverberg theorem
|
| gptkbp:generalizes |
gptkb:Radon's_theorem
|
| gptkbp:hasApplication |
gptkb:geometry
data analysis |
| gptkbp:namedAfter |
Helge Tverberg
|
| gptkbp:parameter |
d (dimension)
r (number of partitions) |
| gptkbp:provenBy |
Helge Tverberg
|
| gptkbp:relatedTo |
gptkb:Carathéodory's_theorem
gptkb:Helly's_theorem centerpoint theorem |
| gptkbp:sentence |
Given (r-1)(d+1)+1 points in d-dimensional Euclidean space, they can be partitioned into r parts whose convex hulls all intersect.
|
| gptkbp:yearProposed |
1966
|
| gptkbp:bfsParent |
gptkb:Combinatorial_geometry
gptkb:Radon's_theorem |
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Tverberg's theorem
|