Self-Dual Ramsey Degrees for Trees
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916868842848256 |
|---|---|
| author | Junge, Sebastian |
| author_facet | Junge, Sebastian |
| contents | We consider a Ramsey statement for pairs of maps between trees, where one is an embedding as defined by Deuber and the other is a rigid surjection as defined by Solecki. We show that there is no Ramsey Theorem for pairs of maps where the coloring depends on both coordinates. On the other hand, we give a characterization of the Ramsey degrees for such pairs. Furthermore, we show that our theorem on Ramsey Degrees for pairs of maps between trees implies the Ramsey Theorem for pairs of maps between linear orders as proved by Solecki. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_21819 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Self-Dual Ramsey Degrees for Trees Junge, Sebastian Combinatorics We consider a Ramsey statement for pairs of maps between trees, where one is an embedding as defined by Deuber and the other is a rigid surjection as defined by Solecki. We show that there is no Ramsey Theorem for pairs of maps where the coloring depends on both coordinates. On the other hand, we give a characterization of the Ramsey degrees for such pairs. Furthermore, we show that our theorem on Ramsey Degrees for pairs of maps between trees implies the Ramsey Theorem for pairs of maps between linear orders as proved by Solecki. |
| title | Self-Dual Ramsey Degrees for Trees |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2507.21819 |