Related papers: The automorphism group of accessible groups

An outer automorphism of a free group is geometric if it can be represented by a homeomorphism of a compact surface. Bestvina and Handel gave an algorithmic characterization of geometric irreducible outer automorphisms using relative train…

We give upper bounds, linear in rank, to the topological dimensions of the Gromov boundaries of the intersection graph, the free factor graph and the cyclic splitting graph of a finitely generated free group.

This article proposes an effective criterion for lifting automorphisms along regular coverings of graphs, with the covering transformation group being any finite abelian group.

For a classical group $G$ of type $\mathsf D_n$ over a field $k$ of characteristic different from $2$, we show the existence of a finitely generated regular extension $R$ of $k$ such that $G$ admits outer automorphisms over $R$. Using this…

When $S$ is a closed, orientable surface with genus $g(S) \geq 2$, we show that the automorphism group of the compression body graph $\mathcal{CB}(S)$ is the mapping class group. Here, vertices are compression bodies with exterior boundary…

We construct new families of groups with property (T) and infinitely many alternating group quotients. One of those consists of subgroups of $\mathrm{Aut}(\mathbf F_{p}[x_1, \dots, x_n])$ generated by a suitable set of tame automorphisms.…

The outer automorphism group Out(G) of a group G acts on the set of conjugacy classes of elements of G. McCool proved that the stabilizer $Mc(c_1,...,c_n)$ of a finite set of conjugacy classes is finitely presented when G is free. More…

We prove that finitely presented residually free groups are subgroup conjugacy separable. Furthermore, if they are of type $FP_\infty$, then they are also subgroup conjugacy distinguished. Using a connection between conjugacy separability…

The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…

We give a condition on the defining graph of a right-angled Artin group which implies its automorphism group is virtually indicable, that is, it has a finite-index subgroup that admits a homomorphism onto $\Z$. We use this as part of a…

For $N\geq 4$, we show that there exist automorphisms of the free group $F_N$ which have a parabolic orbit in $\partial F_N$. In fact, we exhibit a technology for producing infinitely many such examples.

Let $\Aut(G)$ denote the group of (bi-)continuous automorphisms %and $\Out(G)$ the outer automorphism group of a non-Archimedean Polish group~$G$. We show that for any such $G$ with an invariant countable basis of open subgroups, the group…

Bergman has given the following abstract characterisation of the inner automorphisms of a group $G$: they are exactly those automorphisms of $G$ which can be extended functorially along any homomorphism $G \rightarrow H$ to an automorphism…

We prove that the cut space of any transitive graph $G$ is a finitely generated ${\rm Aut}(G)$-module if the same is true for its cycle space. This confirms a conjecture of Diestel which says that every locally finite transitive graph whose…

We obtain a criterion for the automorphism group of an affine toric variety to be connected in combinatorial terms and in terms of the divisor class group of the variety. The component group of the automorphism group of a non-degenerate…

We study the automorphism group of graphons (graph limits). We prove that after an appropriate "standardization" of the graphon, the automorphism group is compact. Furthermore, we characterize the orbits of the automorphism group on…

A group $G$ is said to satisfy the finitely generated intersection property (f.g.i.p.) if the intersection of any two finitely generated subgroups of $G$ is again finitely generated. The aim of this article is to understand when the…

A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…

The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $\Gamma$ we construct an arithmetic subgroup…

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…