{"paper":{"title":"On regularity and the word problem for free idempotent generated semigroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Igor Dolinka, Nik Ru\\v{s}kuc, Robert D. Gray","submitted_at":"2014-12-16T20:58:10Z","abstract_excerpt":"The category of all idempotent generated semigroups with a prescribed structure $\\mathcal{E}$ of their idempotents $E$ (called the biordered set) has an initial object called the free idempotent generated semigroup over $\\mathcal{E}$, defined by a presentation over alphabet $E$, and denoted by $\\mathsf{IG}(\\mathcal{E})$. Recently, much effort has been put into investigating the structure of semigroups of the form $\\mathsf{IG}(\\mathcal{E})$, especially regarding their maximal subgroups. In this paper we take these investigations in a new direction by considering the word problem for $\\mathsf{IG"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5167","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}