Partition properties of the dense local order and a colored version of Milliken's theorem
C. Laflamme, L. Nguyen Van Th\'e, N. W. Sauer

TL;DR
This paper investigates the partition properties of the countable homogeneous dense local order, extending Milliken's theorem on trees to derive new finite-dimensional partition results using ideas from the rationals.
Contribution
It introduces a strengthened version of Milliken's theorem applicable to trees, enabling new insights into the partition properties of dense local orders.
Findings
Established finite-dimensional partition properties for the dense local order.
Developed a colored version of Milliken's theorem for trees.
Connected partition calculus of rationals with dense local order properties.
Abstract
We study the finite dimensional partition properties of the countable homogeneous dense local order. Some of our results use ideas borrowed from the partition calculus of the rationals and are obtained thanks to a strengthening of Milliken's theorem on 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 · Limits and Structures in Graph Theory · Functional Equations Stability Results
