Related papers: Algorithmic decidability of Engel's property for a…

For an element $g$ of a group $G$, an Engel sink is a subset $\mathscr{E}(g)$ such that for every $ x\in G $ all sufficiently long commutators $ [x,g,g,\ldots,g] $ belong to $\mathscr{E}(g)$. Let $q$ be a prime, let $m$ be a positive…

Let $G$ be a non-Engel group and let $L(G)$ be the set of all left Engel elements of $G$. Associate with $G$ a graph $\mathcal{E}_G$ as follows: Take $G\backslash L(G)$ as vertices of $\mathcal{E}_G$ and join two distinct vertices $x$ and…

Let $p$ be a prime and let $G$ be a subgroup of a Sylow pro-$p$ subgroup of the group of automorphisms of the $p$-adic tree. We prove that if $G$ is fractal and $|G':\mathrm{st}_G(1)'|=\infty$, then the set $L(G)$ of left Engel elements of…

We consider semigroup algorithmic problems in finitely generated metabelian groups. Our paper focuses on three decision problems introduced by Choffrut and Karhum\"{a}ki (2005): the Identity Problem (does a semigroup contain a neutral…

Let $g$ be an element of a group $G$. For a positive integer $n$, let $E_n(g)$ be the subgroup generated by all commutators $[...[[x,g],g],\dots ,g]$ over $x\in G$, where $g$ is repeated $n$ times. We prove that if $G$ is a profinite group…

This paper addresses a decision problem highlighted by Grigorchuk, Nekrashevich, and Sushchanskii, namely the finiteness problem for automaton (semi)groups. For semigroups, we give an effective sufficient but not necessary condition for…

The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

A right Engel sink of an element $g$ of a group $G$ is a set ${\mathscr R}(g)$ such that for every $x\in G$ all sufficiently long commutators $[...[[g,x],x],\dots ,x]$ belong to ${\mathscr R}(g)$. (Thus, $g$ is a right Engel element…

A right Engel sink of an element $g$ of a group $G$ is a set ${\mathscr R}(g)$ such that for every $x\in G$ all sufficiently long commutators $[...[[g,x],x],\dots ,x]$ belong to ${\mathscr R}(g)$. (Thus, $g$ is a right Engel element…

We study properties of Engel elements in weakly branch groups, lying in the group of automorphisms of a spherically homogeneous rooted tree. More precisely, we prove that the set of bounded left Engel elements is always trivial in weakly…

We give an affrmative answer to the question whether a residually finite Engel group satisfying an identity is locally nilpotent. More generally, for a residually finite group G with an identity, we prove that the set of right Engel…

We show that there exists an algorithm to decide any single equation in the Heisenberg group in finite time. The method works for all two-step nilpotent groups with rank-one commutator, which includes the higher Heisenberg groups. We also…

For an element $g$ of a group $G$, an Engel sink is a subset $\mathcal{E}(g)$ such that for every $ x\in G $ all sufficiently long commutators $ [x,g,g,\ldots,g] $ belong to $\mathcal{E}(g)$. We conjecture that if $G$ is a profinite group…

The knapsack problem is a classic optimisation problem that has been recently extended in the setting of groups. Its study reveals to be interesting since it provides many different behaviours, depending on the considered class of groups.…

We define a new strict and computable hierarchy for the family of automaton semigroups, which reflects the various asymptotic behaviors of the state-activity growth. This hierarchy extends that given by Sidki for automaton groups, and also…

Let $q$ be a prime, $n$ a positive integer and $A$ an elementary abelian group of order $q^r$ with $r\geq2$ acting on a finite $q'$-group $G$. The following results are proved. We show that if all elements in $\gamma_{r-1}(C_G(a))$ are…

The question of whether there exists a finite group of order at least three in which every element except one is a commutator has remained unresolved in group theory. In this article, we address this open problem by developing an…

In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…

We prove that many dynamical properties of group cellular automata (i.e., cellular automata defined on any finite group and with global rule which is an endomorphism), including surjectivity, injectivity, sensitivity to initial conditions,…