Maximal pattern complexity and structure of null systems
Jie Li, Kangbo Ouyang
Abstract
A compact metrizable system is null if its topological sequence entropy vanishes along every sequence of times. We prove that nullness is equivalent to polynomial maximal pattern complexity for every finite open cover, while equicontinuity is equivalent to sublinear maximal pattern complexity. The first characterization is obtained from finite fat-shattering at every positive scale and polynomial empirical covering of orbit-distance classes. We also construct transitive nonminimal null systems with properties excluded in the minimal setting: one is uniformly rigid and has two fixed points, and another is two-scattering. These results settle several long-standing open problems from the literature on polynomial maximal pattern growth and on the structure of transitive nonminimal null systems.
Create a lesson
Related papers
GPU-Accelerated Orbit Propagation with High-Fidelity Solar Radiation Pressure Modeling
Leandro Zardaín, Ariadna Farrés, Anna Puig et al.
A three-dimensional corner configuration involving the Omega function
Zhuowen Guo, Rongzhong Xiao, Shuhao Zhang
Hereditary Lowerability of Topological Dynamical Systems
Xiaochen Wang
A generalized push-forward construction of Sinai-Ruelle-Bowen measures
Grigorii Dvorkin
Orbital counting for relatively Anosov groups
Richard Canary, Tengren Zhang, Feng Zhu et al.
Verifiable Regularity Criterion for Conditional Expectation Operators and Conditional Mean Embeddings with Applications to Nonparametric Regression, Bayesian Inverse Problems, and Koopman Operators
Maximiliano Hertel, Ilja Klebanov, Manuel Schaller et al.