We present a solution to the conjugacy problem in the group of outer automorphisms of $F_3$, a free group of rank 3. We distinguish according to several computable invariants, such as irreducibility, subgroups of polynomial growth and subgroups carrying the attracting lamination. We establish, by considerations on train tracks, that the conjugacy problem is decidable for the outer automorphisms of $F_3$ that preserve a given rank 2 free factor. Then we establish, by consideration on mapping tori, that it is decidable for outer automorphisms of $F_3$ whose maximal polynomial growth subgroups are cyclic. This covers all the cases left by the state of the art.

We prove that virtually free groups are precisely the hyperbolic groups admitting a language of geodesic words containing a unique representative for each group element with bounded triangles. Equivalently, these are exactly the hyperbolic groups for which the model for the Gromov boundary defined by Silva is well defined.

Let $H\le F$ be two finitely generated free groups. Given $g\in F$, we study the ideal $\mathfrak I_g$ of equations for g with coefficients in H, i.e. the elements $w(x)\in H*\langle x\rangle$ such that $w(g)=1$ in F. The ideal $\mathfrak I_g$ is a normal subgroup of $H*\langle x\rangle$, and it’s possible to algorithmically compute a finite normal generating set for $\mathfrak I_g$; we give a description of one such algorithm, based on Stallings folding operations. We provide an algorithm to find an equation in w(x)\in$\mathfrak I_g$ with minimum degree, i.e.  such that its cyclic reduction contains the minimum possible number of occurrences of x and x−1; this answers a question of A. Rosenmann and E. Ventura. More generally, we show how to algorithmically compute the set Dg of all integers d such that $\mathfrak I_g$ contains equations of degree d; we show that Dg coincides, up to a finite set, with either $\mathbb N$ or $2\mathbb N$. Finally, we provide examples to illustrate the techniques introduced in this paper. We discuss the case where ${\text{rank}}(H)=1$. We prove that both kinds of sets Dg can actually occur. We show that the equations of minimum possible degree aren’t in general enough to generate the whole ideal $\mathfrak I_g$ as a normal subgroup.

To any free group automorphism, we associate a universal (cone of) limit tree(s) with three defining properties: first, the tree has a minimal isometric action of the free group with trivial arc stabilizers; second, there is a unique expanding dilation of the tree that represents the free group automorphism; and finally, the loxodromic elements are exactly the elements that weakly limit to dominating attracting laminations under forward iteration by the automorphism. So the action on the tree detects the automorphism’s dominating exponential dynamics.

As a corollary, our previously constructed limit pretree that detects the exponential dynamics is canonical. We also characterize all very small trees that admit an expanding homothety representing a given automorphism. In the appendix, we prove a variation of Feighn–Handel’s recognition theorem for atoroidal outer automorphisms.

In this note we investigate the centraliser of a linearly growing element of $\mathrm{Out}(F_n)$ (that is, a root of a Dehn twist automorphism), and show that it has a finite index subgroup mapping onto a direct product of certain “equivariant McCool groups” with kernel a finitely generated free abelian group. In particular, this allows us to show it is VF and hence finitely presented.

We prove that centralisers of elements in [finitely generated free]-by-cyclic groups are computable. As a corollary, given two conjugate elements in a [finitely generated free]-by-cyclic group, the set of conjugators can be computed and the conjugacy problem with context-free constraints is decidable. We pose several problems arising naturally from this work.

To any free group automorphism, we associate a real pretree with several nice properties. First, it has a rigid/non-nesting action of the free group with trivial arc stabilizers. Secondly, there is an expanding pretree-automorphism of the real pretree that represents the free group automorphism. Finally and crucially, the loxodromic elements are exactly those whose (conjugacy class) length grows exponentially under iteration of the automorphism; thus, the action on the real pretree is able to detect the growth type of an element.

This construction extends the theory of metric trees that has been used to study free group automorphisms. The new idea is that one can equivariantly blow up an isometric action on a real tree with respect to other real trees and get a rigid action on a treelike structure known as a real pretree. Topology plays no role in this construction as all the work is done in the language of pretrees (intervals).

We prove that, given a finitely generated subgroup H of a free group F, the following questions are decidable: is H closed (dense) in F for the pro-(met)abelian topology? Is the closure of H in F for the pro-(met)abelian topology finitely generated? We show also that if the latter question has a positive answer, then we can effectively construct a basis for the closure, and the closure has decidable membership problem in any case. Moreover, it is decidable whether H is closed for the pro-$\mathbf {V}$ topology when $\mathbf {V}$ is an equational pseudovariety of finite groups, such as the pseudovariety $\mathbf {S}_k$ of all finite solvable groups with derived length $\leq k$. We also connect the pro-abelian topology with the topologies defined by abelian groups of bounded exponent.

In this paper, we study intersection configurations – which describe the behaviour of multiple (finite) intersections of subgroups with respect to finite generability – in the realm of free and free times free-abelian (FTFA) groups. We say that a configuration is realizable in a group $G$ if there exist subgroups $H_1,\ldots, H_k \leqslant G$ realizing it. It is well known that free groups ${\mathbb {F}_{n}}$ satisfy the Howson property: the intersection of any two finitely generated subgroups is again finitely generated. We show that the Howson property is indeed the only obstruction for multiple intersection configurations to be realizable within nonabelian free groups. On the contrary, FTFA groups ${\mathbb {F}_{n}} \times \mathbb {Z}^m$ are well known to be non-Howson. We also study multiple intersections within FTFA groups, providing an algorithm to decide, given $k\geq 2$ finitely generated subgroups, whether their intersection is again finitely generated and, in the affirmative case, compute a ‘basis’ for it. We finally prove that any intersection configuration is realizable in an FTFA group ${\mathbb {F}_{n}} \times \mathbb {Z}^m$, for $n\geq 2$ and large enough $m$. As a consequence, we exhibit finitely presented groups where every intersection configuration is realizable.

Let G be a group that is either virtually soluble or virtually free, and let ω be a weight on G. We prove that if G is infinite, then there is some maximal left ideal of finite codimension in the Beurling algebra $\ell^1(G, \omega)$, which fails to be (algebraically) finitely generated. This implies that a conjecture of Dales and Żelazko holds for these Banach algebras. We then go on to give examples of weighted groups for which this property fails in a strong way. For instance, we describe a Beurling algebra on an infinite group in which every closed left ideal of finite codimension is finitely generated and which has many such ideals in the sense of being residually finite dimensional. These examples seem to be hard cases for proving Dales and Żelazko’s conjecture.

Let D be a division ring and N be a subnormal subgroup of the multiplicative group $D^*$. We show that if N contains a nonabelian solvable subgroup, then N contains a nonabelian free subgroup.

Given a finitely generated free group $ {\mathbb {F} }$ of $\mathsf {rank}( {\mathbb {F} } )\geq 3$, we show that the mapping torus of $\phi$ is (strongly) relatively hyperbolic if $\phi$ is exponentially growing. As a corollary of our work, we give a new proof of Brinkmann's theorem which proves that the mapping torus of an atoroidal outer automorphism is hyperbolic. We also give a new proof of the Bridson–Groves theorem that the mapping torus of a free group automorphism satisfies the quadratic isoperimetric inequality. Our work also solves a problem posed by Minasyan and Osin: the mapping torus of an outer automorphism is not virtually acylindrically hyperbolic if and only if $\phi$ has finite order.

We obtain conditions of uniform continuity for endomorphisms of free-abelian times free groups for the product metric defined by taking the prefix metric in each component and establish an equivalence between uniform continuity for this metric and the preservation of a coarse-median, a concept recently introduced by Fioravanti. Considering the extension of an endomorphism to the completion, we count the number of orbits for the action of the subgroup of fixed points (respectively periodic) points on the set of infinite fixed (respectively periodic) points. Finally, we study the dynamics of infinite points: for automorphisms and some endomorphisms, defined in a precise way, fitting a classification given by Delgado and Ventura, we prove that every infinite point is either periodic or wandering, which implies that the dynamics is asymptotically periodic.

In this paper we consider two piecewise Riemannian metrics defined on the Culler–Vogtmann outer space which we call the entropy metric and the pressure metric. As a result of work of McMullen, these metrics can be seen as analogs of the Weil–Petersson metric on the Teichmüller space of a closed surface. We show that while the geometric analysis of these metrics is similar to that of the Weil–Petersson metric, from the point of view of geometric group theory, these metrics behave very differently than the Weil–Petersson metric. Specifically, we show that when the rank r is at least 4, the action of $\operatorname {\mathrm {Out}}(\mathbb {F}_r)$ on the completion of the Culler–Vogtmann outer space using the entropy metric has a fixed point. A similar statement also holds for the pressure metric.

Leighton’s graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton’s theorem that allows generalisations; we prove the corresponding result for graphs with fins. As a corollary we obtain pattern rigidity for free groups with line patterns, building on the work of Cashen–Macura and Hagen–Touikan. To illustrate the potential for future applications, we give a quasi-isometric rigidity result for a family of cyclic doubles of free groups.

We show that in general for a given group the structure of a maximal hyperbolic tower over a free group is not canonical: we construct examples of groups having hyperbolic tower structures over free subgroups which have arbitrarily large ratios between their ranks. These groups have the same first order theory as non-abelian free groups and we use them to study the weight of types in this theory.

This note contains a (short) proof of the following generalisation of the Friedman–Mineyev theorem (earlier known as the Hanna Neumann conjecture): if $A$ and $B$ are nontrivial free subgroups of a virtually free group containing a free subgroup of index $n$, then $\text{rank}(A\cap B)-1\leq n\cdot (\text{rank}(A)-1)\cdot (\text{rank}(B)-1)$. In addition, we obtain a virtually-free-product analogue of this result.

We classify all possible JSJ decompositions of doubles of free groups of rank two, and we also compute the Makanin–Razborov diagram of a particular double of a free group and deduce that in general limit groups are not freely subgroup separable.

We present the results of computer experiments suggesting that the probability that a random multiword in a free group is virtually geometric decays to zero exponentially quickly in the length of the multiword. We also prove this fact.

Given a cardinal $\lambda $ with $\lambda =\lambda ^{\aleph _0}$, we show that there is a field of cardinality $\lambda $ whose automorphism group is a free group of rank $2^\lambda $. In the proof of this statement, we develop general techniques that enable us to realize certain groups as the automorphism group of structures of a given cardinality. They allow us to show that analogues of this result hold for free objects in various varieties of groups. For example, the free abelian group of rank $2^\lambda $ is the automorphism group of a field of cardinality $\lambda $ whenever $\lambda $ is a cardinal with $\lambda =\lambda ^{\aleph _0}$. Moreover, we apply these techniques to show that consistently the assumption that $\lambda =\lambda ^{\aleph _0}$ is not necessary for the existence of a field of cardinality $\lambda $ whose automorphism group is a free group of rank $2^\lambda $. Finally, we use them to prove that the existence of a cardinal $\lambda $ of uncountable cofinality with the property that there is no field of cardinality $\lambda $ whose automorphism group is a free group of rank greater than $\lambda $ implies the existence of large cardinals in certain inner models of set theory.