Fraïssé's Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916029373874176 |
|---|---|
| author | Mašulović, Dragan Toljić, Veljko |
| author_facet | Mašulović, Dragan Toljić, Veljko |
| contents | In this paper we show that a countable structure admitting a finite monomorphic decomposition has finite big Ramsey degrees if and only if so does every monomorphic part in its minimal monomorphic decomposition. The necessary prerequisite for this result is the characterization of monomorphic structures with finite big Ramsey degrees: a countable monomorphic structure has finite big Ramsey degrees if and only if it is chainable by a chain with finite big Ramsey degrees. Interestingly, both characterizations require deep structural properties of chains. Fraïssé's Conjecture (actually, its positive resolution due to Laver) is instrumental in the characterization of monomorphic structures with finite big Ramsey degrees, while the analysis of big Ramsey combinatorics of structures admitting a finite monomorphic decomposition requires a product Ramsey theorem for big Ramsey degrees. We find this last result particularly intriguing because big Ramsey degrees misbehave notoriously when it comes to general product statements. In the addendum, we combine a recent result by Oudrar and Pouzet with our analysis of finite big Ramsey degrees for structures admitting finite monomorphic decomposition to characterize the existence of finite Big Ramsey degrees for all countable relational structures whose language has a linear order and age has polynomial growth. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_20307 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Fraïssé's Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition Mašulović, Dragan Toljić, Veljko Logic Combinatorics 06A05, 05C55 In this paper we show that a countable structure admitting a finite monomorphic decomposition has finite big Ramsey degrees if and only if so does every monomorphic part in its minimal monomorphic decomposition. The necessary prerequisite for this result is the characterization of monomorphic structures with finite big Ramsey degrees: a countable monomorphic structure has finite big Ramsey degrees if and only if it is chainable by a chain with finite big Ramsey degrees. Interestingly, both characterizations require deep structural properties of chains. Fraïssé's Conjecture (actually, its positive resolution due to Laver) is instrumental in the characterization of monomorphic structures with finite big Ramsey degrees, while the analysis of big Ramsey combinatorics of structures admitting a finite monomorphic decomposition requires a product Ramsey theorem for big Ramsey degrees. We find this last result particularly intriguing because big Ramsey degrees misbehave notoriously when it comes to general product statements. In the addendum, we combine a recent result by Oudrar and Pouzet with our analysis of finite big Ramsey degrees for structures admitting finite monomorphic decomposition to characterize the existence of finite Big Ramsey degrees for all countable relational structures whose language has a linear order and age has polynomial growth. |
| title | Fraïssé's Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition |
| topic | Logic Combinatorics 06A05, 05C55 |
| url | https://arxiv.org/abs/2407.20307 |