All Maximal Completely Regular Submonoids of HypG(2)
Journal Title: Discussiones Mathematicae - General Algebra and Applications - Year 2017, Vol 37, Issue 1
Abstract
In this paper we consider mappings σ which map the binary operation symbol f to the term σ(f) which do not necessarily preserve the arity. These mapping are called generalized hypersubstitutions of type τ = (2) and we denote the set of all these generalized hypersubstitutions of type τ = (2) by HypG(2). The set HypG(2) together with a binary operation defined on this set and the identity generalized hypersubstitution which maps f to the term f(x1, x2) forms a monoid. In this paper, we determine all maximal completely regular submonoids of this monoid.
Authors and Affiliations
Pornpimol Kunama, Sorasak Leeratanavalee
Keywords
Related Articles
- EP ID EP394545
- DOI 10.7151/dmgaa.1263
- Views 63
- Downloads 0
NON-DETERMINISTIC LINEAR HYPERSUBSTITUTIONS
A non-deterministic hypersubstitution maps operation symbols to sets of terms of the corresponding arity. A non-deterministic hypersubstitution of type τ is said to be linear if it maps any operation symbol to a set of l...
GRADED HILBERT-SYMBOL EQUIVALENCE OF NUMBER FIELDS
We present a new criterion for the existence of Hilbert-symbol equivalence of two number fields. In principle, we show that the system of local conditions for this equivalence may be expressed in terms of Clifford invari...
CODES OVER HYPERFIELDS
In this paper, we define linear codes and cyclic codes over a finite Krasner hyperfield and we characterize these codes by their generator matrices and parity check matrices. We also demonstrate that codes over finite Kr...
BOOLEAN FILTERS IN PSEUDO-COMPLEMENTED ALMOST DISTRIBUTIVE LATTICES
In this paper we have introduced the concept of Boolean filters in a pseudo-complemented Almost Distributive Lattice (pseudo-complemented ADL) and studied their properties. Finally, a Boolean filter is characterized in t...
ON A PERIOD OF ELEMENTS OF PSEUDO-BCI-ALGEBRAS
The notions of a period of an element of a pseudo-BCI-algebra and a periodic pseudo-BCI-algebra are defined. Some of their properties and characterizations are given.