Theoremresearch
Partition theorem
Also called Matousek partition theorem, simplicial partition theorem.
Any n points in R^d can be split into r balanced simplicial cells so that a hyperplane crosses only O(r^(1-1/d)) of them.
Any n points in R^d can be split into r balanced simplicial cells so that a hyperplane crosses only O(r^(1-1/d)) of them.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag M5946F Edit this page History Report an error