Abstract
For any finitely generated group , two complexity functions and are defined to measure the maximal possible gap between the norm of an automorphism (respectively outer automorphism) of and the norm of its inverse. Restricting attention to free groups , the exact asymptotic behaviour of and is computed. For rank , polynomial lower bounds are provided for and , and the existence of a polynomial upper bound is proved for .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.