Coalgebraic methods for Ramsey degrees of unary algebras
Dragan Ma\v{s}ulovi\'c

TL;DR
This paper establishes that classes of finite unary algebras, including G-sets and M-sets, have finite small Ramsey degrees by developing a new coalgebraic approach that leverages the preservation of Ramsey properties by right adjoints.
Contribution
It introduces a novel coalgebraic method using Eilenberg-Moore coalgebras and pre-adjunctions to prove finite Ramsey degrees for broad classes of unary algebras and G-sets.
Findings
Finite M-sets have finite small Ramsey degrees for any monoid M.
Finite G-sets have finite small Ramsey degrees for any group G.
Finite objects have finite big Ramsey degrees in cofree structures.
Abstract
In this paper we are interested in the existence of small and big Ramsey degrees of classes of finite unary algebras in arbitrary (not necessarily finite) algebraic language . We think of unary algebras as -sets where is the free monoid of words over the alphabet and show that for an arbitrary monoid (finite or infinite) the class of all finite -sets has finite small Ramsey degrees. This immediately implies that the class of all finite -sets, where is an arbitrary group (finite or infinite), has finite small Ramsey degrees, and that the class of all finite unary algebras over an arbitrary (finite or infinite) algebraic language has finite small Ramsey degrees. This generalizes some Ramsey-type results of M.\ Soki\'c concerning finite unary algebras over finite languages and finite -sets for finite groups~. To do so we…
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 · semigroups and automata theory
