Related papers: Equations in a free Q-group

In the 1980's Stallings showed that every finitely generated subgroup of a free group is canonically represented by a finite minimal immersion of a bouquet of circles. In terms of the theory of automata, this is a minimal finite inverse…

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…

Hans Zassenhaus conjectured that every torsion unit of the integral group ring of a finite group $G$ is conjugate within the rational group algebra to an element of the form $\pm g$ with $g\in G$. This conjecture has been disproved recently…

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…

We design new deterministic and randomized algorithms for computational problems in free solvable groups. In particular, we prove that the word problem and the power problem can be solved in quasi-linear time and the conjugacy problem can…

We consider two algorithmic problems concerning sub-semigroups of Heisenberg groups and, more generally, two-step nilpotent groups. The first problem is Intersection Emptiness, which asks whether a finite number of given finitely generated…

Let $G$ be a non-trivial torsion free group and $s(t)=g_{1}t^{\epsilon_{1}}g_{2}t^{\epsilon_{2}} \cdots g_{n}t^{\epsilon_{n}}=1 \; (g_{i} \in G,\ \epsilon_i=\pm 1)$ be an equation over $G$ containing no blocks of the form…

We examine those matrix rings whose entries lie in periodic rings equipped with some additional properties. Specifically, we prove that the famous Diesl's question whether or not $R$ being nil-clean implies that $\mathbb{M}_n(R)$ is…

Recently V.Drinfeld formulated a number of problems in quantum group theory. In particular, he suggested to consider ``set-theoretical'' solutions of the quantum Yang-Baxter equation, i.e. solutions given by a permutation $R$ of the set…

We carry out a study of groups $G$ in which the index of any infinite subgroup is finite. We call them restricted-finite groups and characterize finitely generated not torsion restricted-finite groups. We show that every infinite…

The construction of torsion-free abelian groups with prescribed endomorphism rings starting with Corner's seminal work is a well-studied subject in the theory of abelian groups. Usually these construction work by adding elements from a…

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

We prove that the rank problem is decidable in the class of torsion-free word-hyperbolic Kleinian groups. We also show that every group in this class has only finitely many Nielsen equivalence classes of generating sets of a given…

We give a solution to Dehn's isomorphism problem for the class of all hyperbolic groups, possibly with torsion. We also prove a relative version for groups with peripheral structures. As a corollary, we give a uniform solution to…

Let $G$ be a word hyperbolic group. We prove that the algebraic $K$-theory groups of $\dbZ [G]$, $K_n(\dbZ[G])$, have finite rank for all $n\in \dbZ$. For a few classes of groups, we give explicit formulas for the ranks of the algebraic…

This paper studies decision problems for semigroups that are word-hyperbolic in the sense of Duncan & Gilman. A fundamental investigation reveals that the natural definition of a `word-hyperbolic structure' has to be strengthened slightly…

In this article we give a sufficient and necessary condition to determine wether or not an element of the free group induces a non-trivial element of the free Burnside group of sufficiently large odd exponent. This criterion can be stated…

This paper is the first in a sequence on the structure of sets of solutions to systems of equations over a free semigroup. To describe the structure, we present a Makanin-Razborov diagram that encodes the set of solutions to such system of…

We obtain sufficient criteria for simplicity of systems, that is, rings $R$ that are equipped with a family of additive subgroups $R_s$, for $s \in S$, where $S$ is a semigroup, satisfying $R = \sum_{s \in S} R_s$ and $R_s R_t \subseteq…

*by a standard (one-tape) Turing machine. It is well-known that the word problem for hyperbolic groups, whence in particular for free groups, can be solved in linear time. However, these algorithms run on machines more complicated than a…