Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the stability and shadowing of tree-shifts of finite type (2403.04456v1)

Published 7 Mar 2024 in math.DS

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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.