Genericity, the Arzhantseva-Ol'shanskii method and the Isomorphism Problem for One-Relator Groups
Abstract
We apply the method of Arzhantseva-Ol'shanskii to prove that for an exponentially generic (in the sense of Ol'shanskii) class of one-relator groups the isomorphism problem is solvable in at most exponential time. This is obtained as a corollary of our more general result that for any fixed integers there is an exponentially generic class of -generator -relator groups where every group has only one Nielsen equivalence class of -tuples generating non-free subgroups. This means that a group in this class has has only one non-free -generated subgroup, namely itself. Hence for any homomorphism for an -generated group to the image of this homomorphism is either free or is equal to . Applied to injective homomorphisms from to itself this implies that is co-Hopfian. Moreover, every automorphism of is "freely induced", that is, it lifts to an automorphism of the free group . All of these results are obtained by folding methods without using the theory of JSJ-decomposition or the R-tree techniques deployed by Zlil Sela in his famous solution of the isomorphism problem for torsion-free word-hyperbolic groups.
Cite
@article{arxiv.math/0210307,
title = {Genericity, the Arzhantseva-Ol'shanskii method and the Isomorphism Problem for One-Relator Groups},
author = {Ilya Kapovich and Paul Schupp},
journal= {arXiv preprint arXiv:math/0210307},
year = {2007}
}
Comments
17 pages, 1 figure