Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups

作     者：Kapovich, I Schupp, P Shpilrain, V 

作者机构：Univ Illinois Dept Math Urbana IL 61801 USA CUNY City Coll Dept Math New York NY 10031 USA 

出 版 物：《PACIFIC JOURNAL OF MATHEMATICS》 (Pac. J. Math.)

年 卷 期：2006年第223卷第1期

页      面：113-140页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

主　　题：one-relator groups Whitehead algorithm generic-case complexity 

摘      要：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 on an exponentially generic set of input pairs. We then apply these results to one-relator groups. We obtain a Mostow-type isomorphism rigidity result for random one-relator groups: If two such groups are isomorphic then their Cayley graphs on the given generating sets are isometric. Although no nontrivial examples were previously known, we prove that one-relator groups are generically complete groups, that is, they have trivial center and trivial outer automorphism group. We also prove that the stabilizers of generic elements of F-k in Aut(F-k) are cyclic groups generated by inner automorphisms and that Aut(F-k)-orbits are uniformly small in the sense of their growth entropy. We further prove that the number I-k(n) of isomorphism types of k-generator one-relator groups with defining relators of length n satisfies c(1)/n (2k - 1)(n) = I-k(n) = c(2)/n(2k- 1)(n), where c(1), c(2) are positive constants depending on k but not on n. Thus I-k(n) grows in essentially the same manner as the number of cyclic words of length n.