Dual Ramsey theorem for trees

DOI10.1007/S00493-023-00009-8MaRDI QIDQ6057486zbMATH OpenOpenAlexWikidataFDO

Authors Słavomir Solecki

Publication date 4 October 2023

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1502.04442

zbMATH Keywords

dual Ramsey theorem for treesGalois connectionsordered treesRamsey theoryrigid surjection

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Abstract: The classical Ramsey theorem was generalized in two major ways: to the dual Ramsey theorem, by Graham and Rothschild, and to Ramsey theorems for trees, initially by Deuber and Leeb. Bringing these two lines of thought together, we prove the dual Ramsey theorem for trees. Galois connections between partial orders are used in formulating this theorem, while the abstract approach to Ramsey theory, we developed earlier, is used in its proof.

Review text

The aim of the present paper is to prove the Dual Ramsey Theorem for Trees, which is a common strengthening of two classical results -- Leeb's Ramsey theorem for trees and Graham and Rothschild's Dual Ramsey Theorem. It should be noted that the first one of these theorems is formulated in terms of copies of trees, and the second one in terms of partitions of finite initial segments of natural numbers. The author finds objects that generalize both: copies of trees and partitions. To this end, the two classical Ramsey theorems are restated in terms of functions. Their common generalization is then formulated using functions that turn out to come from appropriately modified Galois connections in the sense of \textit{O. Ore} [Trans. Am. Math. Soc. 55, 493--514 (1944; Zbl 0060.06204)]. This generalization, which is the main theorem of the paper, is then proved with the use of the author's abstract approach to the Ramsey theory from \textit{S. Solecki} [Adv. Math. 248, 1156--1198 (2013; Zbl 1283.05176)].

Recommendations

• A dual form of Ramsey's theorem
• Abstract approach to Ramsey theory and Ramsey theorems for finite trees
• Abstract approach to finite Ramsey theory and a self-dual Ramsey theorem
• On dual Ramsey theorems for relational structures
• A dual Ramsey theorem for finite ordered oriented graphs

Cited in

(4)

• Partitions of trees and \({{\text \textsf{ACA}}^\prime_{0}}\)
• Topological Ramsey spaces of equivalence relations and a dual Ramsey theorem for countable ordinals
• From Ramsey degrees to Ramsey expansions via weak amalgamation
• Finite Ramsey theory through category theory

This page was built for publication: Dual Ramsey theorem for trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057486)