A combinatorial summation identity over the lattice of labelled hypertrees is established that allows one to gain concrete information on the Euler characteristics of various automorphism groups of free products of groups.
In analogy with the free factors of a free group we define special factors of Generalized Baumslag-Solitar (GBS) groups as non-cyclic subgroups which appear in splittings over infinite cyclic groups. We give an algorithm which, given a GBS group $G$ and an element $g \in G$, decides whether there exists a special factor $H < G$ such that $g \in H$. This algorithm is analogous to an algorithm by Whitehead for free groups. Furthermore we prove that given $g \in G$ there exists a unique minimal special factor containing $g$ and give an algorithm which finds it.
We provide an example in each rank of an ageometric fully irreducible outer automorphism whose ideal Whitehead graph has a cut vertex. Consequently, we show that there exist examples in each rank of Handel-Mosher axis bundles that are not just a single axis, as well as of "nongeneric" behavior in the sense of the "train track directed" random walk of Kapovich-Pfaff. The tools developed here also allow one to construct a whole new array of ideal Whitehead graphs achieved by ageometric fully irreducible outer automorphisms in all ranks.
H. Masur and J. Smillie proved precisely which singularity index lists arise from pseudo-Anosov mapping classes. In search of an analogous theorem for outer automorphisms of free groups, Handel and Mosher ask: Is each connected, simplicial, (2r-1)-vertex graph the ideal Whitehead graph of a fully irreducible outer automorphism in Out(F_r)? We answer this question in the negative by exhibiting, for each r, examples of connected (2r-1)-vertex graphs that are not the ideal Whitehead graph of any fully irreducible outer automorphism in Out(F_r)? In the course of our proof we also develop machinery…
We solve the Whitehead problem for automorphisms, monomorphisms and endomorphisms in $\ZZ^m \times F_n$ after giving an explicit description of each of these families of transformations.
The main theorem of this document emulates, in the context of Out(F_r) theory, a mapping class group theorem (by H. Masur and J. Smillie) that determines precisely which index lists arise from pseudo-Anosov mapping classes. Since the ideal Whitehead graph gives a finer invariant in the analogous setting of a fully irreducible outer automorphism, we instead focus on determining which of the 21 connected, loop-free, 5-vertex graphs are ideal Whitehead graphs of ageometric, fully irreducible outer automorphisms of the free group of rank 3. Our main theorem accomplishes this by showing that there …
J.H.C. Whitehead's second free-group algorithm determines whether or not two given elements of a free group lie in the same orbit of the automorphism group of the free group. The algorithm involves certain connected graphs, and Whitehead used three-manifold models to prove their connectedness; later, Rapaport and Higgins & Lyndon gave group-theoretic proofs. Combined work of Gersten, Stallings, and Hoare showed that the three-manifold models may be viewed as graphs. We give the direct translation of Whitehead's topological argument into the language of graph theory.
The object of this expository work is to try to unveil the topological/geometric intuition behind the theory of free groups and their automorphism and outer automorphism groups. The method we follow is to focus on a series of problems in the study of free groups, and use the solutions of those problems to motivate topological/geometric tools. We do not aim to write down proofs which minimize the number of alphanumeric characters. We instead strive to write down proofs which maximize the development of broadly applicable geometric tools. In Part I we study problems solved by Nielsen and Whitehe…
We prove that a "random" free group outer automorphism is an ageometric fully irreducible outer automorphism whose ideal Whitehead graph is a union of triangles. In particular, we show that its attracting (and repelling) tree is a nongeometric $\mathbb R$-tree all of whose branch points are trivalent
The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case complexity (i.e., the expected runtime) of algorithms that solve a well-known problem, the Whitehead problem in a free group, which is: given two elements of a free group, find out whether there is an automorphism that takes one element to the other. First we address a special case of the Whitehead problem, namely deciding if a given element of a free group is…
We describe an algorithm that uses Stallings' folding technique to decompose an element of $Aut(F_n)$ as a product of Whitehead automorphisms (and hence as a product of Nielsen transformations.) We use this to give an alternative method of finding a finite generating set for the subgroup of $Aut(F_n)$ that fixes a subset $Y$ of the basis elements, and the subgroup that fixes each element of $Y$ up to conjugacy. We show that the intersection of this latter subgroup with $IA_n$ is also finitely generated.
Let $ϕ$ be an atoroidal outer automorphism of the free group $F_n$. We study the Gromov boundary of the hyperbolic group $G_ϕ = F_n \rtimes_ϕ \mathbb{Z}$. We explicitly describe a family of embeddings of the complete bipartite graph $K_{3,3}$ into $\partial G_ϕ$. To do so, we define the directional Whitehead graph and prove that an indecomposable $F_n$-tree is Levitt type if and only if one of its directional Whitehead graphs contains more than one edge. As an application, we obtain a direct proof of Kapovich-Kleiner's theorem that $\partial G_ϕ$ is homeomorphic to the Menger curve if the auto…
We describe the endomorphisms of the direct product of two free groups of finite rank and obtain conditions for which the subgroup of fixed points is finitely generated and we do the same for periodic points. We also describe the automorphisms of such a group and solve the three Whitehead problems for automorphisms, monomorphisms and endomorphisms for groups in this class. We also obtain conditions for an endomorphism to be uniformly continuous when a suitable metric is considered and study infinite fixed points of the extension to the completion of the group.
We define and discuss a notion called fibered commensurability of outer automorphisms of free groups. This notion lets us study symmetry of outer automorphisms. The notion of fibered commensurability is first defined by Calegari-Sun-Wang on mapping class groups. The Nielsen-Thurston type of mapping classes is a commensurability invariant. One of the important facts of fibered commensurability on mapping class groups is for the case of pseudo-Anosovs, there is a unique minimal element in each fibered commensurability class. For outer automorphisms, we first show that being atoroidal and fully i…
The classical result by Dyer--Scott about fixed subgroups of finite order automorphisms of $F_n$ being free factors of $F_n$ is no longer true in $Z^m\times F_n$. Within this more general context, we prove a relaxed version in the spirit of Bestvina--Handel Theorem: the rank of fixed subgroups of finite order automorphisms is uniformly bounded in terms of $m,n$. We also study periodic points of endomorphisms of $Z^m\times F_n$, and give an algorithm to compute auto-fixed closures of finitely generated subgroups of $Z^m\times F_n$. On the way, we prove the analog of Day's Theorem for real eleme…
We solve Dehn's isomorphism problem for virtually torsion-free relatively hyperbolic groups with nilpotent parabolic subgroups. We do so by reducing the isomorphism problem to three algorithmic problems in the parabolic subgroups, namely the isomorphism problem, separation of torsion (in their outer automorphism groups) by congruences, and the mixed Whitehead problem, an automorphism group orbit problem. The first step of the reduction is to compute canonical JSJ decompositions. Dehn fillings and the given solutions of the algorithmic problems in the parabolic groups are then used to decide if…
The ellipticity graph of a free group $F$ was defined by I. Kapovich and M. Lustig in order to study the outer automorphism group of $F$, which acts on this graph. The graph was constructed to be analogous to the curve complex of a surface. It is a bipartite graph, whose vertices are conjugacy classes of nontrivial elements of $F$ and equivalence classes of proper free product decompositions of the form $F=A*B$. A conjugacy class is joined by an edge to a free product decomposition $A*B$ whenever the conjugacy class has a representative in either $A$ or $B$. This paper uses Stallings subgroup …
Let $G$ be a finitely generated polyfree group. If $G$ has nonzero Euler characteristic then we show that $Aut(G)$ has a finite index subgroup in which every automorphism has infinite Reidemeister number. For certain $G$ of length 2, we show that the number of Reidemeister classes of every automorphism is infinite.
Let $X$ be a smooth manifold belonging to one of these three collections: acyclic manifolds (compact or not, possibly with boundary), compact connected manifolds (possibly with boundary) with nonzero Euler characteristic, integral homology spheres. We prove that $Diff(X)$ is Jordan. This means that there exists a constant $C$ such that any finite subgroup $G$ of $Diff(X)$ has an abelian subgroup whose index in $G$ is at most $C$. Using a result of Randall and Petrie we deduce that the automorphism groups of connected, non necessarily compact, smooth real affine varieties with nonzero Euler cha…
In this note we study the problem of characterizing the complex affine space $\mathbb{A}^n$ via its automorphism group. We prove the following. Let $X$ be an irreducible quasi-projective $n$-dimensional variety such that $\mathrm{Aut}(X)$ and $\mathrm{Aut}(\mathbb{A}^n)$ are isomorphic as abstract groups. If $X$ is either quasi-affine and toric or $X$ is smooth with Euler characteristic $χ(X) \neq 0$ and finite Picard group $\mathrm{Pic}(X)$, then $X$ is isomorphic to $\mathbb{A}^n$. The main ingredient is the following result. Let $X$ be a smooth irreducible quasi-projective variety of dimens…
The pro-isomorphic zeta function of a torsion-free finitely generated nilpotent group G enumerates finite index subgroups H such that H and G have isomorphic profinite completions. It admits an Euler product decomposition, indexed by the rational primes. We manufacture the first example of a torsion-free finitely generated nilpotent group G such that the local Euler factors of its pro-isomorphic zeta function do not satisfy functional equations. The group G has nilpotency class 4 and Hirsch length 25. It is obtained, via the Malcev correspondence, from a Z-Lie lattice L with a suitable algebra…
The pro-isomorphic zeta function of a finitely generated nilpotent group $Γ$ is a Dirichlet generating function that enumerates finite-index subgroups whose profinite completion is isomorphic to that of $Γ$. Such zeta functions can be expressed as Euler products of $p$-adic integrals over the $p$-adic points of an algebraic automorphism group associated to $Γ$. In this way they are closely related to classical zeta functions of algebraic groups over local fields. We describe the algebraic automorphism groups for a natural family of class-$2$ nilpotent groups; these groups can be viewed as gene…
Let $H$ be a torsion-free $δ$-hyperbolic group with respect to a finite generating set $S$. Let $a_1,..., a_n$ and $a_{1*},..., a_{n*}$ be elements of $H$ such that $a_{i*}$ is conjugate to $a_i$ for each $i=1,..., n$. Then, there is a uniform conjugator if and only if $W(a_{1*},..., a_{n*})$ is conjugate to $W(a_1,..., a_n)$ for every word $W$ in $n$ variables and length up to a computable constant depending only on $δ$, $\sharp{S}$ and $\sum_{i=1}^n |a_i|$. As a corollary, we deduce that there exists a computable constant $\mathcal{C}=\mathcal{C}(δ, \sharp S)$ such that, for any endomorphism…
Let $w$ be a word in the free group on $r$ generators. The expected value of the trace of the word in $r$ independent Haar elements of $\mathrm{O}(n)$ gives a function ${\cal T}r_{w}^{\mathrm{O}}(n)$ of $n$. We show that ${\cal T}r_{w}^{\mathrm{O}}(n)$ has a convergent Laurent expansion at $n=\infty$ involving maps on surfaces and $L^{2}$-Euler characteristics of mapping class groups associated to these maps. This can be compared to known, by now classical, results for the GUE and GOE ensembles, and is similar to previous results concerning $\mathrm{U}\left(n\right)$, yet with some surprising …