Related papers: Idempotent ordered semigroup
Let $\lambda=(\lambda_1,\lambda_2,...)$ be a \emph{partition} of $n$, a sequence of positive integers in non-increasing order with sum $n$. Let $\Omega:=\{1,...,n\}$. An ordered partition $P=(A_1,A_2,...)$ of $\Omega$ has \emph{type}…
In this paper, we view the collection of ideals of a commutative principal ideal ring from two perspectives: one as an ordered semigroup I(R) and the other as a category I_R . It is shown that I(R) is a regular ordered semigroup whereas I_R…
A complete set of primitive orthogonal idempotents plays an important role in the representation theory of an associative algebra. In this paper, we construct a complete set of primitive orthogonal idempotents for any finite Brandt…
Idempotents dominate the structure theory of rings. The Peirce decomposition induced by an idempotent provides a natural environment for defining and classifying new types of rings. This point of view offers a way to unify and to expand the…
Finite (upper) nearlattices are essentially the same mathematical entities as finite semilattices, finite commutative idempotent semigroups, finite join-enriched meet semilattices, and chopped lattices. We prove that if an $n$-element…
In the current paper we study extremal semilattices with respect to their equational properties. In the class $\mathbf{S}_n$ of all semilattices of order $n$ we find semilattices which have maximal (minimal) number of consistent equations.…
Let $X$ be an ordered vector space. The net $\{x_\alpha\}\subseteq X$ is semi unbounded order convergent to $x$ (in symbol $x_\alpha\xrightarrow{suo}x$), if there is a net $\{y_\beta\}$, possibly over a different index set, such that…
An element $g$ in a group $G$ is called \emph{reciprocal} if there exists $h \in G$ such that $g^{-1}=hgh^{-1}$. The reciprocal elements are also known as `real elements' or `reversible elements' in the literature. We classify the…
This paper is devoted to characterizing the so-called order isomorphisms intertwining the $L^2$-semigroups of two Dirichlet forms. We first show that every unitary order isomorphism intertwining semigroups is the composition of…
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
In this paper, we study definably compact semigroups in o-minimal structures, aiming to extend the theory of definable groups to a broader algebraic setting. We show that any definably compact semigroup contains idempotents and admits a…
We give a characterisation of the idempotents of the partition monoid, and use this to enumerate the idempotents in the finite partition, Brauer and partial Brauer monoids, giving several formulae and recursions for the number of…
We first establish a sufficient condition for an additively idempotent semiring to be nonfinitely based. As applications, we exhibit several examples of additively idempotent semirings satisfying this condition, including a $4$-element…
A semigroup $S$ is called an equational domain if any finite union of algebraic sets over $S$ is algebraic. We prove some necessary and sufficient conditions for a completely simple semigroup to be an equational domain.
In this short note, we provide an inequality that holds in any finite group, only involving the orders of the elements; we prove that equality holds if and only if the group is nilpotent.
In this note we answer the question raised by Han et al. in J. Korean Math. Soc (2014) whether an idempotent isomorphic to a semicentral idempotent is itself semicentral. We show that rings with this property are precisely the…
We consider the lattice of subsemigroups of the general linear group over an Artinian ring containing the group of diagonal matrices and show that every such semigroup is actually a group.
A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…
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…
We consider multiplicative semigroups of real dxd matrices. A semigroup S is called Perron if each of its matrices has a Perron eigenvalue, i.e., an eigenvalue equal to the spectral radius. If all matrices of S leave a proper convex cone…