scholarly journals Dual symmetric inverse monoids and representation theory

1998 ◽  
Vol 64 (3) ◽  
pp. 345-367 ◽  
Author(s):  
D. G. Fitzgerald ◽  
Jonathan Leech
Keyword(s):  
Representation Theory ◽  
Inverse Semigroup ◽  
The Other ◽  
Natural Order ◽  
Inverse Monoid ◽  
Inverse Monoids ◽  
Dual Pairs ◽  
Representations Of Groups ◽  
Dual Symmetric Inverse Monoids ◽  
Symmetric Inverse Monoid

AbstractThere is a substantial theory (modelled on permutation representations of groups) of representations of an inverse semigroup S in a symmetric inverse monoid Ix, that is, a monoid of partial one-to-one selfmaps of a set X. The present paper describes the structure of a categorical dual Ix* to the symmetric inverse monoid and discusses representations of an inverse semigroup in this dual symmetric inverse monoid. It is shown how a representation of S by (full) selfmaps of a set X leads to dual pairs of representations in Ix and Ix*, and how a number of known representations arise as one or the other of these pairs. Conditions on S are described which ensure that representations of S preserve such infima or suprema as exist in the natural order of S. The categorical treatment allows the construction, from standard functors, of representations of S in certain other inverse algebras (that is, inverse monoids in which all finite infima exist). The paper concludes by distinguishing two subclasses of inverse algebras on the basis of their embedding properties.

Inverse semigroup homomorphisms via partial group actions

2001 ◽  
Vol 64 (1) ◽  
pp. 157-168 ◽  
Author(s):  
Benjamin Steinberg
Keyword(s):  
Inverse Semigroup ◽  
Group Actions ◽  
Inverse Semigroups ◽  
Inverse Monoid ◽  
Partial Group ◽  
Inverse Monoids ◽  
Maximal Group ◽  
Special Cases ◽  
Quick Proof ◽  
Group Component

This papar constructs all homomorphisms of inverse semigroups which factor through an E-unitary inverse semigroup; the construction is in terms of a semilattice component and a group component. It is shown that such homomorphisms have a unique factorisation βα with α preserving the maximal group image, β idempotent separating, and the domain I of β E-unitary; moreover, the P-representation of I is explicitly constructed. This theory, in particular, applies whenever the domain or codomain of a homomorphism is E-unitary. Stronger results are obtained for the case of F-inverse monoids.Special cases of our results include the P-theorem and the factorisation theorem for homomorphisms from E-unitary inverse semigroups (via idempotent pure followed by idempotent separating). We also deduce a criterion of McAlister–Reilly for the existence of E-unitary covers over a group, as well as a generalisation to F-inverse covers, allowing a quick proof that every inverse monoid has an F-inverse cover.

scholarly journals PARTIAL ORDERS ON PARTIAL BAER–LEVI SEMIGROUPS

2010 ◽  
Vol 81 (2) ◽  
pp. 195-207 ◽  
Author(s):  
BOORAPA SINGHA ◽  
JINTANA SANWONG ◽  
R. P. SULLIVAN
Keyword(s):  
Inverse Semigroup ◽  
Partial Order ◽  
Partial Orders ◽  
The Other ◽  
Natural Order ◽  
Natural Partial Order ◽  
Transformation Semigroups ◽  
Minimal Elements ◽  
Symmetric Inverse Semigroup ◽  
Containment Order

AbstractMarques-Smith and Sullivan [‘Partial orders on transformation semigroups’, Monatsh. Math.140 (2003), 103–118] studied various properties of two partial orders on P(X), the semigroup (under composition) consisting of all partial transformations of an arbitrary set X. One partial order was the ‘containment order’: namely, if α,β∈P(X) then α⊆β means xα=xβ for all x∈dom α, the domain of α. The other order was the so-called ‘natural order’ defined by Mitsch [‘A natural partial order for semigroups’, Proc. Amer. Math. Soc.97(3) (1986), 384–388] for any semigroup. In this paper, we consider these and other orders defined on the symmetric inverse semigroup I(X) and the partial Baer–Levi semigroup PS(q). We show that there are surprising differences between the orders on these semigroups, concerned with their compatibility with respect to composition and the existence of maximal and minimal elements.

scholarly journals Unit regular inverse monoids and Cliford monoids

2018 ◽  
Vol 7 (2.13) ◽  
pp. 306
Author(s):  
Sreeja V K
Keyword(s):  
Inverse Semigroup ◽  
Regular Semigroup ◽  
Group Element ◽  
Inverse Monoid ◽  
Completely Regular Semigroup ◽  
Clifford Semigroup ◽  
Inverse Monoids ◽  
Completely Regular ◽  
Group Of Units

Let S be a unit regular semigroup with group of units G = G(S) and semilattice of idempotents E = E(S). Then for every there is a such that Then both xu and ux are idempotents and we can write or .Thus every element of a unit regular inverse monoid is a product of a group element and an idempotent. It is evident that every L-class and every R-class contains exactly one idempotent where L and R are two of Greens relations. Since inverse monoids are R unipotent, every element of a unit regular inverse monoid can be written as s = eu where the idempotent part e is unique and u is a unit. A completely regular semigroup is a semigroup in which every element is in some subgroup of the semigroup. A Clifford semigroup is a completely regular inverse semigroup. Characterization of unit regular inverse monoids in terms of the group of units and the semilattice of idempotents is a problem often attempted and in this direction we have studied the structure of unit regular inverse monoids and Clifford monoids. 

scholarly journals ON FREE SPECTRA OF A CLASS OF FINITE INVERSE MONOIDS

2012 ◽  
Vol 93 (3) ◽  
pp. 225-237
Author(s):  
IGOR DOLINKA
Keyword(s):  
Semidirect Product ◽  
Natural Order ◽  
Inverse Monoid ◽  
Left Action ◽  
Inverse Monoids ◽  
Group Of Units ◽  
Finite Monoids ◽  
Free Spectrum ◽  
Free Spectra

AbstractFor a finite Clifford inverse algebra $A$, with natural order meet-semilattice ${Y}_{A} $ and group of units ${G}_{A} $, we show that the inverse monoid obtained as the semidirect product ${ Y}_{A}^{1} {\mathop{\ast }\nolimits}_{\rho } {G}_{A} $ has a log-polynomial free spectrum whenever $\rho $ is a term-expressible left action of ${G}_{A} $ on ${Y}_{A} $ and all subgroups of $A$ are nilpotent. This yields a number of examples of finite inverse monoids satisfying the Seif conjecture on finite monoids whose free spectra are not doubly exponential.

A CHARACTERIZATION OF THE INVERSE MONOID OF BI-CONGRUENCES OF CERTAIN ALGEBRAS

2009 ◽  
Vol 19 (06) ◽  
pp. 791-808 ◽  
Author(s):  
KALLE KAARLI ◽  
LÁSZLÓ MÁRKI
Keyword(s):  
Inverse Semigroup ◽  
Semigroup Theory ◽  
Independent Interest ◽  
Inverse Monoid ◽  
Inverse Monoids ◽  
Abstract Characterization ◽  
Finite Monoids ◽  
Ramsey’S Theorem ◽  
Matrix Construction

This paper provides an abstract characterization of the inverse monoids that appear as monoids of bi-congruences of finite minimal algebras generating arithmetical varieties. As a tool, a matrix construction is introduced which might be of independent interest in inverse semigroup theory. Using this construction as well as Ramsey's theorem, we embed a certain kind of inverse monoid into a factorizable monoid of the same kind. As noticed by M. Lawson, this embedding entails that the embedded finite monoids have finite F-unitary cover.

scholarly journals LARGEST 2-GENERATED SUBSEMIGROUPS OF THE SYMMETRIC INVERSE SEMIGROUP

2007 ◽  
Vol 50 (3) ◽  
pp. 551-561 ◽  
Author(s):  
J. M. André ◽  
V. H. Fernandes ◽  
J. D. Mitchell
Keyword(s):  
Inverse Semigroup ◽  
Inverse Monoid ◽  
Symmetric Inverse Semigroup ◽  
Symmetric Inverse Monoid ◽  
Element Set

AbstractThe symmetric inverse monoid $\mathcal{I}_{n}$ is the set of all partial permutations of an $n$-element set. The largest possible size of a $2$-generated subsemigroup of $\mathcal{I}_{n}$ is determined. Examples of semigroups with these sizes are given. Consequently, if $M(n)$ denotes this maximum, it is shown that $M(n)/|\mathcal{I}_{n}|\rightarrow1$ as $n\rightarrow\infty$. Furthermore, we deduce the known fact that $\mathcal{I}_{n}$ embeds as a local submonoid of an inverse $2$-generated subsemigroup of $\mathcal{I}_{n+1}$.

ON A NEW APPROACH TO THE DUAL SYMMETRIC INVERSE MONOID $\mathcal{I}_{X}^{\ast}$

2007 ◽  
Vol 17 (03) ◽  
pp. 567-591 ◽  
Author(s):  
VICTOR MALTCEV
Keyword(s):  
Inverse Semigroup ◽  
Cross Section ◽  
Inverse Monoid ◽  
Finite Sets ◽  
New Approach ◽  
Generating Set ◽  
Maximal Subsemigroups ◽  
Symmetric Inverse Semigroup ◽  
Transitive Representation ◽  
Symmetric Inverse Monoid

We construct the inverse partition semigroup[Formula: see text], isomorphic to the dual symmetric inverse monoid[Formula: see text], introduced in [6]. We give a convenient geometric illustration for elements of [Formula: see text]. We describe all maximal subsemigroups of [Formula: see text] and find a generating set for [Formula: see text] when X is finite. We prove that all the automorphisms of [Formula: see text] are inner. We show how to embed the symmetric inverse semigroup into the inverse partition one. For finite sets X, we establish that, up to equivalence, there is a unique faithful effective transitive representation of [Formula: see text], namely to [Formula: see text]. Finally, we construct an interesting [Formula: see text]-cross-section of [Formula: see text], which is reminiscent of [Formula: see text], the [Formula: see text]-cross-section of [Formula: see text], constructed in [4].

scholarly journals Inverse semigroups determined by their partial automorphism monoids

2006 ◽  
Vol 81 (2) ◽  
pp. 185-198 ◽  
Author(s):  
Simon M. Goberstein
Keyword(s):  
Inverse Semigroup ◽  
Partial Order ◽  
Inverse Semigroups ◽  
Natural Partial Order ◽  
Inverse Monoid ◽  
Inverse Monoids ◽  
Inverse Subsemigroups

AbstractThe partial automorphism monoid of an inverse semigroup is an inverse monoid consisting of all isomorphisms between its inverse subsemigroups. We prove that a tightly connected fundamental inverse semigroup S with no isolated nontrivial subgroups is lattice determined ‘modulo semilattices’ and if T is an inverse semigroup whose partial automorphism monoid is isomorphic to that of S, then either S and T are isomorphic or they are dually isomorphic chains relative to the natural partial order; a similar result holds if T is any semigroup and the inverse monoids consisting of all isomorphisms between subsemigroups of S and T, respectively, are isomorphic. Moreover, for these results to hold, the conditions that S be tightly connected and have no isolated nontrivial subgroups are essential.

scholarly journals A presentation for the monoid of uniform block permutations

2003 ◽  
Vol 68 (2) ◽  
pp. 317-324 ◽  
Author(s):  
D. G. FitzGerald
Keyword(s):  
Symmetric Group ◽  
General Criterion ◽  
Inverse Monoid ◽  
Inverse Monoids ◽  
Natural Action ◽  
Monoid Presentation ◽  
Symmetric Inverse Monoid

The monoid n of uniform block permutations is the factorisable inverse monoid which arises from the natural action of the symmetric group on the join semilattice of equivalences on an n-set; it has been described in the literature as the factorisable part of the dual symmetric inverse monoid. The present paper gives and proves correct a monoid presentation forn. The methods involved make use of a general criterion for a monoid generated by a group and an idempotent to be inverse, the structure of factorisable inverse monoids, and presentations of the symmetric group and the join semilattice of equivalences on an n-set.

scholarly journals Inverse semigroups and their natural order

1978 ◽  
Vol 19 (1) ◽  
pp. 59-65 ◽  
Author(s):  
H. Mitsch
Keyword(s):  
Inverse Semigroup ◽  
Partial Order ◽  
Homomorphic Image ◽  
Point Of View ◽  
Inverse Semigroups ◽  
Natural Order ◽  
Theoretical Point ◽  
Trivial Group

The natural order of an inverse semigroup defined by a ≤ b ⇔ a′b = a′a has turned out to be of great importance in describing the structure of it. In this paper an order-theoretical point of view is adopted to characterise inverse semigroups. A complete description is given according to the type of partial order an arbitrary inverse semigroup S can possibly admit: a least element of (S, ≤) is shown to be the zero of (S, ·); the existence of a greatest element is equivalent to the fact, that (S, ·) is a semilattice; (S, ≤) is directed downwards, if and only if S admits only the trivial group-homomorphic image; (S, ≤) is totally ordered, if and only if for all a, b ∈ S, either ab = ba = a or ab = ba = b; a finite inverse semigroup is a lattice, if and only if it admits a greatest element. Finally formulas concerning the inverse of a supremum or an infimum, if it exists, are derived, and right-distributivity and left-distributivity of multiplication with respect to union and intersection are shown to be equivalent.

Sign in / Sign up

Export Citation Format

Share Document