How to cut a convex polytope into simplices
โ Scribed by Helge Tverberg
- Publisher
- Springer
- Year
- 1974
- Tongue
- English
- Weight
- 105 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
What is the minimum number of cuts needed to divide a cake among IZ players so that each player receives at least l/n of the whole cake? The simple "one cuts -the other chooses" shows that one cut suffices for 2 players. It was previously known that 3 players require 3 cuts and 4 players require 4 c
Using oriented matroids, and with the help of a computer, we have found a set of 10 points in R 4 not projectively equivalent to the vertices of a convex polytope. This result confirms a conjecture of Larman [6] in dimension 4.
How to Turn a Frog into a Prince (#5 Happy Ever Regency Series)