Free idempotent generated semigroups: The word problem and structure via gain graphs

DOI10.1007/S11856-021-2214-1arXiv2003.10568MaRDI QIDQ6337286FDOQ6337286

Authors: Igor Dolinka 

Publication date: 23 March 2020

Abstract: Building on the previous extensive study of Yang, Gould and the present author, we provide a more precise insight into the group-theoretical ramifications of the word problem for free idempotent generated semigroups over finite biordered sets. We prove that such word problems are in fact equivalent to the problem of computing intersections of cosets of certain subgroups of direct products of maximal subgroups of the free idempotent generated semigroup in question, thus providing decidability of those word problems under group-theoretical assumptions related to the Howson property and the coset intersection property. We also provide a basic sketch of the global semigroup-theoretical structure of an arbitrary free idempotent generated semigroup, including the characterisation of Green's relations and the key parameters of non-regular $mathscrD$-classes. In particular, we prove that all Sch"utzenberger groups of $mathsfIG(mathcalE)$ for a finite biordered set $mathcalE$ must be among the divisors of the maximal subgroups of $mathsfIG(mathcalE)$.

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) General structure theory for semigroups (20M10)

This page was built for publication: Free idempotent generated semigroups: The word problem and structure via gain graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6337286)