Big Ramsey Degrees in Ultraproducts of Finite Structures
Dana Barto\v{s}ov\'a, Mirna D\v{z}amonja, Rehana Patel, Lynn Scow

TL;DR
This paper establishes a transfer principle for structural Ramsey theory from finite structures to their ultraproducts, demonstrating conditions under which ultraproducts have finite big Ramsey degrees for internal colorings, and extending known results to uncountable order types.
Contribution
It introduces a transfer principle connecting finite and infinite structures' Ramsey properties via ultraproducts, under certain set-theoretic assumptions, and extends Devlin's results to uncountable orders.
Findings
Ultraproducts of finite structures can have finite big Ramsey degrees under CH.
Finite big Ramsey degrees for $LL^*$ are demonstrated for internal colorings.
Extension of Devlin's coloring to $LL^*$ confirms finite big Ramsey degrees in uncountable orders.
Abstract
We develop a transfer principle of structural Ramsey theory from finite structures to ultraproducts. We show that under certain mild conditions, when a class of finite structures has finite small Ramsey degrees, under the (Generalized) Continuum Hypothesis the ultraproduct has finite big Ramsey degrees for internal colorings. The necessity of restricting to internal colorings is demonstrated by the example of the ultraproduct of finite linear orders. Under CH, this ultraproduct has, as a spine, , an uncountable analogue of the order type of rationals . Finite big Ramsey degrees for were exactly calculated by Devlin in \cite{Devlin}. It is immediate from \cite{Tod87} that fails to have finite big Ramsey degrees. Moreover, we extend Devlin's coloring to to show that it witnesses big Ramsey degrees of finite tuples in on every copy of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Limits and Structures in Graph Theory
