Hostname: page-component-8448b6f56d-c4f8m Total loading time: 0 Render date: 2024-04-19T10:41:25.293Z Has data issue: false hasContentIssue false
  • English
  • Français

Markov Processes and Ramsey Theory for Trees

Published online by Cambridge University Press:  03 December 2003

Hillel Furstenberg  and
Benjamin Weiss
Hillel Furstenberg*
Affiliation:
Institute of Mathematics, Hebrew University, Givat Ram, Jerusalem 91904, Israel
Benjamin Weiss*
Affiliation:
Institute of Mathematics, Hebrew University, Givat Ram, Jerusalem 91904, Israel
*
(e-mail: harry@math.huji.ac.il)
(e-mail: weiss@math.huji.ac.il)
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 12 , Issue 5-6: This issue contains volume twelve, parts five and six , November 2003 , pp. 547 - 563
Copyright
Copyright © Cambridge University Press 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)