Complexity of nilsystems and systems lacking nilfactors
From MaRDI portal
Abstract: Nilsystems are a natural generalization of rotations and arise in various contexts, including in the study of multiple ergodic averages in ergodic theory, in the structural analysis of topological dynamical systems, and in asymptotics for patterns in certain subsets of the integers. We show, however, that many natural classes in both measure preserving systems and topological dynamical systems contain no higher order nilsystems as factors, meaning that the only nilsystems they contain as factors are rotations. In the ergodic setting, we show that there are spectral obstructions that give rise to this behavior. In the topological setting, nilsystems have a particular type of complexity of polynomial growth, where the polynomial (with explicit degree) is an asymptotic both from below and above. We also deduce several ergodic and topological applications of these results.
Recommendations
- A Non-2-step Nilsystem With Linear Polynomial Complexity
- Nilsequences and a structure theorem for topological dynamical systems
- Infinite-step nilsystems, independence and complexity
- Topological correspondence of multiple ergodic averages of nilpotent group actions
- On nilspace systems and their morphisms
Cites work
- scientific article; zbMATH DE number 3745547 (Why is no real title available?)
- scientific article; zbMATH DE number 3343835 (Why is no real title available?)
- A Hardy field extension of Szemerédi's theorem
- Bratteli-Vershik models for Cantor minimal systems associated to interval exchange transformations
- Convergence of multiple ergodic averages along polynomials of several variables
- Convergence of polynomial ergodic averages
- Convergence of weighted polynomial multiple ergodic averages
- Dynamical Systems on Nilmanifolds
- ERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS
- Equivalence of measure preserving transformations
- Flows on Homogeneous Spaces. (AM-53)
- Infinite-step nilsystems, independence and complexity
- Intersective polynomials and the polynomial Szemerédi theorem
- Linear equations in primes
- Linearly recurrent subshifts have a finite number of non-periodic subshift factors
- Measure-theoretic complexity of ergodic systems
- Multiple ergodic averages for three polynomials and applications
- Multiple recurrence and convergence for Hardy sequences of polynomial growth
- Multiple recurrence and nilsequences (with an appendix by Imre Ruzsa)
- Nilsequences and a structure theorem for topological dynamical systems
- Nonconventional ergodic averages and nilmanifolds
- On the eigenvalues of finite rank Bratteli-Vershik dynamical systems
- Pointwise convergence of ergodic averages for polynomial sequences of translations on a nilmanifold
- Polynomial sequences in groups
- Rank and symbolic complexity
- Regionally proximal relation of order \(d\) is an equivalence one for minimal systems and a combinatorial consequence
- Slow entropy type invariants and smooth realization of commuting measure-preserving transformations
- Substitution dynamical systems. Spectral analysis
- Systèmes de rang un gauche
- Systèmes localement de rang un
- Topological complexity
- Uniformity seminorms on \(\ell^{\infty}\) and applications
- Weakly mixing PET
Cited in
(20)- On the maximal spectral type of nilsystems
- Some open problems on multiple ergodic averages
- Bracket words: A generalisation of Sturmian words arising from generalised polynomials
- Bounded complexity, mean equicontinuity and discrete spectrum
- Sets of large values of correlation functions for polynomial cubic configurations
- Under-recurrence in the Khintchine recurrence theorem
- Variations on topological recurrence
- Dynamical parallelepipeds in minimal systems
- Minoration of the complexity function associated to a translation on the torus
- Infinite-step nilsystems, independence and complexity
- Generic properties of extensions
- Nilsequences and a structure theorem for topological dynamical systems
- Degree lowering for ergodic averages along arithmetic progressions
- A polynomial version of Sarnak's conjecture
- Nil Bohr-sets and almost automorphy of higher order
- Slow entropy of some parabolic flows
- Topological complexity, minimality and systems of order two on torus
- Slow entropy of some combinatorial constructions
- Maximal pronilfactors and a topological Wiener-Wintner theorem
- Note on the continuity of the projection in the Host-Kra factors
This page was built for publication: Complexity of nilsystems and systems lacking nilfactors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253711)
