نتایج جستجو برای: right and completely regular ordered semigroups
تعداد نتایج: 16885171 فیلتر نتایج به سال:
An ordered semigroup is a structure S = 〈S, ·,≤〉 with a binary operation · that is associative and a partial ordering ≤ that is compatible with the binary operation. For a given congruence relation θ of the semigroup S = 〈S, ·〉 the quotient structure S/θ = 〈S/θ, , 〉 is not in general an ordered semigroup. In this paper we study quotients of ordered semigroups. We first define a special type of ...
The notions of int-soft semigroups and int-soft left (resp., right) ideals are introduced, and several properties are investigated. Using these notions and the notion of inclusive set, characterizations of subsemigroups and left (resp., right) ideals are considered. Using the notion of int-soft products, characterizations of int-soft semigroups and int-soft left (resp., right) ideals are discus...
In this paper we have defined anti fuzzy interior ideal in semigroups. We characterize regular, intra-regular and left (right) quasi-regular semigroups by the properties of their anti fuzzy ideals, anti fuzzy bi-ideals, anti fuzzy generalized bi-ideals, anti fuzzy interior ideals and anti fuzzy quasi-ideals.
In [1,2,3], A. C. Baker and J.W. Baker studied the subspace Ma(S) of the convolution measure algebra M, (S) of a locally compact semigroup. H. Dzinotyiweyi in [5,7] considers an analogous measure space on a large class of C-distinguished topological semigroups containing all completely regular topological semigroups. In this paper, we extend the definitions to study the weighted semigroup ...
The aim of this manuscript is to introduce the \((\alpha,\beta)\)-hesitant fuzzy set and apply it semigroups. In paper, as a generalization concept hesitant sets semigroup theory, subsemigroups semigroups introduced, related properties are discussed. Furthermore, we define study ideals on particular, investigate structure ideal generated by in semigroup. addition, also concepts semiprime semigr...
We consider an application to the discrete log problem using completely regular semigroups which may provide a more secure symmetric cryptosystem than the classic system based on groups. In particular we describe a scheme that would appear to offer protection to a standard trial multiplication attack.
Exactly as in semigroups, Green’s relations play an important role in the theory of ordered semigroups—especially for decompositions of such semigroups. In this paper we deal with the -trivial ordered semigroups which are defined via the Green’s relation , and with the nil and Δ-ordered semigroups. We prove that every nil ordered semigroup is -trivial which means that there is no ordered semigr...
Inverse semigroups form a variety of unary semigroups, that is, semigroups equipped with an additional unary operation, in this case a 7→ a−1. The theory of inverse semigroups is perhaps the best developed within semigroup theory, and relies on two factors: an inverse semigroup S is regular, and has semilattice of idempotents. Three major approaches to the structure of inverse semigroups have e...
This paper characterizes directed graphs which are Cayley graphs of strong semilattices of groups and, in particular, strong chains of groups, i.e. of completely regular semigroups which are also called Clifford semigroups. © 2006 Elsevier B.V. All rights reserved.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید