Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSome special congruences on completely regular semigroups
60
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
This paper enriches the list of properties of the congruence sequences starting from the universal relation and successively performing the operations of lower $t$ and lower $k$. Three classes of completely regular semigroups, namely semigroups for which $ker{sigma}$ is a cryptogroup, semigroups for which $ker{ u}$ is a cryptogroup and semigroups for which $kappa$ is over rectangular bands, are studied. $((omega_t)_k)_t$, $((mathcal{D}_t)_k)_t$ and $((omega_k)_t)_k$ are found to be the least congruences on $S$ such that the quotient semigroups are semigroups for which $ker{sigma}$ is a cryptogroup, $ker{ u}$ is a cryptogroup and $kappa$ is over rectangular bands, respectively. The results obtained present a response to three problems in Petrich and Reillys textbook textquotelefttextquoteleft Completely Regular Semigroupstextquoterighttextquoteright.
rate research
Read More
This paper is a contribution to the theory of finite semigroups and their classification in pseudovarieties, which is motivated by its connections with computer science. The question addressed is what role can play the consideration of an order compatible with the semigroup operation. In the case of unions of groups, so-called completely regular semigroups, the problem of which new pseudovarieties appear in the ordered context is solved. As applications, it is shown that the lattice of pseudovarieties of ordered completely regular semigroups is modular and that taking the intersection with the pseudovariety of bands defines a complete endomorphism of the lattice of all pseudovarieties of ordered semigroups.
Motivated by the question of which completely regular semigroups have context-free word problem, we show that for certain classes of languages $mathfrak{C}$(including context-free), every completely regular semigroup that is a union of finitely many finitely generated groups with word problem in $mathfrak{C}$ also has word problem in $mathfrak{C}$. We give an example to show that not all completely regular semigroups with context-free word problem can be so constructed.
Several complete congruences on the lattice L(CR) of varieties of completely regular semi- groups have been fundamental to studies of the structure of L(CR). These are the kernel relation K , the left trace relation Tl , the right trace relation Tr and their intersections KcapTl,Kcap Tr . However, with the exception of the lattice of all band varieties which happens to coincide with the kernel class of the trivial variety, almost nothing is known about the internal structure of individual K-classes beyond the fact that they are intervals in L(CR). Here we present a number of general results that are pertinent to the study of K -classes. This includes a variation of the renowned Polak Theorem and its relationship to the complete retraction V -> V cap B , where B denotes the variety of bands. These results are then applied, here and in a sequel, to the detailed analysis of certain families of K -classes. The paper concludes with results hinting at the complexity of K -classes in general, such as that the classes of relation K/Kl may have the cardinality of the continuum.
By a completely inverse $AG^{**}$-groupoid we mean an inverse $AG^{**}$-groupoid $A$ satisfying the identity $xx^{-1}=x^{-1}x$, where $x^{-1}$ denotes a unique element of $A$ such that $x=(xx^{-1})x$ and $x^{-1}=(x^{-1}x)x^{-1}.$ We show that the set of all idempotents of such groupoid forms a semilattice and the Greens relations $mathcal{H,L, R,D}$ and $mathcal{J}$ coincide on $A$. The main result of this note says that any completely inverse $AG^{**}$-groupoid meets the famous Lallements Lemma for regular semigroups. Finally, we show that the Greens relation $mathcal{H}$ is both the least semilattice congruence and the maximum idempotent-separating congruence on any completely inverse $AG^{**}$-groupoid.
This work is a survey on completely regular codes. Known properties, relations with other combinatorial structures and constructions are stated. The existence problem is also discussed and known results for some particular cases are established. In particular, we present a few new results on completely regular codes with covering radius 2 and on extended completely regular codes.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
