Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.
Publication:868743
DOI10.2140/pjm.2006.223.113zbMath1149.20028arXivmath/0303386MaRDI QIDQ868743
Ilya Kapovich, Vladimir Shpilrain, Paul E. Schupp
Publication date: 26 February 2007
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0303386
68W40: Analysis of algorithms
20F05: Generators, relations, and presentations of groups
20E36: Automorphisms of infinite groups
03D15: Complexity of computation (including implicit computational complexity)
57M05: Fundamental group, presentations, free differential calculus
20E05: Free nonabelian groups
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
20P05: Probabilistic methods in group theory
Related Items