Ramsey degrees: big v. small
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_ | 1866912730020052992 |
|---|---|
| author | Mašulović, Dragan |
| author_facet | Mašulović, Dragan |
| contents | In this paper we investigate algebraic properties of big Ramsey degrees in categories satisfying some mild conditions. As the first nontrivial consequence of the generalization we advocate in this paper we prove that small Ramsey degrees are the minima of the corresponding big ones. We also prove that big Ramsey degrees are subadditive and show that equality is enforced by an abstract property of objects we refer to as self-similarity. Finally, we apply the abstract machinery developed in the paper to show that if a countable relational structure has finite big Ramsey degrees, then so do its quantifier-free reducts. In particular, it follows that the reducts of (Q, <), the random graph, the random tournament and (Q, <, 0) all have finite big Ramsey degrees. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2003_03786 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Ramsey degrees: big v. small Mašulović, Dragan Combinatorics Category Theory 05C55, 18A99 In this paper we investigate algebraic properties of big Ramsey degrees in categories satisfying some mild conditions. As the first nontrivial consequence of the generalization we advocate in this paper we prove that small Ramsey degrees are the minima of the corresponding big ones. We also prove that big Ramsey degrees are subadditive and show that equality is enforced by an abstract property of objects we refer to as self-similarity. Finally, we apply the abstract machinery developed in the paper to show that if a countable relational structure has finite big Ramsey degrees, then so do its quantifier-free reducts. In particular, it follows that the reducts of (Q, <), the random graph, the random tournament and (Q, <, 0) all have finite big Ramsey degrees. |
| title | Ramsey degrees: big v. small |
| topic | Combinatorics Category Theory 05C55, 18A99 |
| url | https://arxiv.org/abs/2003.03786 |