Papers
Topics
Authors
Recent
Search
2000 character limit reached

The construction of a completely scrambled system by graph covers

Published 18 Sep 2015 in math.DS | (1509.05535v1)

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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now