The construction of a completely scrambled system by graph covers (Q2790926)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The construction of a completely scrambled system by graph covers |
scientific article; zbMATH DE number 6552051
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The construction of a completely scrambled system by graph covers |
scientific article; zbMATH DE number 6552051 |
Statements
The construction of a completely scrambled system by graph covers (English)
0 references
8 March 2016
0 references
dynamical system
0 references
completely scrambled
0 references
graph covers
0 references
The author constructs a family of 0-dimensional dynamical systems which are completely scrambled, topologically transitive and not locally equicontinuous. To this purpose he uses the construction of the inverse limit of a sequence of graph covers, developed in an earlier paper [the author, Topology Appl. 161, 178--195 (2014; Zbl 1332.37012)].
0 references
