scholarly journals On the relative solvability of certain inverse monoids

2010 ◽  
Vol 81 (3) ◽  
pp. 531-547
Author(s):  
Edite Cordeiro ◽  
Manuel Delgado
Keyword(s):  
Inverse Monoids

INVERSE MONOIDS OF DOT-DEPTH TWO

1993 ◽  
Vol 03 (04) ◽  
pp. 411-424 ◽  
Author(s):  
DAVID COWAN
Keyword(s):  
Brandt Semigroup ◽  
Inverse Monoids ◽  
Malcev Product

It is shown that the pseudovariety of inverse monoids of dot-depth two is decidable and is equal to the Malcev product of the pseudovariety generated by the 5 element Brandt semigroup and the variety of semilattices.

Inverse monoids of graphs

2000 ◽  
Vol 16 (1) ◽  
pp. 93-99 ◽  
Author(s):  
Li Weimin
Keyword(s):  
Inverse Monoids

scholarly journals Equations Over Free Inverse Monoids with Idempotent Variables

2016 ◽  
Vol 61 (2) ◽  
pp. 494-520
Author(s):  
Volker Diekert ◽  
Florent Martin ◽  
Géraud Sénizergues ◽  
Pedro V. Silva
Keyword(s):  
Inverse Monoids

Generation of infinite factorizable inverse monoids

2011 ◽  
Vol 84 (2) ◽  
pp. 267-283 ◽  
Author(s):  
James East
Keyword(s):  
Inverse Monoids

scholarly journals The algebra of rewriting for presentations of inverse monoids

2020 ◽  
Vol 48 (7) ◽  
pp. 2920-2940
Author(s):  
N. D. Gilbert ◽  
E. A. McDougall
Keyword(s):  
Inverse Monoids

scholarly journals On the foundations of inverse monoids and inverse algebras

1998 ◽  
Vol 41 (1) ◽  
pp. 1-21 ◽  
Author(s):  
Jonathan Leech
Keyword(s):  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Inverse Monoids ◽  
Necessary And Sufficient

Symmetric inverse monoids of objects in arbitrary categories are studied. Necessary and sufficient conditions are given for such monoids to be E-unitary or else form (complete) inverse algebras. Particular attention is given to symmetric inverse monoids of objects in free categories.

FREE INVERSE MONOIDS AND GRAPH IMMERSIONS

1993 ◽  
Vol 03 (01) ◽  
pp. 79-99 ◽  
Author(s):  
STUART W. MARGOLIS ◽  
JOHN C. MEAKIN
Keyword(s):  
Formal Language ◽  
Inverse Monoid ◽  
Finitely Generated ◽  
Inverse Monoids ◽  
Rational Subset ◽  
The Relationship ◽  
Subgroup Theorem ◽  
Free Inverse Monoid ◽  
Natural Way

The relationship between covering spaces of graphs and subgroups of the free group leads to a rapid proof of the Nielsen-Schreier subgroup theorem. We show here that a similar relationship holds between immersions of graphs and closed inverse submonoids of free inverse monoids. We prove using these methods, that a closed inverse submonoid of a free inverse monoid is finitely generated if and only if it has finite index if and only if it is a rational subset of the free inverse monoid in the sense of formal language theory. We solve the word problem for the free inverse category over a graph Γ. We show that immersions over Γ may be classified via conjugacy classes of loop monoids of the free inverse category over Γ. In the case that Γ is a bouquet of X circles, we prove that the category of (connected) immersions over Γ is equivalent to the category of (transitive) representations of the free inverse monoid FIM(X). Such representations are coded by closed inverse submonoids of FIM(X). These monoids will be constructed in a natural way from groups acting freely on trees and they admit an idempotent pure retract onto a free inverse monoid. Applications to the classification of finitely generated subgroups of free groups via finite inverse monoids are developed.

BIRGET–RHODES EXPANSION OF GROUPS AND INVERSE MONOIDS OF MÖBIUS TYPE

2002 ◽  
Vol 12 (04) ◽  
pp. 525-533 ◽  
Author(s):  
KEUNBAE CHOI ◽  
YONGDO LIM
Keyword(s):  
Hausdorff Space ◽  
Inverse Monoid ◽  
Expansion Formula ◽  
Inverse Monoids ◽  
Isolated Point

In this paper we prove that if a group G acts faithfully on a Hausdorff space X and acts freely at a non-isolated point, then the Birget–Rhodes expansion [Formula: see text] of the group G is isomorphic to an inverse monoid of Möbius type obtained from the action.

Sign in / Sign up

Export Citation Format

Share Document