Related papers: Computing fixed closures in free groups

We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…

We analyse the geometry and complexity of the conjugacy problem in a family of free-by-cyclic groups $H_m=F_m\rtimes\mathbb{Z}$ where the defining free-group automorphism is positive and polynomially growing. We prove that the conjugator…

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an…

We propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…

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…

Let phi and psi be endomorphisms of the projective line of degree at least 2, defined over a noetherian commutative ring R with unity. From a dynamical perspective, a significant question is to determine whether phi and psi are conjugate…

A finite non-abelian group $H$ is hamiltonian if all of its subgroups are normal. We compute the minimal orders of graphs having a hamiltonian group as their automorphism group. The fixing number of a graph $\Gamma$ is the minimum…

The homology groups of the automorphism group of a free group are known to stabilize as the number of generators of the free group goes to infinity, and this paper relativizes this result to a family of groups that can be defined in terms…

Let G be a finitely generated relatively hyperbolic group. We show that if no peripheral subgroup of G is hyperbolic relative to a collection of proper subgroups, then the fixed subgroup of every automorphism of G is relatively quasiconvex.…

For any torsion-free hyperbolic group $\Gamma$ and any group $G$ that is fully residually $\Gamma$, we construct algorithmically a finite collection of homomorphisms from $G$ to groups obtained from $\Gamma$ by extensions of centralizers,…

We present an effective algorithm for detecting automorphic orbits in free groups, as well as a number of algorithmic improvements of train tracks for free group automorphisms.

We prove new separability results about free groups. Namely, if $H_1, \ldots , H_k$ are infinite index, finitely generated subgroups of a non-abelian free group $F$, then there exists a homomorphism onto some alternating group $f:F…

For finitely generated subgroups $H$ of a free group $F_m$ of finite rank $m$, we study the language $L_H$ of reduced words that represent $H$ which is a regular language. Using the (extended) core of Schreier graph of $H$, we construct the…

We establish a decomposition of stable homology of automorphism groups of free groups with polynomial contravariant coefficients in term of functor homology. This allows several explicit computations, intersecting results obtained by…

We consider homogeneous varieties of linear algebras over an associative-commutative ring K with 1, i.e., the varieties in which free algebras are graded. Let F be a free algebra of some variety A of linear algebras over K freely generated…

Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the…

The automorphism group of a finitely generated free group is the normal closure of a single element of order 2. If $m$ is less than $n$ then a homomorphism $Aut(F_n)\to Aut(F_m)$ can have cardinality at most 2. More generally, this is true…

If an automorphism f of a structure M is such that fix(f^k) = fix(f) for all positive k, then M|fix(f) is a substructure of M. The possible isomorphism types of such M|fix(f) are characterized when M is countable and arithmetically…

Given a countable group $G$ splitting as a free product $G=G_1\ast\dots\ast G_k\ast F_N$, we establish classification results for subgroups of the group $Out(G,\mathcal{F})$ of all outer automorphisms of $G$ that preserve the conjugacy…