A Dual Ramsey theorem for trees
Stevo Todorcevic, Konstantinos Tyros

TL;DR
This paper extends the Graham--Rothschild Theorem to the setting of homogeneous trees, providing a dual version that broadens the theorem's applicability in combinatorics.
Contribution
It introduces a dualization of the Graham--Rothschild Theorem specifically for variable words indexed by homogeneous trees, a novel theoretical development.
Findings
Established a dual Ramsey theorem for trees
Generalized the Graham--Rothschild framework
Potential applications in combinatorics and logic
Abstract
We prove a dualization of the Graham--Rothschild Theorem for variable words indexed by homogeneous trees.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · semigroups and automata theory · Computability, Logic, AI Algorithms
