Boshernitzan’s condition, factor complexity, and an application

DOI10.1090/BPROC/90MaRDI QIDQ5099091zbMATH OpenOpenAlexFDO

Authors Van Cyr, Bryna Kra

Publication date 31 August 2022

Published in Proceedings of the American Mathematical Society, Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://arxiv.org/abs/2006.01931

zbMATH Keywords

complexitySchrödinger operatorsubshiftuniquely ergodic

Mathematics Subject Classification ID

Schrödinger operator, Schrödinger equation (35J10) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Symbolic dynamics (37B10) Topological entropy (37B40)

Abstract: Boshernitzan found a decay condition on the measure of cylinder sets that implies unique ergodicity for minimal subshifts. Interest in the properties of subshifts satisfying this condition has grown recently, due to a connection with the study of discrete Schr"odinger operators. Of particular interest is the question of how restrictive Boshernitzan's condition is. While it implies zero topological entropy, our main theorem shows how to construct minimal subshifts satisfying the condition whose factor complexity grows faster than any pre-assigned subexponential rate. As an application, via a theorem of Damanik and Lenz, we show that there is no subexponentially growing sequence for which the spectra of all discrete Schr"odinger operators associated with subshifts whose complexity grows faster than the given sequence, have only finitely many gaps.

Recommendations

• On the complexity of all ( g , f )-factors problem
• A factorisation approach to Bates's theorem
• Complexity of the Bollobás-Riordan Polynomial
• Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions
• The complexity of homomorphism factorization
• An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic
• On the deterministic complexity of factoring polynomials
• A computational approach to the Borwein-Ditor theorem

Cites work

• A condition for unique ergodicity of minimal symbolic flows
• A condition of Boshernitzan and uniform convergence in the multiplicative ergodic theorem
• A unique ergodicity of minimal symbolic flows with linear block growth
• Absolutely continuous spectrum for 1D quasiperiodic operators.
• scientific article; zbMATH DE number 3153217 (Why is no real title available?)
• Reducibility or nonuniform hyperbolicity for quasiperiodic Schrödinger cocycles
• Schrödinger operators with dynamically defined potentials
• Strictly ergodic subshifts and associated operators
• Uniqueness Theorems for Periodic Functions

Cited in

(5)

• A unique ergodicity of minimal symbolic flows with linear block growth
• Measure-theoretic complexity of ergodic systems
• Realizing ergodic properties in zero entropy subshifts
• The complexity threshold for the emergence of Kakutani inequivalence
• On the complexity function for sequences which are not uniformly recurrent

This page was built for publication: Boshernitzan’s condition, factor complexity, and an application

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5099091)