A268408 Triangle T(d,v) read by rows: the number of hyper-tetrahedra with volume v/d! defined by selecting d+1 vertices of the d-dimensional unit-hypercube.
0, 1, 0, 4, 12, 56, 2, 1360, 2672, 320, 16, 350000, 431232, 107904, 12864, 3872, 320, 255036992, 234667968, 98251776, 19523136, 10633728, 1615552, 1182720, 163520, 127360, 13440
Offset: 1
Examples
In d=2, 4 tetrahedra (triangles) are defined by taking subsets of d+1=3 vertices out of the 2^2=4 vertices of the unit square. Each of them has the same volume (area) 1/2!, so T(d=2,v=1)=4. In d=3, 12 = T(d=3,v=0) tetrahedra with zero volume are defined by taking subsets of d+1=4 vertices out of the 2^3=8 vertices of the unit cube. These are the cases of taking any 4 vertices on a common face. (There are 6 faces and two different edge sets for each of them; one with edges along the cube's edges, and one with edges along the face diagonals.) The triangle starts in row d=1 as follows: 0 1; 0 4; 12 56 2; 1360 2672 320 16 ; 350000 431232 107904 12864 3872 320;
Links
- J. Brandts, Sander Dijkhuis et al, There are only two nonobtuse binary triangulations of the unit n-cube, arXiv:1209.3875 and Comput. Geometry 46 (2013) 286
Comments