Exact big Ramsey degrees for finitely constrained binary free amalgamation classes
Martin Balko, David Chodounsk\'y, Natasha Dobrinen, Jan Hubi\v{c}ka, Mat\v{e}j Kone\v{c}n\'y, Lluis Vena, and Andy Zucker

TL;DR
This paper precisely determines the big Ramsey degrees for certain finitely constrained binary free amalgamation classes, refining previous bounds and establishing the existence of strong big Ramsey structures for their Fraïssé limits.
Contribution
It provides an exact characterization of big Ramsey degrees for classes defined by finitely many forbidden substructures, advancing understanding of their combinatorial and topological properties.
Findings
Exact big Ramsey degrees characterized for these classes
Fraïssé limits admit strong big Ramsey structures
Automorphism groups have metrizable universal completion flows
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.
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
