Big Ramsey degrees using parameter spaces
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913879205871616 |
|---|---|
| author | Hubička, Jan |
| author_facet | Hubička, Jan |
| contents | We show that the universal homogeneous partial order has finite big Ramsey degrees and discuss several corollaries. Our proof relies on parameter spaces and the Carlson-Simpson theorem rather than on (a strengthening of) the Halpern-Läuchli theorem and the Milliken tree theorem, which are typically used to bound big Ramsey degrees in the existing literature (originating from the work of Laver and Milliken).
This new technique has many additional applications. We show that the homogeneous universal triangle-free graph has finite big Ramsey degrees, providing a short proof of a recent result by Dobrinen. Moreover, generalizing an indivisibility (vertex partition) result of Nguyen van Thé and Sauer, we give an upper bound on big Ramsey degrees of metric spaces with finitely many distances. This leads to a new combinatorial argument for the oscillation stability of the Urysohn Sphere. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2009_00967 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Big Ramsey degrees using parameter spaces Hubička, Jan Combinatorics Discrete Mathematics Logic 05D10, 05C05, 05C65, 05C55 G.2.2; F.4.1 We show that the universal homogeneous partial order has finite big Ramsey degrees and discuss several corollaries. Our proof relies on parameter spaces and the Carlson-Simpson theorem rather than on (a strengthening of) the Halpern-Läuchli theorem and the Milliken tree theorem, which are typically used to bound big Ramsey degrees in the existing literature (originating from the work of Laver and Milliken). This new technique has many additional applications. We show that the homogeneous universal triangle-free graph has finite big Ramsey degrees, providing a short proof of a recent result by Dobrinen. Moreover, generalizing an indivisibility (vertex partition) result of Nguyen van Thé and Sauer, we give an upper bound on big Ramsey degrees of metric spaces with finitely many distances. This leads to a new combinatorial argument for the oscillation stability of the Urysohn Sphere. |
| title | Big Ramsey degrees using parameter spaces |
| topic | Combinatorics Discrete Mathematics Logic 05D10, 05C05, 05C65, 05C55 G.2.2; F.4.1 |
| url | https://arxiv.org/abs/2009.00967 |