Related papers: Automorphic orbits in free groups

We provide an effective algorithm for determining whether an element of the outer automorphism group of a free group is fully irreducible. Our method produces a finite list which can be checked for periodic proper free factors.

We address several specific aspects of the following general question: can a field K have so many automorphisms that the action of the automorphism group on the elements of K has relatively few orbits? We prove that any field which has only…

In this note we give a new proof of the fact that an elementary subgroup (in the sense of first-order theory) of a non abelian free group $\mathbb{F}$ must be a free factor. The proof is based on definability of orbits of elements of under…

Let F_n be a free group of rank n>1. Two elements g, h in F_n are said to be translation equivalent in F_n if the cyclic length of \phi(g) equals the cyclic length of \phi(h) for every automorphism \phi of F_n. Let F(a, b) be the free group…

We study direct products of free-abelian and free groups with special emphasis on algorithmic problems. After giving natural extensions of standard notions into that family, we find an explicit expression for an arbitrary endomorphism of…

We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F. Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

We describe an algorithm that uses Stallings' folding technique to decompose an element of $Aut(F_n)$ as a product of Whitehead automorphisms (and hence as a product of Nielsen transformations.) We use this to give an alternative method of…

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…

Our goal is to find dynamic invariants that completely determine elements of the outer automorphism group $\Out(F_n)$ of the free group $F_n$ of rank $n$. To avoid finite order phenomena, we do this for {\it forward rotationless} elements.…

Let $K$ be a field and $f:\mathbb{P}^N \to \mathbb{P}^N$ a morphism. There is a natural conjugation action on the space of such morphisms by elements of the projective linear group $\text{PGL}_{N+1}$. The group of automorphisms, or…

Let $F_n= F\langle x_1,...,x_n\rangle$ denote the free group of rank $n\ge 2$ and let $\mathrm{End}(F_n)$ be the endomorphism monoid of $F_n$. We show that automorphisms of $F_n$ are detected via the $\mathrm{End}(F_n)$-action on the first…

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…

A cylinder $C^1_u$ is the set of infinite words with fixed prefix $u$. A double-cylinder $C^2_{[1,u]}$ is "the same" for bi-infinite words. We show that for every word $u$ and any automorphism $\varphi$ of the free group $F$ the image…

In this paper we discuss several heuristic strategies which allow one to solve the Whitehead's minimization problem much faster (on most inputs) than the classical Whitehead algorithm. The mere fact that these strategies work in practice…

Let $G$ be a finitely generated group with an automorphism $\varphi\in{\rm Aut}(G)$, or an outer automorphism $\phi\in{\rm Out}(G)$. Suppose that $G$ decomposes into simpler pieces on which the growth behaviour of $\varphi$ and $\phi$ is…

This is a survey of recent progress in several areas of combinatorial algebra. We consider combinatorial problems about free groups, polynomial algebras, free associative and Lie algebras. Our main idea is to study automorphisms and, more…

We produce an algorithm that, given $\phi\in Out(F_N)$, where $N\ge 2$, decides wether or not $\phi$ is an iwip ("fully irreducible") automorphism.

We give a description of elementary subgroups (in the sense of first-order logic) of finitely generated virtually free groups. In particular, we recover the fact that elementary subgroups of finitely generated free groups are free factors.…

We study the loxodromic elements for the action of $Out(F_n)$ on the free splitting complex of the rank $n$ free group $F_n$. We prove that each outer automorphism is either loxodromic, or has bounded orbits without any periodic point, or…