Related papers: Idempotent ordered semigroup
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…
Let G be an isotropic reductive algebraic group over a commutative ring R. Assume that the elementary subgroup E(R) of group of points G(R) is correctly defined. Then E(R) is perfect, except for the well-known cases of a split reductive…
For an inverse semigroup S with the set of idempotents E and a minimal idempotent, we find necessary and sufficient conditions for the Fourier algebra A(S) to be module amenable, module character amenable, module (operator) biflat, or…
We wrote this paper as an example to show the way we pass from ordered semigroups to ordered hypersemigroups.
Let $\mathbb{A} = (A, \cdot)$ be a semigroup. We generalize some recent results by G. A. Freiman, M. Herzog and coauthors on the structure theory of set addition from the context of linearly orderable groups to linearly orderable…
The action of the idempotent deformations on finite groups is discussed. This action is described in terms of the homological properties of groups. The orbits of finite simple groups are determined.
Regarding the question of how idempotent elements affect reversible property of rings, we study a version of reversibility depending on idempotents. In this perspective, we introduce {\it right} (resp., {\it left}) {\it $e$-reversible…
A semigroup $S$ is called an equational domain if any finite union of algebraic sets over $S$ is algebraic. We prove if a completely regular semigroup $S$ is an equational domain then $S$ is completely simple.
A regular semigroup is weakly generated by a set X if it has no proper regular subsemigroups containing X. In this paper, we study the regular semigroups weakly generated by idempotents. We show there exists a regular semigroup FI(X) weakly…
The partial automorphism monoid of an inverse semigroup is an inverse monoid consisting of all isomorphisms between its inverse subsemigroups. We prove that a tightly connected fundamental inverse semigroup $S$ with no isolated nontrivial…
The idempotent problem of a finitely generated inverse semigroup is the formal language of all words over the generators representing idempotent elements. This note proves that a finitely generated inverse semigroup with regular idempotent…
Denote by $\mathcal T_n$ and $\mathcal S_n$ the full transformation semigroup and the symmetric group on the set $\{1,\ldots,n\}$, and $\mathcal E_n=\{1\}\cup(\mathcal T_n\setminus \mathcal S_n)$. Let $\mathcal T(X,\mathcal P)$ denote the…
The change-making problem was recently extended to sets of positive integers not containing the element $1$, and from there to numerical semigroups. A greedy numerical semigroup is defined as a numerical semigroup where the greedy…
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…
In this paper we study grouplike monoids, these are monoids that contain a group to which we add an ordered set of idempotents. We classify finite categories with two objects having grouplike endomorphism monoids, and we give a count of…
If $G$ is the symmetry group of an uncolored pattern then a coloring of the pattern is semiperfect if the associated color group $H$ is a subgroup of $G$ of index 2. We give results on how to identify and enumerate all inequivalent…
We detect topological semigroups that are topological paragroups, i.e., are isomorphic to a Rees product of a topological group over topological spaces with a continuous sandwich function. We prove that a simple topological semigroup $S$ is…
We study a ring containing a complete set of orthogonal idempotents as a generalized matrix ring via its Peirce decomposition. We focus on the case where some of the underlying bimodule homomorphisms are zero. Upper and lower triangular…
Given a monoid $S$ with $E$ any non-empty subset of its idempotents, we present a novel one-sided version of idempotent completion we call left $E$-completion. In general, the construction yields a one-sided variant of a small category…
A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…