Abstract
We show that a coded system is mixing if and only if it is totally transitive. If in addition it has a generator the length of whose elements are relatively prime, then it has strong property P. We continue by showing that a mixing half-synchronized system has such a generator. Moreover, we give an example of a mixing coded system which does not have any generator the length of whose elements are relatively prime.
References
[1] J. Banks, T. T. D. Nguyen, P. Oprocha, B. Stanley and B. Trotta, Dynamics of spacing shifts, Discrete Contin. Dyn. Syst. 33 (2013), no. 9, 4207–4232. 10.3934/dcds.2013.33.4207Suche in Google Scholar
[2] F. Blanchard, Fully positive topological entropy and topological mixing, Symbolic dynamics and its Applications (New Haven 1991), Contemp. Math. 135, American Mathematical Society, Providence (1992), 95–105. 10.1090/conm/135/1185082Suche in Google Scholar
[3] F. Blanchard and G. Hansel, Systémes codés, Theoret. Comput. Sci. 44 (1986), no. 1, 17–49. 10.1016/0304-3975(86)90108-8Suche in Google Scholar
[4] J. Epperlein, D. Kwietniak and P. Oprocha, Mixing properties in coded systems, preprint (2015), https://arxiv.org/abs/1503.02838. 10.1007/978-3-030-16833-9_10Suche in Google Scholar
[5] D. Fiebig and U. Fiebig, Covers for coded systems, Symbolic Dynamics and its Applications (New Haven 1991), Contemp. Math. 135, American Mathematical Society, Providence (1992), 139–179. 10.1090/conm/135/1185086Suche in Google Scholar
[6] W. Huang and X. Ye, Topological complexity, return times and weak disjointness, Ergodic Theory Dynam. Systems 24 (2004), no. 3, 825–846. 10.1017/S0143385703000543Suche in Google Scholar
[7] W. Huang and X. Ye, Dynamical systems disjoint from any minimal system, Trans. Amer. Math. Soc. 357 (2005), no. 2, 669–694. 10.1090/S0002-9947-04-03540-8Suche in Google Scholar
[8] D. Lind and B. Marcus, An Introduction to Symbolic Dynamics and Coding, Cambridge University Press, Cambridge, 1995. 10.1017/CBO9780511626302Suche in Google Scholar
[9] T. K. Subrahmonian Moothathu and P. Oprocha, Syndetic proximality and scrambled sets, Topol. Methods Nonlinear Anal. 41 (2013), no. 2, 421–461. Suche in Google Scholar
© 2020 Walter de Gruyter GmbH, Berlin/Boston
Artikel in diesem Heft
- Frontmatter
- On absolutely Baire nonmeasurable functions
- Existence of special rainbow triangles in weak geometries
- Images of Bernstein sets via continuous functions
- Square-integrable representations and multipliers
- Semigroups of pathological sets
- Points of density and ideals of subsets of ℕ
- On Kharazishvili type measures in infinite-dimensional Polish vector spaces
- Families of symmetric Cantor sets from the category and measure viewpoints
- On the Gitik–Shelah theorem
- On equidistant lines of given line configurations
- On convergence of sequences of functions possessing closed graphs
- On combinatorial and set-theoretical aspects of some finite and infinite point sets
- On Kuratowski partitions in the Marczewski and Laver structures and Ellentuck topology
- Automorphism groups of mono-unary algebras and CH
- On topologies related to the extension of the Lebesgue measure
- An abstract formulation of a theorem of Sierpiński on the nonmeasurable sum of two measure zero sets
- Local affine selections of convex set-valued functions
- On orbits without the Baire property
- Mann iteration process for monotone nonexpansive mappings with a graph
- Mixing coded systems
- Methods of comparison of families of real functions in porosity terms
Artikel in diesem Heft
- Frontmatter
- On absolutely Baire nonmeasurable functions
- Existence of special rainbow triangles in weak geometries
- Images of Bernstein sets via continuous functions
- Square-integrable representations and multipliers
- Semigroups of pathological sets
- Points of density and ideals of subsets of ℕ
- On Kharazishvili type measures in infinite-dimensional Polish vector spaces
- Families of symmetric Cantor sets from the category and measure viewpoints
- On the Gitik–Shelah theorem
- On equidistant lines of given line configurations
- On convergence of sequences of functions possessing closed graphs
- On combinatorial and set-theoretical aspects of some finite and infinite point sets
- On Kuratowski partitions in the Marczewski and Laver structures and Ellentuck topology
- Automorphism groups of mono-unary algebras and CH
- On topologies related to the extension of the Lebesgue measure
- An abstract formulation of a theorem of Sierpiński on the nonmeasurable sum of two measure zero sets
- Local affine selections of convex set-valued functions
- On orbits without the Baire property
- Mann iteration process for monotone nonexpansive mappings with a graph
- Mixing coded systems
- Methods of comparison of families of real functions in porosity terms