The construction of a completely scrambled system by graph covers
Dynamical Systems
2015-09-21 v1
Abstract
In this paper, we define a new construction of completely scrambled 0-dimensional systems using the inverse limit of sequences of directed graph covers. These examples are transitive and are not locally equicontinuous.
Cite
@article{arxiv.1509.05535,
title = {The construction of a completely scrambled system by graph covers},
author = {Takashi Shimomura},
journal= {arXiv preprint arXiv:1509.05535},
year = {2015}
}