Abstract
In this work we characterize shift spaces over infinite countable alphabets that can be endowed with an inverse semigroup operation. We give sufficient conditions under which zero-dimensional inverse semigroups can be recoded as shift spaces whose correspondent inverse semigroup operation is a 1-block operation, that is, it arises from a group operation on the alphabet. Motivated by this, we go on to study block operations on shift spaces and, in the end, we prove our main theorem, which states that Markovian shift spaces, which can be endowed with a 1-block inverse semigroup operation, are conjugate to the product of a full shift with a fractal shift.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Clifford, A.H., Preston, G.B.: The algebraic theory of semigroups II. In: Mathematical Surveys and Monographs, 7 (1967)
Gonçalves, D., Sobottka, M., Starling, C.: Sliding block codes between shift spaces over infinite alphabets. Math. Nachr. 289(17), 2178–2191 (2016)
Gonçalves, D., Sobottka, M., Starling, C.: Two-sided shift spaces over infinite alphabets. J. Austral. Math. Soc. (2017). doi:10.1017/S1446788717000039
Kitchens, B.P.: Expansive dynamics on zero-dimensional groups. Ergod. Theory Dyn. Syst. 7(2), 249–261 (1987)
Lawson, M.V.: Inverse Semigroups: The Theory of Partial Symmetries. World Scientific, Singapore (1998)
Lind, D.A., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)
Ott, W., Tomforde, M., Willis, P.N.: One-sided shift spaces over infinite alphabets. In: New York Journal of Mathematics. NYJM Monographs 5. State University of New York, University at Albany, Albany, p. 54 (2014)
Sindhushayana, N.T., Marcus, B., Trott, M.: Homogeneous shifts. IMA J. Math. Control Inf. 14(3), 255–287 (1997)
Sobottka, M.: Topological quasi-group shifts. Discret. Contin. Dyn. Syst. 17, 77–93 (2007)
Sobottka, M., Gonçalves, D.: A note on the definition of sliding block codes and the Curtis–Hedlund–Lyndon Theorem. J. Cell. Autom. 12(3–4), 209–215 (2017)
Acknowledgements
D. Gonçalves was partially supported by CNPq and Capes Project PVE085/2012. M. Sobottka was supported by CNPq-Brazil Grants 304813/2012-5, 480314/2013-6 and 308575/2015-6. Part of this work was carried out while the author was postdoctoral fellow of CAPES-Brazil at Center for Mathematical Modeling, University of Chile. C. Starling was supported by CNPq, and work on this paper occured while the author held a postdoctoral fellowship at UFSC. We thank the referee for many helpful suggestions and for a thorough reading.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Mark V. Lawson.
Rights and permissions
About this article
Cite this article
Gonçalves, D., Sobottka, M. & Starling, C. Inverse semigroup shifts over countable alphabets. Semigroup Forum 96, 203–240 (2018). https://doi.org/10.1007/s00233-017-9858-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00233-017-9858-5