From: Michael Hennebry on 5 Mar 2010 10:51 What is the minimum height of a full dimensional n-simplex whose vertices are members {0, 1}**n ? Equivalently, what is the minimum non-zero distance to the origin from a hyperplane defined by members of {0, 1}**n ? The answer is at most 1/sqrt(n) . The corner simplex provides an example. A smaller answer might be possible if the simplex is oblique enough that the height-defining segment does not lie entirely within the hypercube. Anyone have the answer or a lower bound on it?
|
Pages: 1 Prev: aren't getting enough JSH? Next: summary of some proofs of this book #490 Correcting Math |