Trees in positive entropy subshifts
Dynamical Systems
2021-06-02 v2
Abstract
I give a simple proof for the fact that positive entropy subshifts contain infinite binary trees where branching happens synchronously in each branch, and that the branching times form a set with positive lower asymptotic density.
Keywords
Cite
@article{arxiv.1911.08146,
title = {Trees in positive entropy subshifts},
author = {Ville Salo},
journal= {arXiv preprint arXiv:1911.08146},
year = {2021}
}
Comments
8 pages; v2 adds proofs of some claims and fixes a terminological confusion in the intro