The construction of a completely scrambled system by graph covers
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.