Abstract
A graphic flow is a totally minimal flow such that the only
minimal subsets of the product flow are the graphs of the powers
of the defining homeomorphism [2]. We consider flows of the
form $(X^{k},T^{L})$, where $(X,T)$ is graphic, $k$ is a positive
integer, and $L:\{1,\ldots,k\}\to {\Bbb Z}\setminus \{0\}$. It is
shown that the isomorphism classes of these flows are
determined by the cardinality of $L^{-1}(p)$.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,General Mathematics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A Note on Double Minimality;Communications in Mathematics and Statistics;2015-03
2. On weak mixing, minimality and weak disjointness of all iterates;Ergodic Theory and Dynamical Systems;2011-10-14