Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 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

Big Ramsey degrees in universal inverse limit structures (2012.08736v2)

Published 16 Dec 2020 in math.CO

Abstract: We build a collection of topological Ramsey spaces of trees giving rise to universal inverse limit structures,extending Zheng's work for the profinite graph to the setting of Fra\"{\i}ss\'{e} classes of finite ordered binary relational structures with the Ramsey property. This work is based on the Halpern-L\"{a}uchli theorem, but different from the Milliken space of strong subtrees. Based on these topological Ramsey spaces and the work of Huber-Geschke-Kojman on inverse limits of finite ordered graphs, we prove that for each such Fra\"{\i}ss\'{e} class, its universal inverse limit structure has finite big Ramsey degrees under finite Baire-measurable colorings. For such \Fraisse\ classes satisfying free amalgamation as well as finite ordered tournaments and finite partial orders with a linear extension, we characterize the exact big Ramsey degrees.

Summary

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