加载中…
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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本