Elaborating the word problem for free idempotent-generated semigroups over the full transformation monoid
Igor Dolinka

TL;DR
This paper investigates the structure of free idempotent-generated semigroups over the biorder of the full transformation monoid, focusing on the vertex groups that influence the word problem's algorithmic solution.
Contribution
It explicitly determines the vertex groups for the biorder of idempotents in the full transformation monoid, advancing understanding of their algebraic structure.
Findings
Vertex groups are explicitly characterized for the biorder of $ ext{T}_n$.
The results facilitate solving the word problem for these semigroups.
Provides a detailed algebraic description of the vertex groups involved.
Abstract
With each semigroup one can associate a partial algebra, called the biordered set, which captures important algebraic and geometric features of the structure of idempotents of that semigroup. For a biordered set , one can construct the free idempotent-generated semigroup over , , which is the free-est semigroup (in a definite categorical sense) whose biorder of idempotents is isomorphic to . Studies of these intriguing objects have been recently focusing on their particular aspects, such as maximal subgroups, the word problem, etc. In 2012, Gray and Ru\v{s}kuc pointed out that a more detailed investigation into the structure of the free idempotent-generated semigroup over the biorder of , the full transformation monoid over an -element set, might be worth pursuing. In 2019, together with Gould and Yang,…
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
