Related papers: Global determinism of completely regular semigroup…

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 generalize the concept of the group determinant and prove a necessary and sufficient novel condition for a subset to be a subgroup. This development is based on the group determinant work by Edward Formanek, David Sibley, and Richard…

The parameter coclass has been used successfully in the study of nilpotent algebraic objects of different kinds. In this paper a definition of coclass for nilpotent semigroups is introduced and semigroups of coclass 0, 1, and 2 are…

The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…

We prove that every partial action of an inverse semigroupoid on a set admits a universal globalization. Moreover, we show that our construction gives a reflector from the category of partial actions on the full subcategory of global…

A finite group $G$ is called uniformly semi-rational if there exists an integer $r$ such that the generators of every cyclic sugroup $\langle x \rangle$ of $G$ lie in at most two conjugacy classes, namely $x^G$ or $(x^r)^G$. In this paper,…

We show that a class of algebras is closed under the taking of homomorphic images and direct products if and only if the class consists of all algebras that satisfy a set of (generally simultaneous) equations. For classes of regular…

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

The category of all idempotent generated semigroups with a prescribed structure $\mathcal{E}$ of their idempotents $E$ (called the biordered set) has an initial object called the free idempotent generated semigroup over $\mathcal{E}$,…

Let $G$ be a group. A subset $D$ of $G$ is a determining set of $G$, if every automorphism of $G$ is uniquely determined by its action on $D$. The determining number of $G$, denoted by $\alpha(G)$, is the cardinality of a smallest…

This paper studies decision problems for semigroups that are word-hyperbolic in the sense of Duncan & Gilman. A fundamental investigation reveals that the natural definition of a `word-hyperbolic structure' has to be strengthened slightly…

This paper contains a complete proof of a fundamental theorem on the normalizers of unipotent subgroups in semisimple algebraic groups.

We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite…

We prove two results. (1) There is an absolute constant $D$ such that for any finite quasisimple group $S$, given 2D arbitrary automorphisms of $S$, every element of $S$ is equal to a product of $D$ `twisted commutators' defined by the…

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.

We obtain a characterization of the binary commutator on completely simple semigroups, using their Rees matrix representation. Consequently, we prove that a regular semigroup is nilpotent (solvable) if and only if it is simple, and all its…

Let $\mathcal P(S)$ be the semigroup obtained by equipping the family of all non-empty subsets of a (multiplicatively written) semigroup $S$ with the operation of setwise multiplication induced by $S$ itself. We call a subsemigroup $P$ of…

Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…

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…