Trees in positive entropy subshifts

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.

arXiv comment8 pages; v2 adds proofs of some claims and fixes a terminological confusion in the intro