Trees in positive entropy subshifts




Salo Ville

PublisherMDPI AG

2021

Axioms

10

2

2075-1680

2075-1680

DOIhttps://doi.org/10.3390/axioms10020077

https://doi.org/10.3390/axioms10020077

https://research.utu.fi/converis/portal/detail/Publication/62086434



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.


Last updated on 2024-26-11 at 20:44