Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fraisse classes with simply characterized big Ramsey degrees

Published 5 Oct 2020 in math.CO and math.LO | (2010.02034v4)

Abstract: We formulate a property strengthening the Disjoint Amalgamation Property and prove that every Fraisse structure in a finite relational language with relation symbols of arity at most two having this property has finite big Ramsey degrees which have a simple characterization. It follows that any such Fraisse structure admits a big Ramsey structure. Furthermore, we prove indivisibility for every Fraisse structure in an arbitrary finite relational language satisfying this property. This work offers a streamlined and unifying approach to Ramsey theory on some seemingly disparate classes of Fraisse structures. Novelties include a new formulation of coding trees in terms of 1-types over initial segments of the Fraisse structure, and a direct characterization of the degrees without appeal to the standard method of "envelopes".

Summary

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.

Collections

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