English
Related papers

Related papers: Dual automorphisms of free groups

200 papers

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…

Group Theory · Mathematics 2014-06-27 Richard D. Wade

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 AutF_n}. In this…

Group Theory · Mathematics 2011-05-03 Donghi Lee

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…

Group Theory · Mathematics 2011-05-03 Donghi Lee

Suppose that a finite $p$-group $P$ admits a Frobenius group of automorphisms $FH$ with kernel $F$ that is a cyclic $p$-group and with complement $H$. It is proved that if the fixed-point subgroup $C_P(H)$ of the complement is nilpotent of…

Group Theory · Mathematics 2014-09-22 E. I. Khukhro , N. Yu. Makarenko

Let $A_1,...,A_k$ be a system of free factors of $F_n$. The group of relative automorphisms $Aut(F_n;A_1,...,A_k)$ is the group given by the automorphisms of $F_n$ that restricted to each $A_i$ are conjugations by elements in $F_n$. The…

Geometric Topology · Mathematics 2011-04-21 Erika Meucci

We generalize Wagoner's representation of the automorphism group of a two-sided subshifts of finite type as the fundamental group of a certain CW-complex to groupoids having a certain refinement structure. This significantly streamlines the…

Dynamical Systems · Mathematics 2019-11-15 Jeremias Epperlein

We prove that any isometry of the graph of cyclic splittings of a finitely generated free group $F_N$ of rank $N\ge 3$ is induced by an outer automorphism of $F_N$. The same statement also applies to the graphs of maximally-cyclic…

Group Theory · Mathematics 2015-02-11 Camille Horbez , Richard D. Wade

A {\sl parabolic cylinder} is an invariant, non-recurrent Fatou component $\Omega$ of an automorphism $F$ of $\mathbb C^2$ satisfying: (1) The closure of the $\omega$-limit set of $F$ on $\Omega$ contains an isolated fixed point, (2) there…

Dynamical Systems · Mathematics 2020-02-20 Luka Boc Thaler , Filippo Bracci , Han Peters

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…

Geometric Topology · Mathematics 2025-02-04 Emre Yüksel

Let F_2 be a free group of rank 2. We prove that there is an algorithm that decides whether or not, for given two elements u, v of F_2, u and v are translation equivalent in F_2, that is, whether or not u and v have the property that the…

Group Theory · Mathematics 2011-05-03 Donghi Lee

Elements of the free group define interesting maps, known as word maps, on groups. It was previously observed by Lubotzky that every subset of a finite simple group that is closed under endomorphisms occurs as the image of some word map. We…

Group Theory · Mathematics 2019-01-04 William Cocke , Meng-Che "Turbo" Ho

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…

Group Theory · Mathematics 2007-05-23 Valerij Bardakov , Leonid Bokut , Andrei Vesnin

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…

Dynamical Systems · Mathematics 2014-03-04 Van Cyr , Bryna Kra

We prove that the automorphism group of every infinitely-ended finitely generated group is acylindrically hyperbolic. In particular $\mathrm{Aut}(\mathbb{F}_n)$ is acylindrically hyperbolic for every $n\ge 2$. More generally, if $G$ is a…

Group Theory · Mathematics 2021-09-17 Anthony Genevois , Camille Horbez

The main result of this paper is that the outer automorphism group of a free product of finite groups and cyclic groups is semistable at infinity (provided it is one ended) or semistable at each end. In a previous paper, we showed that the…

Group Theory · Mathematics 2025-03-10 Rylee Alanza Lyman

Let $\phi \in \mbox{Out}(F_n)$ be a free group outer automorphism that can be represented by an expanding, irreducible train-track map. The automorphism $\phi$ determines a free-by-cyclic group $\Gamma=F_n \rtimes_\phi \mathbb Z,$ and a…

Geometric Topology · Mathematics 2014-03-04 Yael Algom-Kfir , Eriko Hironaka , Kasra Rafi

Let $\psi$ be a permutation of a finite set $X$. We define $\lambda(\psi)$ to be the largest fraction of elements of $X$ lying on a single cycle of $\psi$. For a finite group $G$, we define $\lambda(G)$ to be the maximum among the values…

Group Theory · Mathematics 2015-04-01 Alexander Bors

The configuration space $\mathcal{C}^n(X)$ of an algebraic curve $X$ is the algebraic variety consisting of all $n$-point subsets $Q\subset X$. We describe the automorphisms of $\mathcal{C}^n(\mathbb{C})$, deduce that the (infinite…

Algebraic Geometry · Mathematics 2015-06-16 Vladimir Lin , Mikhail Zaidenberg

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…

Group Theory · Mathematics 2009-10-06 Enric Ventura

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…

Number Theory · Mathematics 2016-04-12 Joao Alberto de Faria , Benjamin Hutz