Surjective multidimensional cellular automata are non-wandering: A combinatorial proof

A combinatorial proof that surjective D-dimensional CA are non-wandering is given. This answers an old open question stated in Blanchard and Tisseur (2000) [3]. Moreover, an explicit upper bound for the return time is given.

► A combinatorial proof that surjective D-dimensional CA are non-wandering is given.
► This answers an old open question stated in [2] (see paper references).
► An explicit upper bound for the return time is given.