Related papers: Semigroups of left quotients - the layered approac…
We show that many important varieties and sets of varieties of semigroups may be defined by relatively simple and transparent first-order formulas in the lattice of all semigroup varieties.
For a numerical semigroup, we encode the set of primitive elements that are larger than its Frobenius number and show how to produce in a fast way the corresponding sets for its children in the semigroup tree. This allows us to present an…
For each n >1, we construct a left quantum group, i.e., a left Hopf algebra H generated by comatrix units X_{ij} and modeled after SL_q(n), which has a left antipode but no right antipode. The quantum special linear group SL_q(n) is a…
Inverses semigroups and orthodox semigroups are either defined in terms of inverses, or in terms of the set of idempotents E(S). In this article, we study analogs of these semigroups defined in terms of inverses modulo Green's relation H,…
Given two elements $x,y$ of a semigroup $X$ we write $x\lesssim y$ if for every homomorphism $\chi:X\to\{0,1\}$ we have $\chi(x)\le\chi(y)$. The quasiorder $\lesssim$ is called the $binary$ $quasiorder$ on $X$. It induces the equivalence…
Two semigroups are lattice isomorphic if the lattices of their subsemigroups are isomorphic, and a class of semigroups is lattice closed if it contains every semigroup which is lattice isomorphic to some semigroup from that class. An…
This note discusses our formalisation in Lean of the classification of the groups of order $p q$ for (not necessarily distinct) prime numbers $p$ and $q$, together with various intermediate results such as the characterisation of internal…
The algebraic extension $\boldsymbol{B}_{\mathbb{Z}}^{\mathscr{F}}$ of the extended bicyclic semigroup for an arbitrary $\omega$-closed family $\mathscr{F}$ subsets of $\omega$ is introduced. It is proven that…
A natural operation on numerical semigroups is taking a quotient by a positive integer. If $\mathcal S$ is a quotient of a numerical semigroup with $k$ generators, we call $\mathcal S$ a $k$-quotient. We give a necessary condition for a…
We discuss a general method by which a higher order difference equation on a group is transformed into an equivalent triangular system of two difference equations of lower orders. This breakdown into lower order equations is based on the…
In this paper, nil extensions of some special type of ordered semigroups, such as, simple regular ordered semigroups, left simple and right regular ordered semigroup. Moreover, we have characterized complete semilattice decomposition of all…
Let $S$ be a semigroup, $\Lambda$ a non-empty set and $P$ a mapping of $\Lambda$ into $S$. The set $S\times \Lambda$ together with the operation $\circ _P$ defined by $(s, \lambda)\circ _P(t, \mu )=(sP(\lambda)t, \mu )$ form a semigroup…
We characterize left and right amenable semigroups of polynomials of one complex variable with respect to the composition operation. We also prove a number of results about amenable semigroups of arbitrary rational functions. In particular,…
In this paper we continue the study of groups of trace class and consider in particular the case of semi-direct products. One of the highlights is the theorem saying that the semi-direct product of a semisimple Lie group G and its Lie…
A characterization of right (left) quasi-duo skew polynomial rings of endomorphism type and skew Laurent polynomial rings are given. In particular, it is shown that (1) the polynomial ring R[x] is right quasi-duo iff R[x] is commutative…
We propose a boundary quotient diagram for right LCM semigroups with property (AR) that generalizes the boundary quotient diagram for the $ax+b$-semigroup over the natural numbers. Our approach focuses on two important subsemigroups: the…
We prove that a semigroup S is a semilattice of rectangular bands and groups of order two if and only if it satisfies the identity x = xxx and for all x,y in S, xyx is in the set {xyyx,yyxxy}.
For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…
A semi-lattice is said to be tree-like when any two of its elements are either orthogonal or comparable. Given an inverse semigroup S whose idempotent semi-lattice is tree-like, and such that all tight filters are ultra-filters, we present…
In this paper, we characterize completely the structure of Clifford semigroups of matrices over an arbitrary field. It is shown that a semigroups of matrices of finite order is a Clifford semigroup if and only if it is isomorphic to a…