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

21 Sep 2020 Dolinka Igor

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... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • GROUP THEORY