Abstract
In this paper, we investigate shift spaces arising from a multidimensional graph G. In particular, we investigate nonemptiness and existence of periodic points for a multidimensional shift space. We derive sufficient conditions under which these questions can be answered affirmatively. We investigate the structure of the shift space using the generating matrices. We prove that any d-dimensional shift of finite type is finite if and only if it is conjugate to a shift generated through permutation matrices. We prove that if any triangular pattern of the form a b c can be extended to a 1 x 1 square then the two dimensional shift space possesses periodic points. We introduce the notion of an E-pair for a two dimensional shift space. Using the notion of an E-pair, we derive sufficient conditions for non-emptiness of the two dimensional shift space under discussion.
Publisher
Universitat Politecnica de Valencia
Reference16 articles.
1. A. Ballier, B. Durand, and E. Jeandel, Structural aspects of tilings, Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008.
2. R. Berger, The undecidability of the Domino Problem, Mem. Amer. Math. Soc. 66 (1966). https://doi.org/10.1090/memo/0066
3. E. M. Coven, A. S. A. Johnson, N. Jonoska, and K. Madden, The symbolic dynamics of multidimensional tiling systems, Ergodic Theory And Dynamical Systems 23, no. 2 (2003), 447-460. https://doi.org/10.1017/S014338570200113X
4. X.-C. Fu, W. Lu, P. Ashwin, and J. Duan, Symbolic representations of iterated maps, Topological Methods in Nonlinear Analysis, Journal of the Juliusz Schauder Center 18 (2001), 119-147. https://doi.org/10.12775/TMNA.2001.027
5. M. Hochman, and T. Meyerovitch, A characterization of the entropies of multidimensional shifts of finite type, Annals of Mathematics 171, no. 3 (2010), 2011-2038. https://doi.org/10.4007/annals.2010.171.2011