scholarly journals Direct topological factorization for topological flows

2015 ◽  
Vol 37 (3) ◽  
pp. 837-858
Author(s):  
TOM MEYEROVITCH

This paper considers the general question of when a topological action of a countable group can be factored into a direct product of non-trivial actions. In the early 1980s, D. Lind considered such questions for $\mathbb{Z}$-shifts of finite type. In particular, we study direct factorizations of subshifts of finite type over $\mathbb{Z}^{d}$ and other groups, and $\mathbb{Z}$-subshifts which are not of finite type. The main results concern direct factors of the multidimensional full $n$-shift, the multidimensional $3$-colored chessboard and the Dyck shift over a prime alphabet. A direct factorization of an expansive $\mathbb{G}$-action must be finite, but an example is provided of a non-expansive $\mathbb{Z}$-action for which there is no finite direct-prime factorization. The question about existence of direct-prime factorization of expansive actions remains open, even for $\mathbb{G}=\mathbb{Z}$.

Author(s):  
Manfred Denker ◽  
Christian Grillenberger ◽  
Karl Sigmund

1974 ◽  
Vol 8 (2) ◽  
pp. 167-175 ◽  
Author(s):  
Ethan M. Coven ◽  
Michael E. Paul

2005 ◽  
Vol 21 (6) ◽  
pp. 1407-1414 ◽  
Author(s):  
Huo Yun Wang ◽  
Jin Cheng Xiong

1986 ◽  
Vol 6 (3) ◽  
pp. 415-448 ◽  
Author(s):  
Karl Petersen

AbstractVarious definitions of the entropy for countable-state topological Markov chains are considered. Concrete examples show that these quantities do not coincide in general and can behave badly under nice maps. Certain restricted random walks which arise in a problem in magnetic recording provide interesting examples of chains. Factors of some of these chains have entropy equal to the growth rate of the number of periodic orbits, even though they contain no subshifts of finite type with positive entropy; others are almost sofic – they contain subshifts of finite type with entropy arbitrarily close to their own. Attempting to find the entropies of such subshifts of finite type motivates the method of entropy computation by loop analysis, in which it is not necessary to write down any matrices or evaluate any determinants. A method for variable-length encoding into these systems is proposed, and some of the smaller subshifts of finite type inside these systems are displayed.


Sign in / Sign up

Export Citation Format

Share Document