Refine
Has Fulltext
- no (41) (remove)
Year of publication
Document Type
- Article (38)
- Doctoral Thesis (2)
- Monograph/Edited Volume (1)
Is part of the Bibliography
- yes (41)
Keywords
Institute
The paper deals with Sigma-composition and Sigma-essential composition of terms which lead to stable and s-stable varieties of algebras. A full description of all stable varieties of semigroups, commutative and idempotent groupoids is obtained. We use an abstract reduction system which simplifies the presentations of terms of type tau - (2) to study the variety of idempotent groupoids and s-stable varieties of groupoids. S-stable varieties are a variation of stable varieties, used to highlight replacement of subterms of a term in a deductive system instead of the usual replacement of variables by terms.
Maximal subsemigroups of some semigroups of order-preserving mappings on a countably infinite set
(2017)
In this paper, we study the maximal subsemigroups of several semigroups of order-preserving transformations on the natural numbers and the integers, respectively. We determine all maximal subsemigroups of the monoid of all order-preserving injections on the set of natural numbers as well as on the set of integers. Further, we give all maximal subsemigroups of the monoid of all bijections on the integers. For the monoid of all order-preserving transformations on the natural numbers, we classify also all its maximal subsemigroups, containing a particular set of transformations.
Any clones on arbitrary set A can be written of the form Pol (A)Q for some set Q of relations on A. We consider clones of the form Pal (A)Q where Q is a set of unary relations on a finite set A. A clone Pol (A)Q is said to be a clone on a set of the smallest cardinality with respect to category equivalence if vertical bar A vertical bar <= vertical bar S vertical bar for all finite sets S and all clones C on S that category equivalent to Pol (A)Q. We characterize the clones on a set of the smallest cardinality with respect to category equivalent and show how we can find a clone on a set of the smallest cardinality that category equivalent to a given clone.
We characterize maximal subsemigroups of the monoid T(X) of all transformations on the set X = a"center dot of natural numbers containing a given subsemigroup W of T(X) such that T(X) is finitely generated over W. This paper gives a contribution to the characterization of maximal subsemigroups on the monoid of all transformations on an infinite set.
We determine all regular solid varieties of commutative semigroups. Each of them is contained in the Reg- hyperequational class V (RC) defined by the associative law and the commutative law, and every subvariety of V (RC) is regular solid. In the present paper, the subvariety lattice of V (RC) will be characterized.
In this paper, we determine necessary and sufficient conditions for Bruck-Reilly and generalized Bruck-Reilly *-extensions of arbitrary monoids to be regular, coregular and strongly pi-inverse. These semigroup classes have applications in various field of mathematics, such as matrix theory, discrete mathematics and p-adic analysis (especially in operator theory). In addition, while regularity and coregularity have so many applications in the meaning of boundaries (again in operator theory), inverse monoids and Bruck-Reilly extensions contain a mixture fixed-point results of algebra, topology and geometry within the purposes of this journal.
Each completely regular semigroup is a semilattice of completely simple semigroups. The more specific concept of a strong semilattice provides the concrete product between two arbitrary elements.
We characterize strong semilattices of rectangular groups by so-called disjunctions of identities. Disjunctions of identities generalize the classical concept of an identity and of a variety, respectively.
The rectangular groups will be on the one hand left zero semigroups and right zero semigroups and on the other hand groups of exponent p is an element of P, where P is any set of pairwise coprime natural numbers.
A zig-zag (or fence) order is a special partial order on a (finite) set. In this paper, we consider the semigroup TFn of all order-preserving transformations on an n-element zig-zag-ordered set. We determine the rank of TFn and provide a minimal generating set for TFn. Moreover, a formula for the number of idempotents in TFn is given.
For n∈N , let Xn={a1,a2,…,an} be an n-element set and let F=(Xn;<f) be a fence, also called a zigzag poset. As usual, we denote by In the symmetric inverse semigroup on Xn. We say that a transformation α∈In is fence-preserving if x<fy implies that xα<fyα, for all x,y in the domain of α. In this paper, we study the semigroup PFIn of all partial fence-preserving injections of Xn and its subsemigroup IFn={α∈PFIn:α−1∈PFIn}. Clearly, IFn is an inverse semigroup and contains all regular elements of PFIn. We characterize the Green’s relations for the semigroup IFn. Further, we prove that the semigroup IFn is generated by its elements with rank ≥n−2. Moreover, for n∈2N, we find the least generating set and calculate the rank of IFn.
A semigroup S is called anti-inverse if for all a E S there is a b is an element of S such that aba = b and bab = a. Each anti-inverse semigroup is regular. In the present paper, we study anti-inverse subsemigroups within the semigroup T-n of all transformations on an n-element set (1 <= n is an element of N). In particular, we characterize all anti-inverse semigroups within the J-classes of T-n and illustrate our result by four examples.
A partial transformation alpha on an n-element chain X-n is called order-preserving if x <= y implies x alpha <= y alpha for all x, y in the domain of alpha and it is called extensive if x <= x alpha for all x in the domain of alpha. The set of all partial order-preserving extensive transformations on X-n forms a semiband POEn. We determine the maximal subsemigroups as well as the maximal subsemibands of POEn.
Let X be an infinite linearly ordered set and let Y be a nonempty subset of X. We calculate the relative rank of the semigroup OP(X,Y) of all orientation-preserving transformations on X with restricted range Y modulo the semigroup O(X,Y) of all order-preserving transformations on X with restricted range Y. For Y = X, we characterize the relative generating sets of minimal size.
In this note, we consider the semigroup O(X) of all order endomorphisms of an infinite chain X and the subset J of O(X) of all transformations alpha such that vertical bar Im(alpha)vertical bar = vertical bar X vertical bar. For an infinite countable chain X, we give a necessary and sufficient condition on X for O(X) = < J > to hold. We also present a sufficient condition on X for O(X) = < J > to hold, for an arbitrary infinite chain X.
The study of the semigroups OPn, of all orientation-preserving transformations on an n-element chain, and ORn, of all orientation-preserving or orientation-reversing transformations on an n-element chain, has began in [17] and [5]. In order to bring more insight into the subsemigroup structure of OPn and ORn, we characterize their maximal subsemigroups.
Hypersubstitutions are mappings which map operation symbols to terms. Terms can be visualized by trees. Hypersubstitutions can be extended to mappings defined on sets of trees. The nodes of the trees, describing terms, are labelled by operation symbols and by colors, i.e. certain positive integers. We are interested in mappings which map differently-colored operation symbols to different terms. In this paper we extend the theory of hypersubstitutions and solid varieties to multi-hypersubstitutions and colored solid varieties. We develop the interconnections between such colored terms and multihypersubstitutions and the equational theory of Universal Algebra. The collection of all varieties of a given type forms a complete lattice which is very complex and difficult to study; multi-hypersubstitutions and colored solid varieties offer a new method to study complete sublattices of this lattice.
Hyperassociative semigroups
(1994)