Trees in positive entropy subshifts
From MaRDI portal
Publication:6329464
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.
This page was built for publication: Trees in positive entropy subshifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6329464)
