2000 character limit reached
More on tame dynamical systems
Published 19 Feb 2023 in math.DS, math.FA, and math.GN | (2302.09571v1)
Abstract: In this work, on the one hand, we survey and amplify old results concerning tame dynamical systems and, on the other, prove some new results and exhibit new examples of such systems. In particular, we study tame symbolic systems and establish a neat characterization of tame subshifts. We also provide sufficient conditions which ensure that certain coding functions are tame. Finally we discuss examples where certain universal dynamical systems associated with some Polish groups are tame.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.