Paper Info
Title
Finite Idempotent Inverse Monoid Presentations
Abstract
Several decidability problems for finite idempotent presentations of inverse monoids are solved, giving also insight into their structure. Besides providing a new elementary solution for the problem, solutions are obtained for the following problems: computing the maximal subgroups, being combinatorial, being semisimple, being fundamental, having infinite D-classes. The word problem for the least fundamental quotient is also solved, with an unexpected consequence.
Year
DOI
Venue
2011
10.1142/S0218196711006868
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION
Keywords
Field
DocType
Inverse monoids, presentations, decidability problems, idempotent-pure congruences
Inverse,Discrete mathematics,Algebra,Word problem (mathematics education),Quotient,Decidability,Monoid,Idempotence,Mathematics
Journal
Volume
Issue
ISSN
21
7
0218-1967
Citations 
PageRank 
References 
0
0.34
6
Authors
1
Name
Order
Citations
PageRank
Pedro V. Silva114129.42