Skip to main content
Advances in MathematicsVolume 285, November 05, 2015, Pages 1487-1510

A disjoint unions theorem for trees(Article)(Open Access)

  Save all to author list
  • aDepartment of Mathematics, University of Toronto, Toronto, M5S 2E4, Canada
  • bInstitut de Mathématiques de Jussieu, UMR 7586, 2 pl. Jussieu, case 7012, Paris Cedex 05, 75251, France
  • cMathematics Institute, University of Warwick, CV4 7AL, Coventry, United Kingdom

Abstract

We prove an infinitary disjoint unions theorem for level products of trees. To implement the proof we develop a Hales-Jewett type result for words indexed by a level product of trees. © 2015.

Author keywords

Disjoint unions theoremDual ramsey theoryHales-Jewett theoremHalpern-Läuchli theoremLevel productsTrees

Funding details

Funding sponsor Funding number Acronym
Centre National de la Recherche ScientifiqueCNRS
  • 1

    Partially supported by grants from NSERC and CNRS .

  • ISSN: 00018708
  • Source Type: Journal
  • Original language: English
  • DOI: 10.1016/j.aim.2015.08.021
  • Document Type: Article
  • Publisher: Academic Press Inc.

  Tyros, K.; Department of Mathematics, University of Toronto, Toronto, Canada
© Copyright 2016 Elsevier B.V., All rights reserved.

Cited by 3 documents

Solecki, S.
Dual Ramsey Theorem for Trees
(2023) Combinatorica
Kawach, J.K. , Todorcevic, S.
Topological Ramsey spaces of equivalence relations and a dual Ramsey theorem for countable ordinals
(2022) Advances in Mathematics
Dobrinen, N.
Ramsey theory on trees and applications
(2017) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
View details of all 3 citations
{"topic":{"name":"Compactifications; Ultrafilter; Polynomial","id":14710,"uri":"Topic/14710","prominencePercentile":67.565445,"prominencePercentileString":"67.565","overallScholarlyOutput":0},"dig":"7f974d23e95f514bef22f7cc9ff853ed416299efc86634c85c0b8816ba193387"}

SciVal Topic Prominence

Topic:
Prominence percentile: