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.
Subject
Geometry and Topology,Logic,Mathematical Physics,Algebra and Number Theory,Analysis
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Automatic winning shifts;Information and Computation;2022-05