Related papers: Finite Permutable Putcha Semigroups

Let $S$ be a semigroup and $\mathbb F$ be a field. For an ideal $J$ of the semigroup algebra ${\mathbb F}[S]$ of $S$ over $\mathbb F$, let $\varrho _J$ denote the restriction (to $S$) of the congruence on ${\mathbb F}[S]$ defined by the…

A subset $A$ of a semigroup $S$ is called a $chain$ ($antichain$) if $xy\in\{x,y\}$ ($xy\notin\{x,y\}$) for any (distinct) elements $x,y\in S$. A semigroup $S$ is called ($anti$)$chain$-$finite$ if $S$ contains no infinite (anti)chains. We…

Suppose that $G$ is a finite group and $H$ is a subgroup of $G$. We say that $H$ is s-semipermutable in $G$ if $HG_p = G_pH$ for any Sylow $p$-subgroup $G_p$ of $G$ with $(p, |H|) = 1$. We investigate the influence of s-semipermutable…

An algebraic structure is said to be congruence permutable if its arbitrary congruences $\alpha$ and $\beta$ satisfy the equation $\alpha \circ \beta =\beta \circ \alpha$, where $\circ$ denotes the usual composition of binary relations. For…

A semigroup is called $E$-$separated$ if for any distinct idempotents $x,y\in X$ there exists a homomorphism $h:X\to Y$ to a semilattice $Y$ such that $h(x)\ne h(y)$. Developing results of Putcha and Weissglass, we characterize…

A quasi-semiregular element in a permutation group is an element that has a unique fixed point and acts semiregularly on the remaining points. Such elements were first studied in the context of automorphisms of graphs and occur naturally in…

Let $\sigma=\{\pi_i | i\in I$ and $\pi_i\cap\pi_j=\emptyset$ for all $i\neq j\}$ be a partition of the set of all primes into mutually disjoint subsets. In this paper we considered subgroups that permutes with given sets of $\pi_i$-maximal…

An element e of an ordered semigroup $(S,\cdot,\leq)$ is called an ordered idempotent if $e\leq e^2$. We call an ordered semigroup $S$ idempotent ordered semigroup if every element of $S$ is an ordered idempotent. Every idempotent semigroup…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$, $G$ a finite group and $\sigma (G) =\{\sigma_{i} |\sigma_{i}\cap \pi (G)\ne \emptyset \}$. A set ${\cal H}$ of subgroups of $G$ is said to be a…

A mixed lattice is a partially ordered set with two mixed partial orderings that are linked by asymmetric upper and lower envelopes. These notions generalize the join and meet operations of a lattice. In the present paper, we study…

The purpose of this paper is to study the generalization of inverse semigroups (without order). An ordered semigroup S is called an inverse ordered semigroup if for every a 2 S, any two inverses of a are H-related. We prove that an ordered…

A transitive permutation group is said to be semiprimitive if each of its normal subgroups is either semiregular or transitive.The class of semiprimitive groups properly contains primitive groups, quasiprimitive groups and innately…

Let $a$ be a non-invertible transformation of a finite set and let $G$ be a group of permutations on that same set. Then $\genset{G, a}\setminus G$ is a subsemigroup, consisting of all non-invertible transformations, in the semigroup…

Semiuniform semigroups provide a natural setting for the convolution of generalized finite measures on semigroups. A semiuniform semigroup is said to be ambitable if each uniformly bounded uniformly equicontinuous set of functions on the…

This work introduces a new kind of affine semigroups called $P$-semigroups. Within the framework of $\mathcal C$-semigroups, we define a finite-state automaton associated to them. Moreover, this automaton determines whether a $\mathcal…

Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…

The monogenic free inverse semigroup $FI_1$ is not finitely presented as a semigroup due to the classic result by Schein (1975). We extend this result and prove that a finitely generated subsemigroup of $FI_1$ is finitely presented if and…

A subgroup $H$ of a finite group $G$ is said to be SS-permutable in $G$ if $H$ has a supplement $K$ in $G$ such that $H$ permutes with every Sylow subgroup of $K$. A finite group $G$ is called an SST-group if SS-permutability is a…

A semigroup is \emph{amiable} if there is exactly one idempotent in each $\mathcal{R}^*$-class and in each $\mathcal{L}^*$-class. A semigroup is \emph{adequate} if it is amiable and if its idempotents commute. We characterize adequate…

In this paper we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. We give bounds on the order, base size, minimal degree, fixity, and chief length of an arbitrary…