Key points are not available for this paper at this time.
We consider analogues of van der Waerden's theorem and Szemerédi's theorem, where arithmetic progressions are replaced by binary trees with a fixed distance between successive vertices. The proofs are based on some novel recurrence properties for Markov processes.
Fürstenberg et al. (Sat,) studied this question.