Results 11 to 20 of about 543 (107)

HOMOGENEOUS COMPLETELY SIMPLE SEMIGROUPS

open access: yesMathematika, Volume 66, Issue 3, Page 733-751, July 2020., 2020
Abstract A semigroup is completely simple if it has no proper ideals and contains a primitive idempotent. We say that a completely simple semigroup S is a homogeneous completely simple semigroup if any isomorphism between finitely generated completely simple sub‐semigroups of S extends to an automorphism of S.
Thomas Quinn‐Gregson
wiley   +1 more source

Beyond orthodox semigroups

open access: yesJournal of Algebra, 2012
Let \(S\) be a semigroup and \(\emptyset\neq B\subseteq E(S)\). Let \(\widetilde{\mathcal L}_B\) be an equivalence relation, so that for \(a,b\in S\), \(a\widetilde{\mathcal L}_Bb\) if and only if \(\{e\in B:ae=a\}=\{e\in B:be=b\}\). A semigroup \(S\) is said to be \textit{weakly B-abundant} if every \(\widetilde{\mathcal L}_B\)-class and every ...
Gould, Victoria, Wang, Yanhui
openaire   +1 more source

On Vn-semigroups

open access: yesOpen Mathematics, 2015
In this paper, we give some new characterizations of orthodox semigroups in terms of the set of inverses of idempotents. As a generalization, a new class of regular semigroups, namely Vn-semigroups, is introduced.
Gu Ze, Tang Xilin
doaj   +1 more source

Smarandache U-liberal semigroup structure [PDF]

open access: yes, 2009
In this paper, Smarandache U-liberal semigroup structure is given. It is shown that a semigroup S is Smarandache U-liberal semigroup if and only if it is a strong semilattice of some rectangular monoids. Consequently, some corresponding results on normal
Chen, Yizhi
core   +1 more source

Idempotent 2x2 matrices over linearly ordered abelian groups [PDF]

open access: yesCategories and General Algebraic Structures with Applications
In this paper we study multiplicative semigroups of $2\times 2$ matrices over a linearly ordered abelian group with an externally added bottom element. The multiplication of such a semigroup is defined by replacing addition and multiplication by join and
Valdis Laan, Marilyn Kutti
doaj   +1 more source

Two Generalizations of Homogeneity in Groups with Applications to Regular Semigroups [PDF]

open access: yes, 2014
Let $X$ be a finite set such that $|X|=n$ and let $i\leq j \leq n$. A group $G\leq \sym$ is said to be $(i,j)$-homogeneous if for every $I,J\subseteq X$, such that $|I|=i$ and $|J|=j$, there exists $g\in G$ such that $Ig\subseteq J$.
Araújo, João, Cameron, Peter J.
core   +2 more sources

End-regular and End-orthodox generalized lexicographic products of bipartite graphs

open access: yesOpen Mathematics, 2016
A graph X is said to be End-regular (End-orthodox) if its endomorphism monoid End(X) is a regular (orthodox) semigroup. In this paper, we determine the End-regular and the End-orthodox generalized lexicographic products of bipartite graphs.
Gu Rui, Hou Hailong
doaj   +1 more source

A Note on the Topology of Space-time in Special Relativity [PDF]

open access: yes, 2003
We show that a topology can be defined in the four dimensional space-time of special relativity so as to obtain a topological semigroup for time. The Minkowski 4-vector character of space-time elements as well as the key properties of special relativity ...
Bohm A   +5 more
core   +3 more sources

Congruences on Orthodox Semigroups [PDF]

open access: yesJournal of the Australian Mathematical Society, 1971
A semigroup S is called regular if a ∈ aSa for every element a in S. The elementary properties of regular semigroups may be found in A. H. Clifford and G. B. Preston [1]. A semigroup S is called orthodox if S is regular and if the idempotents of S form a subsemigroup of S.
openaire   +2 more sources

Some orthodox monoids with associate inverse subsemigroups [PDF]

open access: yes, 2011
By an associate inverse subsemigroup of a regular semigroup $S$ we mean a subsemigroup $T$ of $S$ containing a least associate of each $x \in S$, in relation to the natural partial order $\leq_S$ in $S$.
Billhardt, Bernd   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy