Papers
Topics
Authors
Recent
2000 character limit reached

Big Ramsey degrees in universal inverse limit structures

Published 16 Dec 2020 in math.CO | (2012.08736v2)

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

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.