scholarly journals Inverse semigroups generated by nilpotent transformations

Author(s):  
John M. Howie ◽  
M. Paula O. Marques-Smith

SynopsisLet X be a set with infinite cardinality m and let B be the Baer-Levi semigroup, consisting of all one-one mappings a:X→X for which ∣X/Xα∣ = m. Let Km=<B 1B>, the inverse subsemigroup of the symmetric inverse semigroup ℐ(X) generated by all products β−γ, with β,γ∈B. Then Km = <N2>, where N2 is the subset of ℐ(X) consisting of all nilpotent elements of index 2. Moreover, Km has 2-nilpotent-depth 3, in the sense that Let Pm be the ideal {α∈Km: ∣dom α∣<m} in Km and let Lm be the Rees quotient Km/Pm. Then Lm is a 0-bisimple, 2-nilpotent-generated inverse semigroup with 2-nilpotent-depth 3. The minimum non-trivial homomorphic image of Lm also has these properties and is congruence-free.

1981 ◽  
Vol 31 (4) ◽  
pp. 415-420
Author(s):  
F. Pastijn

AbstractWe show that every inverse semigroup is an idempotent separating homomorphic image of a convex inverse subsemigroup of a P-semigroup P(G, L, L), where G acts transitively on L. This division theorem for inverse semigroups can be applied to obtain a division theorem for pseudo-inverse semigroups.


2011 ◽  
Vol 21 (01n02) ◽  
pp. 315-328 ◽  
Author(s):  
L. M. SHNEERSON ◽  
D. EASDOWN

We prove that a finitely presented Rees quotient of a free inverse semigroup has polynomial growth if and only if it has bounded height. This occurs if and only if the set of nonzero reduced words has bounded Shirshov height and all nonzero reduced but not cyclically reduced words are nilpotent. This occurs also if and only if the set of nonzero geodesic words have bounded Shirshov height. We also give a simple sufficient graphical condition for polynomial growth, which is necessary when all zero relators are reduced. As a final application of our results, we give an inverse semigroup analogue of a classical result that characterizes polynomial growth of finitely presented Rees quotients of free semigroups in terms of connections between non-nilpotent elements and primitive words that label loops of the Ufnarovsky graph of the presentation.


1978 ◽  
Vol 19 (1) ◽  
pp. 59-65 ◽  
Author(s):  
H. Mitsch

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.


Author(s):  
D. B. McAlister

SynopsisThe aim of this paper is to describe the free product of a pair G, H of groups in the category of inverse semigroups. Since any inverse semigroup generated by G and H is a homomorphic image of this semigroup, this paper can be regarded as asking how large a subcategory, of the category of inverse semigroups, is the category of groups? In this light, we show that every countable inverse semigroup is a homomorphic image of an inverse subsemigroup of the free product of two copies of the infinite cyclic group. A similar result can be obtained for arbitrary cardinalities. Hence, the category of inverse semigroups is generated, using algebraic constructions by the subcategory of groups.The main part of the paper is concerned with obtaining the structure of the free product G inv H, of two groups G, H in the category of inverse semigroups. It is shown in section 1 that G inv H is E-unitary; thus G inv H can be described in terms of its maximum group homomorphic image G gp H, the free product of G and H in the category of groups, and its semilattice of idempotents. The second section considers some properties of the semilattice of idempotents while the third applies these to obtain a representation of G inv H which is faithful except when one group is a non-trivial finite group and the other is trivial. This representation is used in section 4 to give a structure theorem for G inv H. In this section, too, the result described in the first paragraph is proved. The last section, section 5, consists of examples.


1987 ◽  
Vol 29 (1) ◽  
pp. 21-40 ◽  
Author(s):  
Mario Petrich ◽  
Stuart Rankin

Transitive group representations have their analogue for inverse semigroups as discovered by Schein [7]. The right cosets in the group case find their counterpart in the right ω-cosets and the symmetric inverse semigroup plays the role of the symmetric group. The general theory developed by Schein admits a special case discovered independently by Ponizovskiǐ [4] and Reilly [5]. For a discussion of this topic, see [1, §7.3] and [2, Chapter IV].


2008 ◽  
Vol 85 (1) ◽  
pp. 75-80
Author(s):  
JAMES EAST

AbstractA submonoid S of a monoid M is said to be cofull if it contains the group of units of M. We extract from the work of Easdown, East and FitzGerald (2002) a sufficient condition for a monoid to embed as a cofull submonoid of the coset monoid of its group of units, and show further that this condition is necessary. This yields a simple description of the class of finite monoids which embed in the coset monoids of their group of units. We apply our results to give a simple proof of the result of McAlister [D. B. McAlister, ‘Embedding inverse semigroups in coset semigroups’, Semigroup Forum20 (1980), 255–267] which states that the symmetric inverse semigroup on a finite set X does not embed in the coset monoid of the symmetric group on X. We also explore examples, which are necessarily infinite, of embeddings whose images are not cofull.


Author(s):  
M. Paula O. Marques

SynopsisLet X be a set with infinite cardinality m and let Qm be the semigroupof balanced elements in ℐ(X), as described by Howie. If I is the ideal{αεQm:|Xα|<m} then the Rees factor Pm = Qm/I is O-bisimple and idempotent-generated. Its minimum non-trivial homomorphic image has both these properties and is congruence-free. Moreover, has depth 4, in the sense that [E()]4 = , [E()]3≠


2008 ◽  
Vol 51 (2) ◽  
pp. 387-406 ◽  
Author(s):  
Daniel H. Lenz

AbstractWe show how to construct a topological groupoid directly from an inverse semigroup and prove that it is isomorphic to the universal groupoid introduced by Paterson. We then turn to a certain reduction of this groupoid. In the case of inverse semigroups arising from graphs (respectively, tilings), we prove that this reduction is the graph groupoid introduced by Kumjian \et (respectively, the tiling groupoid of Kellendonk). We also study the open invariant sets in the unit space of this reduction in terms of certain order ideals of the underlying inverse semigroup. This can be used to investigate the ideal structure of the associated reduced $C^\ast$-algebra.


Author(s):  
C. J. Ash ◽  
T. E. Hall

AbstractWe show that every such semigroup is a homomorphic image of a subsemigroup of some finite inverse semigroup. This shows that the pseudovariety generated by the finite inverse semigroups consists of exactly the finite semigroups with commuting idempotents.


2008 ◽  
Vol 45 (3) ◽  
pp. 395-409 ◽  
Author(s):  
Francis Pastijn ◽  
Luís Oliveira

The translational hull of a locally inverse semigroup has a largest locally inverse subsemigroup containing the inner part. A construction is given for ideal extensions within the class of all locally inverse semigroups.


Sign in / Sign up

Export Citation Format

Share Document