Infinite-step nilsystems, independence and complexity
Dynamical Systems
2011-05-19 v1
Abstract
An -step nilsystem is an inverse limit of minimal nilsystems. In this article is shown that a minimal distal system is an -step nilsystem if and only if it has no nontrivial pairs with arbitrarily long finite IP-independence sets. Moreover, it is proved that any minimal system without nontrivial pairs with arbitrarily long finite IP-independence sets is an almost one to one extension of its maximal -step nilfactor, and each invariant ergodic measure is isomorphic (in the measurable sense) to the Haar measure on some -step nilsystem. The question if such a system is uniquely ergodic remains open. In addition, the topological complexity of an -step nilsystem is computed, showing that it is polynomial for each nontrivial open cover.
Cite
@article{arxiv.1105.3584,
title = {Infinite-step nilsystems, independence and complexity},
author = {P. D. Dong and S. Donoso and A. Maass and S. Shao and X. D. Ye},
journal= {arXiv preprint arXiv:1105.3584},
year = {2011}
}
Comments
29 pages