Related papers: Centralisers of Dehn twist automorphisms of free g…

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…

Let $A=A(x_{1},...,x_{n})$ be a free associative algebra in $\mathcal{A}$ freely generated over $K$ by a set $X=\{x_{1},...,x_{n}\}$, $End A$ be the semigroup of endomorphisms of $A$, and $Aut End A$ be the group of automorphisms of the…

We consider an action of the automorphism group $\mathrm{Aut}(F_n)$ of the free group $F_n$ of rank $n$ on the filtered vector space $A_d(n)$ of Jacobi diagrams of degree $d$ on $n$ oriented arcs. This action induces on the associated…

Let $G$ be a group. The central automorphism group $Aut_c(G)$ of $G$ is the centralizer of $Inn(G)$ the subgroup of $Aut(G)$ of inner automorphisms. There is a one to one map $ \sigma \mapsto h_\sigma$ from the set $Aut_c(G)$ onto the set…

In a previous paper we investigated the centraliser dimension of groups. In the current paper we study properties of centraliser dimension for the class of free partially commutative groups and, as a corollary, we obtain an efficient…

We describe the automorphism group of the endomorphism semigroup $\End(K[x_1,...,x_n])$ of ring $K[x_1,...,x_n]$ of polynomials over an {\it arbitrary} field $K$. A similar result is obtained for automorphism group of the category of…

For a finite alphabet $\mathcal{A}$ and shift $X\subseteq\mathcal{A}^{\mathbb{Z}}$ whose factor complexity function grows at most linearly, we study the algebraic properties of the automorphism group ${\rm Aut}(X)$. For such systems, we…

We prove that the automorphism group of an arbitrary non-abelian free group is complete. It generalizes the result by J.Dyer and E.Formanek (1975) stating the completeness of automorphism group of finitely generated free groups. Using the…

The object of this expository work is to try to unveil the topological/geometric intuition behind the theory of free groups and their automorphism and outer automorphism groups. The method we follow is to focus on a series of problems in…

We refine Brink's theorem, that the non-reflection part of a reflection centralizer in a Coxeter group W is a free group. We give an explicit set of generators for centralizer, which is finitely generated when W is. And we give a method for…

Let n be bigger than 1 and let A be an element in the Higman-Thompson group V_n. We study the structure of the centralizer of a in V_n through a careful analysis of the action of the group generated by A on the Cantor set C. We make use of…

Subgroups of direct products of finitely many finitely generated free groups form a natural class that plays an important role in geometric group theory. Its members include fundamental examples, such as the Stallings-Bieri groups. This…

Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to…

For n greater or equal 4 we discuss questions concerning global fixed points for isometric actions of Aut(Fn), the automorphism group of a free group of rank n, on complete CAT(0) spaces. We prove that whenever Aut(Fn) acts by isometries on…

For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…

We calculate the homology of automorphism groups of free groups in various cases. The author would like to thank his thesis advisor Karen Vogtmann.

Let $F_{3}$ be the free group of rank $3$ and let $G_{3} = F_{3}/[F_{3}^{\prime\prime}, F_{3}, F_{3}]$, that is, $G_{3}$ is a free centre-by-centre-by-metabelian group of rank $3$. We show that ${\rm Aut}(G_{3})$ contains a proper finitely…

We study the automorphism group $\operatorname{Aut}(X)$ of a non-trivial strongly irreducible subshift $X$ on an arbitrary infinite group $G$ and generalize classical results of Ryan, Kim and Roush. We generalize Ryan's theorem by showing…

For any choice of a basis $\cal A$ the free group $F_N$ of finite rank $N \geq 2$ can be canonically identified with the set $F(\cal A)$ of reduced words in $\cal A\cup \cal A^{-1}$. However, such a word $w \in F(\cal A)$ admits a second…

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.