arXiv · 1602.03439
Free ergodic $\mathbb{Z}^2$-systems and complexity
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\mapsto px \pmod 1$ and $x\mapsto qx \pmod 1$, showing that any potential counterexample has a nontrivial lower bound on its complexity.
Explore related subjects
Keep this discovery
Van Cyr, Bryna Kra. 2016-02-10. Free ergodic $\mathbb{Z}^2$-systems and complexity. https://arxiv.org/abs/1602.03439
Cite the original work for its findings. Save a collection to share your selection of sources.