I wonder if this question has been considered before and if anything is known. My search attempts have failed so far.
Let's consider the n-dimesnional cube, $[0,1]^n$, and let's call a simplex with vertices in $\{0,1\}^n$, nice if it has volume $\frac{1}{n!}$. How many triangulations does the unit cube have into nice simplices?
This is not my answer originally (see comments above) so I'm making it community wiki. Just among pulled triangulations of the 3-cube (that is, triangulations formed by choosing a vertex, triangulating the squares of the cube that do not touch this vertex, and connecting each of these triangles to the chosen vertex) there are eight choices of vertex to pull, and eight choices of how to triangulate. As TheMaskedAvenger has described, these may also be described by partitioning the cube into three square pyramids and then triangulating each pyramid in one of two ways, as shown below.
There are 60 of these pulled triangulations, not 64, because for each chosen vertex one of the triangulations is the same as one where the opposite vertex is chosen.
There are also 12 more triangulations of the 3-cube that are a little trickier to describe. Choose one of the four triangulations that are pulled from two opposite vertices. Then, choose two opposite square faces of the cube, merge the two tetrahedra that touch that face, and split the resulting two pyramids in the other way. So altogether the cube has at least 72 triangulations.
In 4d, you can then do a pulling triangulation again, choosing one of these 72 triangulations in each of the four 3-cube facets that are opposite the chosen vertex. You can't choose them independently (if we're forming triangulations rather than partitions) because the diagonals have to match on the squares connecting these 3-cubes. Even so the number of possible triangulations seems to grows very quickly with the dimension...
Finding the exact number of unimodular triangulations of a cube in higher dimension is, I would say, out of reach. In fact, I would say the number is doubly exponential in n (that is, exponential in the number of vertices). [Update: see my other answer for a doubly exponential lower bound]
For dimension 3 I can reproduce David's count of 72 in a different fashion:
Every unimodular triangulation of the 3-cube uses one (and only one) of the four diameters of the cube. So, it suffices to count the triangulations that use one particular diameter. For this do the following: if you project the cube along the direction of the diameter used, you see a hexagon. The vertices to which the diameter is joined in your triangulation must form a sub polygon of this hexagon with the center inside. There are 18 possibilities:
You need to check that all possibilities do indeed extend to triangulations of the cube (so far we have only described the "star" of the diameter used) and that no possibility extends in two ways. Once you check this (there are 5 combinatorially different cases to understand) you will have proved that there are 18 triangulations using that diameter, and 72 in total.
Here is a lower bound of $2^{\Omega(2^n)}$ for the number of unimodular triangulations.
Let me start with the triangulation described by Włodzimierz Holsztyński, which is indeed quite classical and I will call the standard triangulation of the $n$-cube. Its $n$-simplices have as vertices the $n!$ monotone paths of vertices from $(0,\dots,0)$ to $(1,\dots,1)$.
Observe that the standard triangulation $T$ has the following property: for each $2$-face of the cube, the two triangles in which $T$ divides that face have the same link (that is, they are joined to the same simplices). This implies we can perform a flip on that $2$-face: we can remove the two triangles in it together with all simplices containing them, and insert the other triangulation of the quadrilateral, with the same link as the old one had. (This is a higher dimensional analogue of changing the triangulation in a square pyramid, as described in David Eppstein's or TMA's answers)
Now, if we find $k$ of these $2$-faces in which we can perform flips independently (that is, if no two of the flips affect a common simplex) then we get $2^k$ triangulations of the cube. One way to guarantee that the flips are independent is to use $2$-faces at the same level, by which I mean the following: every $2$-face is defined by $n-2$ equalities of the form $x_i=\epsilon_i$, where $\epsilon_i\in \{0,1\}$. I say a $2$-face has level $l$ if exactly $l$ of the $\epsilon$'s are equal to $1$.
The number of $2$-faces at level $l$ is ${n \choose n-2}{n-2 \choose l}$ which, for $l\sim (n-2)/2$, grows as $2^n n^{3/2}$ (modulo a constant). Thus, we have at least $$ 2^{\Omega(2^n n^{3/2})} $$ unimodular triangulations of the $n$-cube.
It is also easy to give a crude upper bound that is not that far from the lower bound. Observe that a unimodular triangulation is a set of $n!$ $n$-simplices taken out from a total of (at most) $2^n \choose n+1$ $n$-simplices. Thus, the number of unimodular triangulations (or, of all triangulations, for that matter) is at most $$ {{2^n \choose n+1} \choose n!} \le 2^{O(n^{n+2})} $$
There are at least $\ 2^{n-1}\ $ triangulations of $\ [0;1]^n\ $ into nice $n$-simplexes. I am quite sure that there are exactly $\ 2^{n-1}\ $ of them.
CONSTRUCTION First I'll present one nice triangulation of $\ [0;1]^n$.
NOTE Włodzimerz Kuperberg and myself have obtained this nice triangulation (see below; but of course we didn't use term nice) independently. I did it during the first half of 1996 (I don't know Włodek K's exact date). Looking back, it is closely related to the old homological/combinatorial triangulation of a prism (one may check for example a Pontryagin's small monograph on Combinatorial Topology; see Лев Семёнович Понтря́гин); small but great.
Let $\ \pi:\{1 \ldots n\}\rightarrow \{1 \ldots n \}\ $ be an arbitrary permutation. Let
$$\Delta_{\pi}\ :=\ \{(x_1\ldots x_n)\in [0;1]^n\ :\ \forall_{k=2}^n\ x_{\pi(k-1)}\le x_{\pi(x_k)}\} $$
The family of $n$-simplexes $\ \Delta_{\pi} : \pi\in S_n,\ $ together with their simplicial faces, forms a nice triangulation (which has $\ n!\ $ simplexes of dimension $\ n.\ $ We get the $\ 2^{n-1}\ $ such triangulations due to the $\ \mathbb Z_2^n\ $ action of isometries on $\ [0;1]^n$.
I feel that there are no other nice triangulations in $\ [0;1]^n$.
The example below was written by David Eppstein, and it was conceived mostly by The Mask Avenger:
COUNTEREXAMPLE (Yes!) in dimension 3 If you see a counterexample in dimension $\ 3\ $ then here is a place to write down a $5$-th nice triangulation (just replace each star by a real number)--here simplexes are specified by their vertices:
Of course a picture can be nicer and (almost :-) as good.
From wh again:
@GjergjiZaimi -- thank you for your Question. Then, The Masked Avenge, David Eppstein and Pietro Majer--thank you for your solutions and comments; and all of you: TMA, David, and Pietro--for your patient dealing with my difficulties.
