Related papers: Decidability problems in automaton semigroups
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…
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…
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…
This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…
Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this paper, we seek to extend these techniques to finitely presented non-free groups, with a particular emphasis…
Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…
Denote by (R,.) the multiplicative semigroup of an associative algebra R over an infinite field, and let (R,*) represent R when viewed as a semigroup via the circle operation x*y=x+y+xy. In this paper we characterize the existence of an…
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…
We describe an algorithm that computes the index of a finitely generated subgroup in a finitely $L$-presented group provided that this index is finite. This algorithm shows that the subgroup membership problem for finite index subgroups in…
We study the computational complexity of deciding whether a given set of term equalities and inequalities has a solution in an $\omega$-categorical algebra $\mathfrak{A}$. There are $\omega$-categorical groups where this problem is…
We show that conjugacy of reversible cellular automata is undecidable, whether the conjugacy is to be performed by another reversible cellular automaton or by a general homeomorphism. This gives rise to a new family of finitely-generated…
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…
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…
The decision problems on matrices were intensively studied for many decades as matrix products play an essential role in the representation of various computational processes. However, many computational problems for matrix semigroups are…
Elder, Kambites, and Ostheimer showed that if the word problem of a finitely generated group $H$ is accepted by a $G$-automaton for an abelian group $G$, then $H$ is virtually abelian. We give a new, elementary, and purely combinatorial…
Building on the previous extensive study of Yang, Gould and the present author, we provide a more precise insight into the group-theoretical ramifications of the word problem for free idempotent generated semigroups over finite biordered…
Let $\Gamma$ be the first Grigorchuk group. According to a result of Bartholdi, the only left Engel elements of $\Gamma$ are the involutions. This implies that the set of left Engel elements of $\Gamma$ is not a subgroup. Of particular…
This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup $(G,+)$ of rationals, two main questions are addressed: first, what are the model-theoretic…
The question of computing the group complexity of finite semigroups and automata was first posed in K. Krohn and J. Rhodes, \textit{Complexity of finite semigroups}, Annals of Mathematics (2) \textbf{88} (1968), 128--160, motivated by the…
We devise an algorithm which, given a bounded automaton A, decides whether the group generated by A is finite. The solution comes from a description of the infinite sequences having an infinite A-orbit using a deterministic finite-state…