2000 character limit reached
Exact big Ramsey degrees for finitely constrained binary free amalgamation classes
Published 15 Oct 2021 in math.LO and math.CO | (2110.08409v3)
Abstract: We characterize the big Ramsey degrees of free amalgamation classes in finite binary languages defined by finitely many forbidden irreducible substructures, thus refining the recent upper bounds given by Zucker. Using this characterization, we show that the Fra\"iss\'e limit of each such class admits a strong big Ramsey structure, implying that the automorphism group of the Fra\"iss\'e limit has a metrizable universal completion flow.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.