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.
No takes yet. Share an insight, caveat, or question.
Fürstenberg et al. (2003) studied this question.