The free $F$-restriction semigroups
Ganna Kudryavtseva, Ajda Lemut Furlani

TL;DR
This paper develops a geometric model for free $F$-restriction semigroups using Cayley graph expansions, enabling solutions to their word problems and extending to strong and perfect variants.
Contribution
It introduces a novel geometric model for free $F$-restriction semigroups in an extended signature, facilitating the analysis and solution of their word problems.
Findings
Constructed a geometric model based on Cayley graph quotients.
Provided models for strong and perfect $F$-restriction semigroups.
Solved the word problems for all considered free objects.
Abstract
We provide a geometric model for the free -generated -restriction semigroup in the extended signature , where the unary operation maps an element to the maximum element of its -class, and the constant is the unique left identity. This model is based on a certain quotient of the Cayley graph expansion of the free monoid with respect to the extended set of generators , where the generators from are in a bijection with the free monoid and serve to capture the maximum elements of -classes of the quotient. We also provide models for the free -generated strong and perfect -restriction semigroups in the same extended signature. The constructed models enable us to solve the word problems for all the free objects under consideration.
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 · Geometric and Algebraic Topology · Polynomial and algebraic computation
