A class of monotonely equivalent automorphisms (standard automorphisms), which includes all ergodic automorphisms with discrete spectrum and most of the well-known examples of automorphisms with zero entropy, is studied. The basic results are two necessary and sufficient conditions for standardness: the first in terms of periodic approximation and the second in terms of the asymptotic properties of words arising from a coding of most trajectories by a finite partition. Also certain monotone invariants are defined and their properties discussed.Bibliography: 39 titles.
No takes yet. Share an insight, caveat, or question.
A. Katok (1977) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: