Idempotents in the Ellis semigroup of Floyd-Auslander systems
Gabriel Fuhrmann, Chunlin Liu

TL;DR
This paper characterizes non-tame Floyd-Auslander systems via minimal idempotents in their Ellis semigroup, providing a criterion to distinguish tame from non-tame systems and constructing new examples of non-tame systems with many idempotents.
Contribution
It introduces a new criterion based on minimal idempotents for identifying non-tame Floyd-Auslander systems and constructs a family of regular almost automorphic systems with uncountably many minimal idempotents.
Findings
Non-tame systems have uncountably many minimal idempotents.
Tameness is characterized by the size of the minimal idempotent set.
New examples of non-tame systems with large sets of idempotents are constructed.
Abstract
We study minimal idempotents in the Ellis semigroup associated with a Floyd-Auslander system . We show that is non-tame if and only if , which happens exactly when the factor map onto the maximal equicontinuous factor possesses uncountably many non-invertible fibres. This yields an easy-to-check criterion for distinguishing tame from non-tame Floyd-Auslander systems and, more importantly, provides an entire family of regular almost automorphic systems with . Notably, all previously known regular almost automorphic non-tame systems exhibited only a small (i.e. ) set of minimal idempotents. We obtain our result by leveraging an alternative characterisation of (non)-tameness through, what we call, choice domains.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Differential Equations and Dynamical Systems · semigroups and automata theory · Quantum chaos and dynamical systems
