相关论文: A McCool Whitehead type theorem for finitely gener…

The proof of the Tits alternative for $Out(F_n)$ is completed. The main tool is a Kolchin type theorem, proved in this paper. It states that a finitely generated subgroup of $Out(F_n)$ consisting of unipotent automorphisms can be conjugated…

This is the fourth and last in a series of four papers (with research announcement posted on this arXiv) that develop a decomposition theory for subgroups of $\text{Out}(F_n)$. In this paper we develop general ping-pong techniques for the…

For a finitely generated free group F_n, of rank at least 2, any finite subgroup of Out(F_n) can be realized as a group of automorphisms of a graph with fundamental group F_n. This result, known as Out(F_n) realization, was proved by…

This is the second in a series of four papers (with research announcement posted on this arXiv) that together develop a decomposition theory for subgroups of Out(F_n). In this paper we relativize the "Kolchin-type theorem" from the work of…

We give a short proof of a theorem of Handel and Mosher stating that any finitely generated subgroup of $\text{Out}(F_N)$ either contains a fully irreducible automorphism, or virtually fixes the conjugacy class of a proper free factor of…

In \cite{KSS06} it was shown that with respect to the simple non-backtracking random walk on the free group $F_N=F(a_1,\dots,a_N)$ the Whitehead algorithm has strongly linear time generic-case complexity and that "generic" elements of $F_N$…

We use Gersten's generalization of Whitehead's algorithm to determine whether a given finitely generated subgroup of a free group $F$ is elliptic in an elementary cyclic splitting of $F$. We provide a similar result for all elementary…

This is the introduction to a series of four papers that develop a decomposition theory for subgroups of Out(F_n) which generalizes the theory for elements of Out(F_n) found in the work of Bestvina, Feighn, and Handel on the Tits…

Using L\"uck's Chern character isomorphism we obtain a general formula in terms of centralisers for the $p$-adic Farrell--Tate $K$-theory of any discrete group $G$ with a finite classifying space for proper actions. We apply this formula to…

We show that for any subgroup $H$ of Out($F_N$), either $H$ contains an atoroidal element or a finite index subgroup $H'$ of $H$ fixes a nontrivial conjugacy class in $F_N$. This result is an analog of Ivanov's subgroup theorem for mapping…

We develop a version of $\mathrm{G}$-theory for an $\mathbb{F}_1$-algebra (i.e., the $\mathrm{K}$-theory of pointed $G$-sets for a pointed monoid $G$) and establish its first properties. We construct a Cartan assembly map to compare the…

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…

Let $G$ be a finite group, $N$ a nilpotent normal subgroup of $G$ and let $\mathrm{V}(\mathbb{\Z} G, N)$ denote the group formed by the units of the integral group ring $\mathbb{\Z} G$ of $G$ which map to the identity under the natural…

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 obtain quantitative versions of the Balog-Szemeredi-Gowers and Freiman theorems in the model case of a finite field geometry F_2^n, improving the previously known bounds in such theorems. For instance, if A is a subset of F_2^n such that…

For any right-angled Artin group $A_{\Gamma}$, Charney--Stambaugh--Vogtmann showed that the subgroup $U^0(A_{\Gamma}) \leq\text{Out}(A_{\Gamma})$ generated by Whitehead automorphisms and inversions acts properly and cocompactly on a…

The Farrell-Jones Fibered Isomorphism Conjecture for the stable topological pseudoisotopy theory has been proved for several classes of groups. For example for discrete subgroups of Lie groups, virtually poly-infinite cyclic groups, Artin…

We prove that Whitehead's algorithm for solving the automorphism problem in a fixed free group $F_k$ has strongly linear time generic-case complexity. This is done by showing that the ``hard'' part of the algorithm terminates in linear time…

We prove that Thompson's group $F$ has a subgroup $H$ such that the conjugacy problem in $H$ is undecidable and the membership problem in $H$ is easily decidable. The subgroup $H$ of $F$ is a closed subgroup of $F$. That is, every function…

We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…