Let $V_n$ be the least real number such that for every convex subset of $\mathbb{R}^n$ with measure $1$ there is a containing simplex with measure $V_n$. What is known about $V_n$? Is there a known general formula? If not, then what is the best known bounds on $V_n$?
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
4
|
|
||||||
|
|
3
|
The paper Parallelotopes of Maximum Volume in a Simplex by Lassak gives the maximum possible volume of a parallelotope in a simplex as $n!/n^n$ times the volume of the simplex. This gives us a bound of $V_n \geq n^n/n!$, which I suspect is tight. |
|||
|
|
