Related papers: Idempotent ordered semigroup
A finite group $G$ is called $\psi$-divisible if $\psi(H)|\psi(G)$ for any subgroup $H$ of $G$, where $\psi(H)$ and $\psi(G)$ are the sum of element orders of $H$ and $G$, respectively. In this paper, we extend a result provided in [10], by…
We consider numerical semigroups associated with normal weighted homogeneous surface singularities with rational homology sphere links. We say that a semigroup is representable if it can be realized in this way. In this article, we study…
We use topological methods to study the maximal subgroups of the free idempotent generated semigroup on a biordered set. We use these to give an example of a free idempotent generated semigroup with maximal subgroup isomorphic to the free…
Let $[n]=\{1,2,\ldots,n\}$ be a finite chain and let $\mathcal{CT}_{n}$ be the semigroup of full contractions on $[n]$. Denote $\mathcal{ORCT}_{n}$ and $\mathcal{OCT}_{n}$ to be the subsemigroup of order preserving or reversing and the…
A {\it Schmidt group} is a non-nilpotent finite group in which each proper subgroup is nilpotent. Each Schmidt group G can be described by three parameters p, q and v, where p and q are different primes and v is a natural number, $v\ge 1$.…
We are interested in formulas for the number of elements in certain classes of numerical semigroups
Let $\mathcal C$ be a class of topological semigroups. A semigroup $X$ is called (1) $\mathcal C$-$closed$ if $X$ is closed in every topological semigroup $Y\in\mathcal C$ containing $X$ as a discrete subsemigroup, (2) $ideally$ $\mathcal…
A finite semigroup is finitely related (has finite degree) if its term functions are determined by a finite set of finitary relations. For example, it is known that all nilpotent semigroups are finitely related. A nilpotent monoid is a…
In this paper we study S-idempotents of the group ring \mathbb{Z}_2G where G is a finite cyclic group of order n. We give a condition on n such that every nonzero idempotent element of the group ring \mathbb{Z}_2G is Smarandache idempotent…
It is shown that finite groups in which the order of the product of every pair of elements of co-prime order is the product of the orders, is nilpotent.
The following is shown : Let $S=\{a_1,a_2,..,a_{2n}\}$ be a subset of a totally ordered commutative semi-group $(G,*,\leq)$ with $a_1\leq a_2\leq...\leq a_{2n}$. Provided that a system of $n$ $a_{i_k} * a_{j_k}\ (a_{i_k}, a_{j_k} \in G ;\ 1…
An element w of a Weyl group W is called elliptic if it has no eigenvalue 1 in the standard reflection representation. We determine the order of any representative g in a semisimple algebraic group G of an elliptic element w in the…
A semigroup $S$ is right noetherian if every right congruence on $S$ is finitely generated. In this paper we present some fundamental properties of right noetherian semigroups, discuss how semigroups relate to their substructures with…
Let $p$ be a prime. A $p$-group $G$ is defined to be semi-extraspecial if for every maximal subgroup $N$ in $Z(G)$ the quotient $G/N$ is a an extraspecial group. In addition, we say that $G$ is ultraspecial if $G$ is semi-extraspecial and…
Motivated by appearance of multisemigroups in the study of additive $2$-categories, we define and investigate the notion of a multisemigroup with multiplicities. This notion seems to be better suitable for applications in higher…
Inverse semigroups are a class of semigroups whose structure induces a compatible partial order. This partial order is examined so as to establish mirror properties between an inverse semigroup and the semilattice of its idempotent…
Our aim in this paper is to initiate the study of exponent semigroups for rational matrices. We prove that every numerical semigroup is the exponent semigroup of some rational matrix. We also obtain lower bounds on the size of such matrices…
A CP-semigroup is aligned if its set of trivially maximal subordinates is totally ordered by subordination. We prove that aligned spatial E_0-semigroups are prime: they have no non-trivial tensor product decompositions up to cocycle…
A numerical semigroup is a submonoid of ${\mathbb Z}_{\ge 0}$ whose complement in ${\mathbb Z}_{\ge 0}$ is finite. For any set of positive integers $a,b,c$, the numerical semigroup $S(a,b,c)$ formed by the set of solutions of the inequality…
We construct a solvable group G of order 5648590729620 such that the set of element orders of G coincides with that of the simple group S(4,3). This completes the determination of finite simple groups isospectral to solvable groups.