Number of Bijective Orientations on n-dim. Cubes In my math club we were discussing directed graphs on n-dimensional cubes.
There are $2^n$ vertices and $n$ edges per vertex (with double-counting). An edge is either ingoing or outgoing, so there are also $2^n$ possible orientations of the edges per vertex. So it is somewhat natural to consider orientations that are bijections between the set of vertices and the set of edge-orientations.
We used a binary encoding for both sets. The vertices of the n-dim. cube are represented by $\{0,1\}^n$ (similar to a Hamming-cube) and an edge-orientation has a $1$ at the k-th place, if the edge along the k-th dimension is outgoing, 0 otherwise.
How many bijective orientations are there?
Our work was the following: There are $2^n!$ possible bijections. Not all of them are bijective orientations. There are $n2^{n-1}$ edges. Each edge puts a constraint on the bijection: If one vertex has an outgoing edge (and therefore a 1 at some k-th digit), the other must have it incoming (and therefore has a 0 at the k-th digit). So each constraint reduces the possible bijections by a half. So by our logic there should be $\frac{2^n!}{2^{n2^{n-1}}}$ bijective orientations. But we aren't sure if all the constraints are independent of each other so we came to ask for help. Thanks in advance!
By the way, if an example helps, the identity function is a bijective orientation. The vertex $0^n$ has all edges ingoing, the vertex $1^n$ has all edges outgoing and the whole orientation "flows" from $1^n$ to $0^n$.
 A: Several observations / too long for a comment.
First, let me make sure I understand what you're saying.  Your description is a bit confusing and it took me some time to figure out an interesting question out of it.  :)


*

*Let $B =\{0,1\}$, and the nodes are $v \in B^n$.  

*Let $C$ be a global configuration to orient each of the $n2^{n-1}$ edges of the hypercube.  There are $2^{n2^{n-1}}$ different $C$'s.

*Let $f_C(v) \in B^n$ describe the local edge orientations for edges of $v$, i.e. the $k$-th place of $f_C(v) = 1$ iff the edge connecting to $v$ along the $k$-th dimension is outgoing from $v$ in global configuration $C$.  Note that $f_C: B^n \to B^n$.

*You want cases where $f_C$ is bijective.  In fact, you want to count $|\{C: f_C \text{ is bijective}\}|$
Am I correct?  [Pls reply in comment.]

If so, then your basic counting argument is wrong on at least two levels.  
First, $(2^n)!$ cannot be the numerator, because many of the $(2^n)!$ bijections $B^n \to B^n$ cannot be "implemented" as an $f_C$ for some $C$.  E.g. consider a bijection $f$ which specifies that the $k$-th places of $f(u)$ and $f(v)$ both $=1$, where $u,v$ are neighboring nodes connecting along the $k$-th dimension.  Clearly that edge cannot be outgoing in both directions, so this $f$ cannot be implemented as any $f_C$.  
Second, $2^{n 2^{n-1}}$ also cannot be the denominator.  If $f_C$ is bijective, then there is a unique all-source node $s$ where all edges are outgoing, i.e. $f(s) = 1^n$, and a unique all-sink node $t$ where all edges are incoming, i.e. $f(t) = 0^n$.  However, among the set of $2^{n 2^{n-1}}$ possible $C$'s many of them will have no all-sink node, or two or more all-sink nodes, etc.  This answers your question "we aren't sure if all the [edge] constraints are independent of each other" -- the answer is NO they are not independent.
In fact the one thing we can conclude with confidence is this: Every $f_C$ (bijective or not) fully specifies $C$, because all you need is to read off what happens at each node.  Thus, the number of bijective $f_C$'s $ < $ the number of $C$'s $= 2^{n2^{n-1}}$.  

Anyway, if my understanding is correct, I think this is actually a rather interesting question!  
For $n=2$, you can in fact choose any of the $4$ nodes as all-sink and any of the remaining $3$ nodes as all-source.  If they are non-neighbors, this fully specifies $C$ and the resulting $f_C$ is bijective.  If they are neighbors, this leaves one edge unoriented, but there is exactly one way to orient it (in the direction from $s$ to $t$ along the $3$-hop path) s.t. the resulting $f_C$ is bijective.  Thus the number of bijective $f_C$'s $= 4 \times 3 = 12$.  (I am counting rotations, reflections etc as distinct.)  
I am having quite a bit of trouble visualizing what happens when $n=3$ though...
