Related papers: Automorphic orbits in free groups: recent progress
It is shown that the big free group (the set of countably-long words over a countable alphabet) is almost free, in the sense that any function from the alphabet to a compact topological group factors through a homomorphism. This statement…
We show that a finitely generated subgroup of a free group, chosen uniformly at random, is strictly Whitehead minimal with overwhelming probability. Whitehead minimality is one of the key elements of the solution of the orbit problem in…
This is a survey of the recent work in algorithmic and asymptotic properties of groups. I discuss Dehn functions of groups, complexity of the word problem, Higman embeddings, and constructions of finitely presented groups with extreme…
We prove that there is an algorithm to determine whether a tuple of elements in a toral relatively hyperbolic group G is in the automorphic orbit of the other tuple.
We present sufficient conditions for the triviality of the automorphism group of regular Toeplitz subshifts and give a broad class of examples from the class of $\mathcal{B}$-free subshifts satisfying them, extending [10]. On the other hand…
We realize the Apollonian group associated to an integral Apollonian circle packings, and some of its generalizations, as a group of automorphisms of an algebraic surface. Borrowing some results in the theory of orbit counting, we study the…
The Whitehead Model of free groups can be used to measure the complexity, or degree, of automorphisms of free groups. The bound for the degree of the $f \circ g$ for deg$(f) =$ deg($g) = 0$ had previously been discovered. We extend this…
A word in a group is called a test element if any endomorphism fixing it is necessarily an automorphism. In this note, we give a sufficient condition in geometry to construct test elements for monomorphisms of a free group, by using the…
We study endomorphisms of a free group of finite rank by means of their action on specific sets of elements. In particular, we prove that every endomorphism of the free group of rank 2 which preserves an automorphic orbit (i.e., acts ``like…
The special linear groups, the mapping class groups of surfaces, the outer autormorphism groups of free groups appear in numerous domains. Their analogies, developped in particular in K. Vogtmann's work, have been written about a lot. In…
We give an algorithm for finding the index of a positive outer automorphism of the free group, and prove the algorithm exits in a finite time.
The goal of this paper is to introduce a new tool, called {\em long turns}, which is a useful addition to the train track technology for automorphisms of free groups, in that it allows one to control periodic INPs in a train track map and…
In this paper, we initiate the study of palindromic automorphisms of groups that are free in some variety. More specifically, we define palindromic automorphisms of free nilpotent groups and show that the set of such automorphisms is a…
We establish new results and introduce new methods in the theory of measurable orbit equivalence, using bounded cohomology of group representations. Our rigidity statements hold for a wide (uncountable) class of groups arising from negative…
We study finite subgroups of outer automorphisms of free products. We give upper bounds for the orders of these finite subgroups as well as bounds for the orders of individual torsion outer automorphisms under some (necessary) conditions…
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…
We describe, up to degree equal to the rank, the Lie algebra associated with the automorphism group of a free group. We compute in particular the ranks of its homogeneous components, and their structure as modules over the linear group.…
In this survey, we address the worst-case, average-case, and generic-case time complexity of the word problem and some other algorithmic problems in several classes of groups and show that it is often the case that the average-case…
We are concerned with orderable groups and particularly those with orderings invariant not only under multiplication, but also under a given automorphism or family of automorphisms. Several applications to topology are given: we prove that…
The automorphism group of a one dimensional shift space over a finite alphabet exhibits different types of behavior: for a large class with positive entropy, it contains a rich collection of subgroups, while for many shifts of zero entropy,…