Projects per year
Abstract
The category of all idempotent generated semigroups with a prescribed structure Ɛ of their idempotents E (called the biordered set) has an initial object called the free idempotent generated semigroup over Ɛ, defined by a presentation over alphabet E, and denoted by IG(Ɛ). Recently, much effort has been put into investigating the structure of semigroups of the form IG(Ɛ), especially regarding their maximal subgroups. In this paper, we take these investigations in a new direction by considering the word problem for IG(Ɛ). We prove two principal results, one positive and one negative. We show that, for a finite biordered set E, it is decidable whether a given word w ∈ E^{∗} represents a regular element; if in addition one assumes that all maximal subgroups of IG(Ɛ) have decidable word problems, then the word problem in IG(Ɛ) restricted to regular words is decidable. On the other hand, we exhibit a biorder Ɛ arising from a finite idempotent semigroup S, such that the word problem for IG(Ɛ) is undecidable, even though all the maximal subgroups have decidable word problems. This is achieved by relating the word problem of IG(Ɛ) to the subgroup membership problem in infinitely presented groups.
Original language  English 

Pages (fromto)  401432 
Number of pages  32 
Journal  Proceedings of the London Mathematical Society 
Volume  114 
Issue number  3 
Early online date  23 Jan 2017 
DOIs  
Publication status  Published  3 Mar 2017 
Fingerprint
Dive into the research topics of 'On regularity and the word problem for free idempotent generated semigroups'. Together they form a unique fingerprint.Projects
 2 Finished


Automata Languages Decidability: Automata, Languages, Decidability in Algebra
1/03/10 → 31/05/14
Project: Standard