So this is basically the Hadamard problem, and the maximum volume of an n-simplex is A003432 (n)/n!: 1 1 2 1/2 3 1/3 4 1/8 5 1/24 6 1/80 7 2/315 8 1/720 9 1/2520 10 1/11340 11 9/246400 12 3/394240 13 3/1971200 14 3/10250240 15 64/638512875 16 2/127702575 17 2/638512875 18 1/1876446000 19 78125/486580401635328 20 90625/3892643213082624 Charles Greathouse Analyst/Programmer Case Western Reserve University On Thu, Sep 26, 2013 at 12:06 PM, Warren D Smith <warren.wds@gmail.com>wrote:
Come to think of it, maybe there's always a simplex of maximum volume whose vertices >are cube vertices. But there are other simplices of maximum volume. E.g., Conv({(0,0), (1,0), (1/2,1)}). --Dan
--true, the "other" ones arise if some "minor" is exactly 0. But there is always a maxvol simplex with only cube vertices.
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun