Combinatorics Probability Computing · 2003 · 31 citations · 0 references
Natural SciencesComputer ScienceMathematicsCombinatoricsProbability TheoryStochastic ProcessesBranching ProcessesMarkov ChainsMarkov ProcessesRamsey TheoryRecurrence RelationsBinary TreesRamsey Theory On TreesRamsey's TheoremRamsey-type TheoremsRecurrenceRecurrence PropertiesVan Der Waerden TheoryVan Der Waerden Type Problems
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.