Related papers: Semigroup Identities, Proofs, and Artificial Intel…

Let $G$ be a nonabelian group. We say that $G$ has an abelian partition, if there exists a partition of $G$ into commuting subsets $A_1, A_2, \ldots, A_n$ of $G$, such that $|A_i|\geqslant 2$ for each $i=1, 2, \ldots, n$. This paper…

It is well known that in every inverse semigroup the binary operation and the unary operation of inversion satisfy the following three identities: [\quad x=(xx')x \qquad \quad (xx')(y'y)=(y'y)(xx') \qquad \quad (xy)z=x(yz"). ] The goal of…

Given integers $d\ge 3$ and $N\ge 3$. Let $G$ be a finite abelian group acting faithfully and linearly on a smooth hypersurface of degree $d$ in the complex projective space $\mathbb{P}^{N-1}$. Suppose $G\subset PGL(N, \mathbb{C})$ can be…

A maximal abelian normal subgroup A in a nilpotent group N is self-centralizing. This makes their role an important one in determining the structure of the nilpotent group. For example if A is finite then N is also finite. In the free…

In this note, we give a new formula for the number of cyclic subgroups of a finite abelian group. This is based on applying the Burnside's lemma to a certain group action. Also, it generalizes the well-known Menon's identity.

We construct an embedding G of the category of graphs into the category of abelian groups such that for graphs X and Y we have Hom(GX,GY)=Z[Hom(X,Y)], the free abelian group whose basis is the set Hom(X,Y). The isomorphism is functorial in…

While efficient algorithms are known for solving many important problems related to groups, no efficient algorithm is known for determining whether two arbitrary groups are isomorphic. The particular case of 2-nilpotent groups, a special…

Let $\mathbb F$ be an algebraically closed field, $G$ be an abelian group, and let $A$ and $B$ be arbitrary finite-dimensional $G$-graded simple algebras over $\mathbb F$. We prove that $A$ and $B$ are isomorphic if, and only if, they…

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…

A group is called $(m,n)$-bicyclic if it can be expressed as a product of two cyclic subgroups of orders $m$ and $n$, respectively. The classification and characterization of finite bicyclic groups have long been important problems in group…

We introduce the pseudovariety of finite groups $\mathbf{U} = \displaystyle\bigvee_{p \in \mathbb{P}} {\bf Ab}(p) \ast {\bf Ab}(p-1)$, where $\mathbb{P}$ is the set of all primes. We show that $\mathbf{U}$ consists of all finite…

Let $x$, $y$ be two integral quaternions of norm $p$ and $l$, respectively, where $p$, $l$ are distinct odd prime numbers. We investigate the structure of $<x,y>$, the multiplicative group generated by $x$ and $y$. Under a certain condition…

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X of S, decide whether each element of S has at most one factorization over X. To…

A groupoid identity is said to be linear of length $2k$ if the same $k$ variables appear on both sides of the identity exactly once. We classify and count all varieties of groupoids defined by a single linear identity. For $k=3$, there are…

In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…

A group is called square-like if it is universally equivalent to its direct square. It is known that the class of all square-like groups admits an explicit first order axiomatization but its theory is undecidable. We prove that the theory…

We obtain an explicit description of the endomorphisms of free-abelian by free groups together with a characterization of when they are injective and surjective. As a consequence we see that free-abelian by free groups are Hopfian and not…

We study the following problem, first introduced by Dekking. Consider an infinite word x over an alphabet {0,1,...,k-1} and a semigroup homomorphism S:{0,1,...,k-1}* -> N. Let L_x denote the set of factors of x. What conditions on S and the…

In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…

Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…