Related papers: Finite Permutable Putcha Semigroups
A subgroup $\Delta\leq \Gamma$ is commensurated if $|\Delta:\Delta\cap \gamma\Delta\gamma^{-1}|<\infty$ for all $\gamma\in \Gamma$. We show a finitely generated branch group is just infinite if and only if every commensurated subgroup is…
We classify minimal transitive subsemigroups of the finitary inverse symmetric semigroup modulo the classification of minimal transitive subgroups of finite symmetric groups; and semitransitive subsemigroups of the finite inverse symmetric…
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.
In this article, we compare two different notions of partially defined group strutures, namely partial groups and pregroups, as introduced by Chermak and Stallings respectively. In particular we prove that the category of pregroups can be…
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…
In this paper we initiate the study of $\aleph_0$-categorical semigroups, where a countable semigroup $S$ is $\aleph_0$-categorical if, for any natural number $n$, the action of its group of automorphisms Aut $S$ on $S^n$ has only finitely…
We characterize some classes of finite soluble groups. In particular, we prove that: a finite group $G$ is supersoluble if and only if $G$ has a normal subgroup $D$ such that $G/D$ is supersoluble and $D$ avoids every chief factor of $G$…
For a semigroup $S$, the covering number of $S$ with respect to semigroups, $\sigma_s(S)$, is the minimum number of proper subsemigroups of $S$ whose union is $S$. This article investigates covering numbers of semigroups and analogously…
In this paper we give sufficient conditions under which a subsemigroup of a topological group is a subgroup, adding to the results given in \cite{Kosh, can, axioms, forum, Hof, cc, locally} where conditions exist (such as locally…
Let $H$ be a subgroup of a group $G$. The permutizer $P_G(H)$ is the subgroup generated by all cyclic subgroups of $G$ which permute with $H$. A subgroup $H$ of a group $G$ is strongly permutable in $G$ if $P_U(H)=U$ for every subgroup $U$…
Given an arbitrary group $G$ we construct a semigroup of idempotents (band) $B_G$ with the property that the free idempotent generated semigroup over $B_G$ has a maximal subgroup isomorphic to $G$. If $G$ is finitely presented then $B_G$ is…
Nilpotent semigroups in the sense of Mal'cev are defined by semigroup identities. Finite nilpotent semigroups constitute a pseudovariety, $\mathsf{MN}$, which has finite rank. The semigroup identities that define nilpotent semigroups, lead…
Given a finite nonabelian semisimple group $G$, we describe those groups that have the same holomorph as $G$, that is, those regular subgroups $N\simeq G$ of $S(G)$, the group of permutations on the set $G$, such that…
The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},\ldots , a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}\cdots a_{n} =a_{\sigma (1)} a_{\sigma (2)} \cdots a_{\sigma (n)}$, where…
If the congruences of a semigroup are commutative, we say that the semigroup is permutable. In a previous paper, A. Nagy showed that every permutable semigroup satisfying an arbitrary non-trivial permutation identity is medial or an ideal…
In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…
To each meet-semilattice $E$ is associated an inverse semigroup $T_{E}$ called the Munn semigroup of $E$. We generalise this construction by replacing the meet-semilattice $E$ by a presheaf of sets $X$ over a meet-semilattice. The inverse…
A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that…
A transitive permutation group is semiprimitive if each of its normal subgroups is transitive or semiregular. Interest in this class of groups is motivated by two sources: problems arising in universal algebra related to collapsing monoids…
Let $\mathfrak F$ be a class of groups. A group $G$ is called $ca$-$\mathfrak F$-group if its every non-abelian chief factor is simple and $H/K \leftthreetimes C_G(H/K) \in \mathfrak F$ for every abelian chief factor $H/K$ of $G$. In this…