vix.ing · top · new · best · stats · spec

Free ergodic ℤ2-systems and complexity

2016/02/10 by Van Cyr, Cyr, Van, Bryna Kra +1
Computer Science · Mathematics · #Cellular Automata and Applications #Dynamical Systems (math.DS) #FOS: Mathematics #Mathematical Dynamics and Fractals #math.DS #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1602.03439

arxiv created 2016/02/10 · openalex publication_date 2016/02/10 · arxiv updated 2016/02/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04

Abstract

Using results relating the complexity of a two dimensional subshift to its periodicity, we obtain an application to the well-known conjecture of Furstenberg on a Borel probability measure on [0,1) which is invariant under both x↦ px \pmod 1 and x↦ qx \pmod 1, showing that any potential counterexample has a nontrivial lower bound on its complexity.

Citations

Related