PARTIAL ACTIONS OF GROUPS

2004 ◽  
Vol 14 (01) ◽  
pp. 87-114 ◽  
Author(s):  
J. KELLENDONK ◽  
MARK V. LAWSON
Keyword(s):  
Group Theory ◽  
Inverse Semigroup ◽  
Group Action ◽  
Partial Function ◽  
Inverse Semigroups ◽  
Explicit Description ◽  
Partial Action ◽  
Partial Group

A partial action of a group G on a set X is a weakening of the usual notion of a group action: the function G×X→X that defines a group action is replaced by a partial function; in addition, the existence of g·(h·x) implies the existence of (gh)·x, but not necessarily conversely. Such partial actions are extremely widespread in mathematics, and the main aim of this paper is to prove two basic results concerning them. First, we obtain an explicit description of Exel's universal inverse semigroup [Formula: see text], which has the property that partial actions of the group G give rise to actions of the inverse semigroup [Formula: see text]. We apply this result to the theory of graph immersions. Second, we prove that each partial group action is the restriction of a universal global group action. We describe some applications of this result to group theory and the theory of E-unitary inverse semigroups.

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.

A new definition of conjugacy for semigroups

2018 ◽  
Vol 17 (02) ◽  
pp. 1850032 ◽  
Author(s):  
Janusz Konieczny
Keyword(s):  
Group Theory ◽  
Inverse Semigroup ◽  
Directed Graphs ◽  
Conjugacy Classes ◽  
Inverse Semigroups ◽  
Transformation Semigroups ◽  
Arbitrary Semigroup ◽  
Basic Transformation ◽  
Definition Of ◽  
Natural Way

The conjugacy relation plays an important role in group theory. If [Formula: see text] and [Formula: see text] are elements of a group [Formula: see text], [Formula: see text] is conjugate to [Formula: see text] if [Formula: see text] for some [Formula: see text]. The group conjugacy extends to inverse semigroups in a natural way: for [Formula: see text] and [Formula: see text] in an inverse semigroup [Formula: see text], [Formula: see text] is conjugate to [Formula: see text] if [Formula: see text] and [Formula: see text] for some [Formula: see text]. In this paper, we define a conjugacy for an arbitrary semigroup [Formula: see text] that reduces to the inverse semigroup conjugacy if [Formula: see text] is an inverse semigroup. (None of the existing notions of conjugacy for semigroups has this property.) We compare our new notion of conjugacy with existing definitions, characterize the conjugacy in basic transformation semigroups and their ideals using the representation of transformations as directed graphs, and determine the number of conjugacy classes in these semigroups.

scholarly journals A NOTE ON THE HOWSON PROPERTY IN INVERSE SEMIGROUPS

2016 ◽  
Vol 94 (3) ◽  
pp. 457-463 ◽  
Author(s):  
PETER R. JONES
Keyword(s):  
Inverse Semigroup ◽  
Inverse Semigroups ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Finitely Generated ◽  
Necessary And Sufficient

An algebra has the Howson property if the intersection of any two finitely generated subalgebras is again finitely generated. A simple necessary and sufficient condition is given for the Howson property to hold on an inverse semigroup with finitely many idempotents. In addition, it is shown that any monogenic inverse semigroup has the Howson property.

scholarly journals Biorder-preserving coextensions of fundamental semigroups

1988 ◽  
Vol 31 (3) ◽  
pp. 463-467 ◽  
Author(s):  
David Easdown
Keyword(s):  
Group Theory ◽  
Semigroup Theory ◽  
Building Blocks ◽  
Inverse Semigroups ◽  
Extension Theory ◽  
Precise Definition ◽  
Simple Groups ◽  
Seminal Work ◽  
Fundamental Semigroups

In any extension theory for semigroups one must determine the basic building blocks and then discover how they fit together to create more complicated semigroups. For example, in group theory the basic building blocks are simple groups. In semigroup theory however there are several natural choices. One that has received considerable attention, particularly since the seminal work on inverse semigroups by Munn ([14, 15]), is the notion of a fundamental semigroup. A semigroup is called fundamental if it cannot be [shrunk] homomorphically without collapsing some of its idempotents (see below for a precise definition).

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.

scholarly journals FACTORIZATION THEOREMS FOR MORPHISMS OF ORDERED GROUPOIDS AND INVERSE SEMIGROUPS

2001 ◽  
Vol 44 (3) ◽  
pp. 549-569 ◽  
Author(s):  
Benjamin Steinberg
Keyword(s):  
Inverse Semigroup ◽  
Regular Semigroup ◽  
Classical Theory ◽  
Derived Category ◽  
Inverse Semigroups ◽  
Subject Classification

AbstractAdapting the theory of the derived category to ordered groupoids, we prove that every ordered functor (and thus every inverse and regular semigroup homomorphism) factors as an enlargement followed by an ordered fibration. As an application, we obtain Lawson’s version of Ehresmann’s Maximum Enlargement Theorem, from which can be deduced the classical theory of idempotent-pure inverse semigroup homomorphisms and $E$-unitary inverse semigroups.AMS 2000 Mathematics subject classification: Primary 20M18; 20L05; 20M17

scholarly journals FREE ADEQUATE SEMIGROUPS

2011 ◽  
Vol 91 (3) ◽  
pp. 365-390 ◽  
Author(s):  
MARK KAMBITES
Keyword(s):  
Inverse Semigroup ◽  
Word Problem ◽  
Explicit Description ◽  
Finitely Generated ◽  
Free Objects ◽  
Ample Semigroup ◽  
Free Inverse Semigroup ◽  
Adequate Semigroup

AbstractWe give an explicit description of the free objects in the quasivariety of adequate semigroups, as sets of labelled directed trees under a natural combinatorial multiplication. The morphisms of the free adequate semigroup onto the free ample semigroup and into the free inverse semigroup are realised by a combinatorial ‘folding’ operation which transforms our trees into Munn trees. We use these results to show that free adequate semigroups and monoids are 𝒥-trivial and never finitely generated as semigroups, and that those which are finitely generated as (2,1,1)-algebras have decidable word problem.

scholarly journals Embedding inverse semigroups of homeomorphisms on closed subsets

1977 ◽  
Vol 18 (2) ◽  
pp. 199-207 ◽  
Author(s):  
Bridget Bos Baird
Keyword(s):  
Topological Space ◽  
Inverse Semigroup ◽  
Inverse Semigroups ◽  
Topological Spaces ◽  
Locally Compact ◽  
Compact Metric Space ◽  
Countable Space ◽  
The One ◽  
One Point Compactification ◽  
First Countable Space

All topological spaces here are assumed to be T2. The collection F(Y)of all homeomorphisms whose domains and ranges are closed subsets of a topological space Y is an inverse semigroup under the operation of composition. We are interested in the general problem of getting some information about the subsemigroups of F(Y) whenever Y is a compact metric space. Here, we specifically look at the problem of determining those spaces X with the property that F(X) is isomorphic to a subsemigroup of F(Y). The main result states that if X is any first countable space with an uncountable number of points, then the semigroup F(X) can be embedded into the semigroup F(Y) if and only if either X is compact and Y contains a copy of X, or X is noncompact and locally compact and Y contains a copy of the one-point compactification of X.

Inverse semigroups generated by a pair of subgroups

1977 ◽  
Vol 77 (1-2) ◽  
pp. 9-22 ◽  
Author(s):  
D. B. McAlister
Keyword(s):  
Inverse Semigroup ◽  
Free Product ◽  
Homomorphic Image ◽  
Main Part ◽  
Structure Theorem ◽  
Inverse Semigroups ◽  
Infinite Cyclic Group ◽  
The Third ◽  
Group A ◽  
Maximum Group

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.

Sign in / Sign up

Export Citation Format

Share Document