Related papers: Translation equivalent elements in free groups

For any finite collection $f_i$ of fully irreducible automorphisms of the free group $F_n$ we construct a connected $\delta$-hyperbolic $Out(F_n)$-complex in which each $f_i$ has positive translation length.

We study the automorphisms \phi of a finitely generated free group F. Building on the train-track technology of Bestvina, Feighn and Handel, we provide a topological representative f:G\to G of a power of \phi that behaves very much like the…

We consider a minimal action of a finitely generated semigroup by homeomorphisms of a circle, and show that the collection of translation numbers of individual elements completely determines the set of generators (up to a common continuous…

Let $F$ be a finitely generated free group, and let $H\le F$ be a finitely generated subgroup. An equation for an element $g\in F$ with coefficients in $H$ is an element $w(x)\in H*\langle x \rangle$ such that $w(g)=1$ in $F$; the degree of…

We prove that all elements of infinite order in $Out(F_n)$ have positive translation lengths; moreover, they are bounded away from zero. Consequences include a new proof that solvable subgroups of $Out(F_n)$ are finitely generated and…

Inspired by Pansiot's work on substitutions, we prove a similar theorem for automorphisms of a free group F of finite rank: if a right-infinite word X represents an attracting fixed point of an automorphism of F, the subword complexity of X…

Let u be a cyclic word in a free group F_n of finite rank n that has the minimum length over all cyclic words in its automorphic orbit, and let N(u) be the cardinality of the set {v: |v|=|u| and v= \phi(u) for some \phi \in \text {Aut}F_n}.…

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…

Let $w$ be a word in the free group of rank $n \in \mathbb{N}$ and let $\mathcal{V}(w)$ be the variety of groups defined by the law $w=1$. Define $\mathcal{V}(w^*)$ to be the class of all groups $G$ in which for any infinite subsets $X_1,…

Let $FH$ be a Frobenius group with kernel $F$ and complement $H$, acting coprimely on the finite solvable group $G$ by automorphisms. We prove that if $C_{G}(H)$ is of Fitting length $n$ then the index of the $n$-th Fitting subgroup…

Let $F$ be a free group of finite rank. We say that the monomorphism problem in $F$ is decidable if for any two elements $u$ and $v$ in $F$, there is an algorithm that determines whether there exists a monomorphism of $F$ that sends $u$ to…

We investigate the fundamental group of Griffiths' space, and the first singular homology group of this space and of the Hawaiian Earring by using (countable) reduced tame words. We prove that two such words represent the same element in…

Given a finitely generated subgroup $H$ of a free group $F$, we present an algorithm which computes $g_1,\ldots,g_m\in F$, such that the set of elements $g\in F$, for which there exists a non-trivial $H$-equation having $g$ as a solution,…

Let $G$ be a finitely generated group, and let $\Sigma$ be a finite subset that generates $G$ as a monoid. The \emph{word problem of $G$ with respect to $\Sigma$} consists of all words in the free monoid $\Sigma^{\ast}$ that are equal to…

Let $G = H\times A$ be a group, where $H$ is a purely non-abelian subgroup of $G$ and $A$ is a non-trivial abelian factor of $G$. Then, for $n \geq 2$, we show that there exists an isomorphism $\phi : Aut_{Z(G)}^{\gamma_{n}(G)}(G)…

If F is a free group of finite rank at least two then any group of the form F by Z is large. In this short note we show how this statement follows by combining a very recent theorem of Hagen and Wise (using work of Agol and of Wise) with…

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…

Let G be a complex affine algebraic reductive group, and let K be a maximal compact subgroup of G. Fix elements h_1,...,h_m in K. For n greater than or equal to 0, let X (respectively, Y) be the space of equivalence classes of…

We will show that every element of a finitely generated abelian group is automorphically equivalent what we will define to be a {\em representative element} in a {\em repeat-free subgroup}, and for finite abelian groups we can count the…

We discuss the following question of G. Makanin from ``Kourovka notebook'': does there exist an algorithm to determine is for an arbitrary pair of words $U$ and $V$ of a free group $F_n$ and an arbitrary automorphism $\phi \in Aut(F_n)$ the…