For any finitely generated group G, two complexity functions alpha(G) and beta(G) are defined to measure the maximal possible gap between the norm of an automorphism (respectively, outer automorphism) of G and the norm of its inverse. Restricting attention to free groups F-r, the exact asymptotic behaviour of alpha(2) and beta(2) is computed. For rank r >= 3, polynomial lower bounds are provided for alpha(r) and beta(r), and the existence of a polynomial upper bound is proved for beta(r)
We prove that for any transitive subshift X with word complexity function cn(X), if lim inf(log(cn(X...
We prove that for any transitive subshift X with word complexity function cn(X), if lim inf(log(cn(X...
We prove that for any transitive subshift X with word complexity function cn(X), if lim inf(log(cn(X...
The final publication is available at Springer via http://dx.doi.org/10.1007/s13348-015-0133-3.For a...
For any finitely generated group G, two complexity functions alpha(G) and beta(G) are defined to mea...
maximal possible gap between the norm of an automorphism (respectively outer automorphism) of $ F_r$...
We reintroduce the function alpha_G (and beta_G) that measures the gap between an (outer) automorphi...
We reintroduce the function alpha_G (and beta_G) that measures the gap between an (outer) automorphi...
ABSTRACT. In this paper we show that the groups of automorphisms and outer automorphisms of a finite...
13 pages. This paper was originally part of arXiv:1002.0972. Minor corrections from v2, numberings a...
Let F_n denote the free group of rank n with free basis X. The palindromic automorphism group PiA_n ...
International audienceThere exist infinite, finitely presented, torsion-free groups G such that Aut(...
Let F_n denote the free group of rank n with free basis X. The palindromic automorphism group PiA_n ...
AbstractLet Fn be the free group of a finite rank n. We study orbits Orbφ(u), where u is an element ...
We prove that the mapping torus of a polynomially growing automorphism of finitely generated free gr...
We prove that for any transitive subshift X with word complexity function cn(X), if lim inf(log(cn(X...
We prove that for any transitive subshift X with word complexity function cn(X), if lim inf(log(cn(X...
We prove that for any transitive subshift X with word complexity function cn(X), if lim inf(log(cn(X...
The final publication is available at Springer via http://dx.doi.org/10.1007/s13348-015-0133-3.For a...
For any finitely generated group G, two complexity functions alpha(G) and beta(G) are defined to mea...
maximal possible gap between the norm of an automorphism (respectively outer automorphism) of $ F_r$...
We reintroduce the function alpha_G (and beta_G) that measures the gap between an (outer) automorphi...
We reintroduce the function alpha_G (and beta_G) that measures the gap between an (outer) automorphi...
ABSTRACT. In this paper we show that the groups of automorphisms and outer automorphisms of a finite...
13 pages. This paper was originally part of arXiv:1002.0972. Minor corrections from v2, numberings a...
Let F_n denote the free group of rank n with free basis X. The palindromic automorphism group PiA_n ...
International audienceThere exist infinite, finitely presented, torsion-free groups G such that Aut(...
Let F_n denote the free group of rank n with free basis X. The palindromic automorphism group PiA_n ...
AbstractLet Fn be the free group of a finite rank n. We study orbits Orbφ(u), where u is an element ...
We prove that the mapping torus of a polynomially growing automorphism of finitely generated free gr...
We prove that for any transitive subshift X with word complexity function cn(X), if lim inf(log(cn(X...
We prove that for any transitive subshift X with word complexity function cn(X), if lim inf(log(cn(X...
We prove that for any transitive subshift X with word complexity function cn(X), if lim inf(log(cn(X...