Related papers: Algorithmic decidability of Engel's property for a…
We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…
The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton…
Let G be a linear group such that for every g in G there is a finite set R(g) with the property that for every x in G all sufficiently long commutators [g,x,x,...,x] belong to R(g). It is proved that G is finite-by-hypercentral.
We consider whether given a simple, finite description of a group in the form of an algorithm, it is possible to algorithmically determine if the corresponding group has some specified property or not. When there is such an algorithm, we…
An element $g$ of a group $G$ is said to be right Engel if for every $x\in G$ there is a number $n=n(g,x)$ such that $[g,{}_{n}x]=1$. We prove that if a profinite group $G$ admits a coprime automorphism $\varphi$ of prime order such that…
For a finite group $G,$ we investigate the direct graph $\Gamma(G),$ whose vertices are the non-hypercentral elements of $G$ and where there is an edge $x\mapsto y$ if and only if $[x,_ny]=1$ for some $n \in \mathbb N.$ We prove that…
A (left) Engel sink of an element g of a group G is a subset containing all sufficiently long commutators [...[[x,g],g],...,g], where x ranges over G. We prove that if p is a prime and G a finite group in which, for some positive integer m,…
Given a finite group $G$, the Engel graph of $G$ is a directed graph $\Gamma(G)$ encoding pairs of elements satisfying some Engel word. Namely, $\Gamma(G)$ is the directed graph, where the vertices are the non-hypercentral elements of $G$…
We make a connection between the subgroup membership and identity problems for matrix groups and extended finite automata. We provide an alternative proof for the decidability of the subgroup membership problem for $ 2 \times 2 $ integer…
Suppose that a finite group $G$ admits a soluble group of coprime automorphisms $A$. We prove that if, for some positive integer $m$, every element of the centralizer $C_G(A )$ has a left Engel sink of cardinality at most $m$ (or a right…
The main result of the paper is the following theorem. Let $q$ be a prime, $n$ a positive integer and $A$ an elementary abelian group of order $q^2$. Suppose that $A$ acts coprimely on a finite group $G$ and assume that for each $a\in…
Given a unitary representation of a finite group on a finite-dimensional Hilbert space, we show how to find a state whose translates under the group are distinguishable with the highest probability. We apply this to several quantum oracle…
We complete the study of finite and profinite groups admitting an action by an elementary abelian group under which the centralizers of automorphisms consist of Engel elements. In particular, we prove the following theorems. Let $q$ be a…
A right Engel sink of an element $g$ of a group $G$ is a subset containing all sufficiently long commutators $[...[[g,x],x],\dots ,x]$. We prove that if $G$ is a compact group in which, for some $k$, every commutator $[...[g_1,g_2],\dots…
Let x be an element of a group G. For a positive integer n let E_n(x) be the subgroup generated by all commutators [...[[y,x],x],...,x] over y in G, where x is repeated n times. There are several recent results showing that certain…
We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy…
Following Plotkin we say that the automorphism $x$ of the group $G$ is a nil-automorphism if, for every $g\in G$, there exists $n=n(g)$ such that $[g,_n x]=1$. If the integer $n$ can be chosen independently of $g$, then $x$ is said to be…
Using a result of Kari and Ollinger, we prove that the torsion problem for elements of the Brin-Thompson group 2V is undecidable. As a result, we show that there does not exist an algorithm to determine whether an element of the rational…
We are lifting classical problems from single instances to regular sets of instances. The task of finding a positive instance of the combinatorial problem $P$ in a potentially infinite given regular set is equivalent to the so called…
The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…