A combinatorial analogue of the Jacobian problem in automata networks

It is shown that if a mapping from the n-dimensional hypercube to itself has the property that all the boolean eigenvalues of the discrete Jacobian matrix of each element of the hypercube are zero, then it has a unique fixed point. This answers to the “Combinatorial Fixed Point Conjecture”, a combinatorial version of the Jacobian conjecture.