scholarly journals E-unitary congruences on inverse semigroups

1976 ◽  
Vol 17 (1) ◽  
pp. 57-75 ◽  
Author(s):  
N. R. Reilly ◽  
W. D. Munn
Keyword(s):  
Inverse Semigroup ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Structure Theorem ◽  
Inverse Semigroups ◽  
Partially Ordered ◽  
Important Structure

By an E-unitary inverse semigroup we mean an inverse semigroup in which the semilattice is a unitary subset. Such semigroups, elsewhere called ‘proper’ or ‘reduced’ inverse semigroups, have been the object of much recent study. Free inverse semigroups form a subclass of particular interest.An important structure theorem for E-unitary inverse semigroups has been obtained by McAlister [4, 5]. From a triple (G, ) consisting of a group G, a partially ordered set and a subset , satisfying certain conditions, he constructs an E-unitary inverse semigroup P(G, ). A semigroup of this type is called a P-semigroup. The structure theorem states that every E-unitary inverse semigroup is, to within isomorphism, of this form. A second theorem asserts that every inverse semigroup is isomorphic to a quotient of a Psemigroup by an idempotent-separating congruence. We refer below to these results as McAlister's Theorems A and B respectively. A triple (C, ) of the type used to construct a P-semigroup is here termed a “McAlister triple”. It is shown further, in [5], that there is essentially only one such triple corresponding to a given E-unitary inverse semigroup.

scholarly journals E-unitary inverse semigroups over semilattices

1978 ◽  
Vol 19 (1) ◽  
pp. 1-12 ◽  
Author(s):  
D. B. McAlister
Keyword(s):  
Inverse Semigroup ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Inverse Semigroups ◽  
Partially Ordered ◽  
Image Position

An inverse semigroup is called E-unitary if the equations ea = e = e2 together imply a2 = a. In a previous paper [4], the author showed that any E-unitary inverse semigroup is isomorphic to a semigroup constructed from a triple (G, ℋ, ) consisting of a down-directed partially ordered set ℋ, an ideal and subsemilattice of ℋ and a group G acting on ℋ, on the left, by order automorphisms in such a way that ℋ = G. This semigroup is denoted by P(G, ℋ, ); it consists of all pairs (a, g)∈ × G such that g−1a ∈ , under the multiplication

scholarly journals The 𝒥-classes of an inverse semigroup

1979 ◽  
Vol 28 (4) ◽  
pp. 427-432 ◽  
Author(s):  
C. J. Ash
Keyword(s):  
Lower Bound ◽  
Inverse Semigroup ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Subject Classification ◽  
Partially Ordered ◽  
M 10 ◽  
20 M 10

AbstractIt is shown, using the author's construction for ‘labelled semilattices’, that every partially ordered set, in which every two elements have a common lower bound, is isomorphic to the partiallyordered set of 𝒥-classes of some completely semi-simple inverse semigroup.1980 Mathematics subject classification (Amer. Math. Soc): primary 20 M 10, secondary 04 A 05, 08 A 05.

Information Retrieval Systems, an Algebraic Approach I1

1981 ◽  
Vol 4 (3) ◽  
pp. 551-603
Author(s):  
Zbigniew Raś
Keyword(s):  
Information Retrieval ◽  
Boolean Algebra ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Algebraic Approach ◽  
Partially Ordered ◽  
Retrieval Systems ◽  
Information Retrieval Systems ◽  
Present Part ◽  
L Systems

This paper is the first of the three parts of work on the information retrieval systems proposed by Salton (see [24]). The system is defined by the notions of a partially ordered set of requests (A, ⩽), the set of objects X and a monotonic retrieval function U : A → 2X. Different conditions imposed on the set A and a function U make it possible to obtain various classes of information retrieval systems. We will investigate systems in which (A, ⩽) is a partially ordered set, a lattice, a pseudo-Boolean algebra and Boolean algebra. In my paper these systems are called partially ordered information retrieval systems (po-systems) lattice information retrieval systems (l-systems); pseudo-Boolean information retrieval systems (pB-systems) and Boolean information retrieval systems (B-systems). The first part concerns po-systems and 1-systems. The second part deals with pB-systems and B-systems. In the third part, systems with a partial access are investigated. The present part discusses the method for construction of a set of attributes. Problems connected with the selectivity and minimalization of a set of attributes are investigated. The characterization and the properties of a set of attributes are given.

scholarly journals Each join-completion of a partially ordered set in the solution of a universal problem

1974 ◽  
Vol 17 (4) ◽  
pp. 406-413 ◽  
Author(s):  
Jürgen Schmidt
Keyword(s):  
Partially Ordered Set ◽  
Ordered Set ◽  
Unique Extension ◽  
Partially Ordered ◽  
Special Cases

The main result of this paper is the theorem in the title. Only special cases of it seem to be known so far. As an application, we obtain a result on the unique extension of Galois connexions. As a matter of fact, it is only by the use of Galois connexions that we obtain the main result, in its present generality.

scholarly journals Primitive idempotent measures on compact semitopological semigroups

1972 ◽  
Vol 13 (4) ◽  
pp. 451-455 ◽  
Author(s):  
Stephen T. L. Choy
Keyword(s):  
Partial Order ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Zero Element ◽  
Primitive Idempotent ◽  
Natural Partial Order ◽  
Partially Ordered

For a semigroup S let I(S) be the set of idempotents in S. A natural partial order of I(S) is defined by e ≦ f if ef = fe = e. An element e in I(S) is called a primitive idempotent if e is a minimal non-zero element of the partially ordered set (I(S), ≦). It is easy to see that an idempotent e in S is primitive if and only if, for any idempotent f in S, f = ef = fe implies f = e or f is the zero element of S. One may also easily verify that an idempotent e is primitive if and only if the only idempotents in eSe are e and the zero element. We let П(S) denote the set of primitive idempotent in S.

ON RIBBON PRESENTATIONS OF RIBBON KNOTS

1994 ◽  
Vol 03 (02) ◽  
pp. 223-231
Author(s):  
TOMOYUKI YASUDA
Keyword(s):  
Partially Ordered Set ◽  
Ordered Set ◽  
Partially Ordered ◽  
Totally Ordered Set

A ribbon n-knot Kn is constructed by attaching m bands to m + 1n-spheres in the Euclidean (n + 2)-space. There are many way of attaching them; as a result, Kn has many presentations which are called ribbon presentations. In this note, we will induce a notion to classify ribbon presentations for ribbon n-knots of m-fusions (m ≥ 1, n ≥ 2), and show that such classes form a totally ordered set in the case of m = 2 and a partially ordered set in the case of m ≥ 1.

scholarly journals Spherical posets from commuting elements

2018 ◽  
Vol 21 (4) ◽  
pp. 593-628 ◽  
Author(s):  
Cihan Okay
Keyword(s):  
Homotopy Type ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Universal Cover ◽  
Homotopy Equivalent ◽  
Classifying Space ◽  
Partially Ordered ◽  
Abelian Subgroups

AbstractIn this paper, we study the homotopy type of the partially ordered set of left cosets of abelian subgroups in an extraspecial p-group. We prove that the universal cover of its nerve is homotopy equivalent to a wedge of r-spheres where {2r\geq 4} is the rank of its Frattini quotient. This determines the homotopy type of the universal cover of the classifying space of transitionally commutative bundles as introduced in [2].

EMBEDDINGS OF P(ω)/Fin INTO BOREL EQUIVALENCE RELATIONS BETWEEN ℓp AND ℓq

2015 ◽  
Vol 80 (3) ◽  
pp. 917-939 ◽  
Author(s):  
ZHI YIN
Keyword(s):  
Partially Ordered Set ◽  
Ordered Set ◽  
Equivalence Relations ◽  
Borel Equivalence Relations ◽  
Partially Ordered

AbstractWe prove that, for 1 ≤ p < q < ∞, the partially ordered set P(ω)/Fin can be embedded into Borel equivalence relations between ℝω/ℓp and ℝω/ℓq. Since there is an antichain of size continuum in P(ω)/Fin, there are continuum many pairwise incomparable Borel equivalence relations between ℝω/ℓp and ℝω/ℓq.

Sign in / Sign up

Export Citation Format

Share Document