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

We investigate the complexity of deciding, given a multiplication table representing a semigroup S, a subset X of S and an element t of S, whether t can be expressed as a product of elements of X. It is well-known that this problem is…

We show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, and we provide necessary and sufficient conditions for such a reduction to be unique. These results are then refined in the case of symmetric n-ary…

The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…

Suppose $G$ is a $\mathcal{T}$-group (finitely generated torsion-free nilpotent) with centralizers outside of the derived subgroup being abelian of rank equal to $\text{rank}(Z_1)+1$. This includes the class of free nilpotent groups…

To solve two problems of Bergman stated in 1981, we construct a group $G$ such that $G$ contains a free noncyclic subgroup (hence, $G$ satisfies no group identity) and $G$, as a group, is generated by its subsemigroup that satisfies a…

Let $n>0$ be an integer and $\mathcal{X}$ be a class of groups. We say that a group $G$ satisfies the condition $(\mathcal{X},n)$ whenever in every subset with $n+1$ elements of $G$ there exist distinct elements $x,y$ such that $<x,y>$ is…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

If G and H are finitely generated, residually nilpotent metabelian groups, H is termed para-G if there is a homomorphism of G into H which induces an isomorphism between the corresponding terms of their lower central quotient groups. We…

In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of…

A hyperidentity $E$ can be viewed as a statement in second order logic. When combined with a similarity type $\tau$, it can also be considered as a set of first order statements. Based on examples from "A small basis for…

In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…

Suppose a group $G$ is quasi-isometric to a free product of a finite set $S$ of finitely generated abelian groups; let $S'$ denote the set of ranks of the free abelian parts of the groups in $S$. Then $G$ is commensurable with the free…

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…

We solve the word problem of the identity $x(yz) = (xy)(yz)$ by investigating a certain group describing the geometry of that identity. We also construct a concrete realization of the free system of rank~1 relative to the above identity

The group of 2-by-2 matrices with integer entries and determinant $\pm > 1$ can be identified either with the group of outer automorphisms of a rank two free group or with the group of isotopy classes of homeomorphisms of a 2-dimensional…

Let $X$ be a variety of dimension $n$, and let $\mathrm{Aut}(X)$ be its automorphism group. When $X$ is quasi-affine, we prove that a solvable subgroup of $\mathrm{Aut}(X)$ that is generated by an irreducible family of automorphisms…

We study polynomial identities satisfied by the mutation product $xpy - yqx$ on the underlying vector space of an associative algebra $A$, where $p, q$ are fixed elements of $A$. We simplify known results for identities in degree $4$,…

We consider semigroup algorithmic problems in the Special Affine group $\mathsf{SA}(2, \mathbb{Z}) = \mathbb{Z}^2 \rtimes \mathsf{SL}(2, \mathbb{Z})$, which is the group of affine transformations of the lattice $\mathbb{Z}^2$ that preserve…

In this paper we investigate the word problem of the free Burnside semigroup satisfying x^2=x^3 and having two generators. Elements of this semigroup are classes of equivalent words. A natural way to solve the word problem is to select a…

We examine the computational complexity of problems in which we are given generators for a partial bijection semigroup and asked to check properties of the generated semigroup. We prove that the following problems are in AC$^0$: (1)…