Examples of *-commuting maps

MaRDI QIDQ6223071zbMATH OpenFDO

Authors Ben Maloney, Paulette N. Willis

Publication date 19 January 2011

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Dynamical aspects of cellular automata (37B15)

Abstract: We introduce the concept of a 1-coaligned $k$-graph and prove that the shift maps of a $k$-graph pairwise *-commute if and only if the $k$-graph is 1-coaligned. We then prove that for 2-graphs $Lambda$ generated from basic data *-commuting shift maps is equivalent to a condition that implies that $C^{\ast }(Lambda)$ is simple and purely infinite. We then consider full shift spaces and introduce a condition on a block map which ensures the associated sliding block code *-commutes with the shift.

This page was built for publication: Examples of *-commuting maps

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