On the stability and shadowing of tree-shifts of finite type
Abstract
We investigate relations between the pseudo-orbit-tracing property, topological stability and openness for tree-shifts. We prove that a tree-shift is of finite type if and only if it has the pseudo-orbit-tracing property which implies that the tree-shift is topologically stable and all shift maps are open. We also present an example of a tree-shift for which all shift maps are open but which is not of finite type. It also turns out, that if a topologically stable tree-shift does not have isolated points then it is of finite type.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.