Markov processes and Ramsey theory for trees

Hillel Furstenberg; Benjamin Weiss

doi:10.1017/s0963548303005893

Markov processes and Ramsey theory for trees

Hillel Furstenberg, Benjamin Weiss

Hebrew University of Jerusalem

Research output: Contribution to journal › Article › peer-review

23 Scopus citations

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.

Original language	English
Pages (from-to)	547-563
Number of pages	17
Journal	Combinatorics Probability and Computing
Volume	12
Issue number	5-6 SPEC. ISS.
DOIs	https://doi.org/10.1017/s0963548303005893
State	Published - Sep 2003
Externally published	Yes

Access to Document

10.1017/s0963548303005893

Cite this

@article{ba99a77631a245ee880107060b54dd7a,

title = "Markov processes and Ramsey theory for trees",

abstract = "We consider analogues of van der Waerden's theorem and Szemer{\'e}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.",

author = "Hillel Furstenberg and Benjamin Weiss",

year = "2003",

month = sep,

doi = "10.1017/s0963548303005893",

language = "אנגלית",

volume = "12",

pages = "547--563",

journal = "Combinatorics Probability and Computing",

issn = "0963-5483",

publisher = "Cambridge University Press",

number = "5-6 SPEC. ISS.",

}

TY - JOUR

T1 - Markov processes and Ramsey theory for trees

AU - Furstenberg, Hillel

AU - Weiss, Benjamin

PY - 2003/9

Y1 - 2003/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=2942611377&partnerID=8YFLogxK

U2 - 10.1017/s0963548303005893

DO - 10.1017/s0963548303005893

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:2942611377

SN - 0963-5483

VL - 12

SP - 547

EP - 563

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

IS - 5-6 SPEC. ISS.

ER -

Markov processes and Ramsey theory for trees

Abstract

Access to Document

Other files and links

Fingerprint

Cite this