Ramsey monoids
Claudio Agostini, Eugenio Colla

TL;DR
This paper broadens the class of finite Ramsey monoids, providing a simple algebraic characterization and exploring connections to automata theory and classical Ramsey theorems.
Contribution
It enlarges the class of finite Ramsey monoids and offers a new algebraic characterization, extending previous results and linking to automata theory.
Findings
Enlarged the class of finite Ramsey monoids.
Provided a simple algebraic characterization.
Connected results to automata theory and classical Ramsey theorems.
Abstract
Recently, Solecki introduced the notion of Ramsey monoid to produce a common generalization to theorems such as Hindman's theorem, Carlson's theorem, and Gowers' FIN theorem. He proved that an entire class of finite monoids is Ramsey. Here we improve this result, enlarging this class and finding a simple algebraic characterization of finite Ramsey monoids. We extend in a similar way a result of Solecki regarding a second class of monoids connected to the Furstenberg-Katznelson Ramsey Theorem. The results obtained suggest a possible connection with Sch\"utzenberger's theorem and finite automata theory.
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
Topicssemigroups and automata theory · Advanced Topology and Set Theory · Computability, Logic, AI Algorithms
