Balanced simplices

From MaRDI portal




Abstract: An additive cellular automaton is a linear map on the set of infinite multidimensional arrays of elements in a finite cyclic group mathbbZ/mmathbbZ. In this paper, we consider simplices appearing in the orbits generated from arithmetic arrays by additive cellular automata. We prove that they are a source of balanced simplices, that are simplices containing all the elements of mathbbZ/mmathbbZ with the same multiplicity. For any additive cellular automaton of dimension 1 or higher, the existence of infinitely many balanced simplices of mathbbZ/mmathbbZ appearing in such orbits is shown, and this, for an infinite number of values m. The special case of the Pascal cellular automata, the cellular automata generating the Pascal simplices, that are a generalization of the Pascal triangle into arbitrary dimension, is studied in detail.









This page was built for publication: Balanced simplices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472924)