Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Fraïssé's Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition (2407.20307v3)

Published 29 Jul 2024 in math.LO and math.CO

Abstract: 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\"{i}ss\'{e}'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.

Summary

We haven't generated a summary for this paper yet.