Related papers: Twisted conjugacy in free groups and Makanin's que…

Let $N$ be a finitely generated nilpotent group. Algorithm is constructed such, that for every automorphism $\phi \in Aut(N)$ defines the Reidemeister number $R(\phi).$ It is proved that any free nilpotent group of rank $r = 2$ or $r = 3$…

(Free-abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphisms and having unsolvable conjugacy problem are constructed. Along the way, orbit undecidable, free subgroups of GL_d(Z), for d > 5, and…

Let F_2 denote the free group of rank 2. Our main technical result of independent interest is: for any element u of F_2, there is g in F_2 such that no cyclically reduced image of u under an automorphism of F_2 contains g as a subword. We…

It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in polynomial time even if input words are represented in a compressed…

We generalize the combinatorial approaches of Rapaport and Higgins--Lyndon to the Whitehead algorithm. We show that for every automorphism $\varphi$ of a free group $F$ and every word $u\in F$ there exists a finite multiset of words…

We produce an algorithm that, given $\phi\in Out(F_N)$, where $N\ge 2$, decides wether or not $\phi$ is an iwip ("fully irreducible") automorphism.

Let $A_1,...,A_k$ be a system of free factors of $F_n$. The group of relative automorphisms $Aut(F_n;A_1,...,A_k)$ is the group given by the automorphisms of $F_n$ that restricted to each $A_i$ are conjugations by elements in $F_n$. The…

Equations in free groups have become prominent recently in connection with the solution to the well known Tarski Conjecture. Results of Makanin and Rasborov show that solvability of systems of equations is decidable and there is a method…

Let $\phi:G\to G$ be an automorphism of a group which is a free-product of finitely many groups each of which is freely indecomposable and two of the factors contain proper finite index characteristic subgroups. We show that $G$ has…

We study the conjugacy problem in cyclic extensions of free groups. It is shown that the conjugacy problem is solvable in split extensions of finitely generated free groups by virtually inner automorphisms. An algorithm for construction of…

Let $k$ be an algebraically closed field, $G$ a linear algebraic group over $k$ and $\varphi\in Aut(G)$, the group of all algebraic group automorphisms of $G$. Two elements $x, y$ of $G$ are said to be $\varphi$-twisted conjugate if…

Let u be a cyclic word in a free group F_n of finite rank n that has the minimum length over all cyclic words in its automorphic orbit, and let N(u) be the cardinality of the set {v: |v|=|u| and v= \phi(u) for some \phi \in \text {Aut}F_n}.…

We study the Zariski topology of the ind-groups of polynomial and free associative algebras $\Aut(K[x_1,...,x_n])$ (which is equivalent to the automorphism group of the affine space $\Aut(K^n))$) and $\Aut(K< x_1,..., x_n>$ via…

Let $R(\phi)$ be the number of $\phi$-conjugacy (or Reidemeister) classes of an endomorphism $\phi$ of a group $G$. We prove for several classes of groups (including polycyclic) that the number $R(\phi)$ is equal to the number of fixed…

The work investigates the problem of whether a context-free language is a subset of a group language. A.~V. Anisimov has shown that the problem of determining the unambiguity of finite automata is a special case of this problem. Then the…

We prove that an automorphism $\phi:F\to F$ of a finitely generated free group $F$ is hyperbolic in the sense of Gromov if it has no nontrivial periodic conjugacy classes.

Elements of the free group define interesting maps, known as word maps, on groups. It was previously observed by Lubotzky that every subset of a finite simple group that is closed under endomorphisms occurs as the image of some word map. We…

We develop the theory of fragile words by introducing the concept of eraser morphism and extending the concept to more general contexts such as (free) inverse monoids. We characterize the image of the eraser morphism in the free group case,…

Part 1 : We remark that the conjugacy problem for pairs of hyperbolic au- tomorphisms of a finitely presented group (typically a free group) is decidable. The solution that we propose uses the isomorphism problem for the suspensions, and…

Suppose, $G$ is a residually finite group of finite upper rank admitting an automorphism $\varphi$ with finite Reidemeister number $R(\varphi)$ (the number of $\varphi$-twisted conjugacy classes). We prove that such $G$ is soluble-by-finite…