English
Related papers

Related papers: Limit trees for free group automorphisms: universa…

200 papers

We prove that an outer automorphism of the free group is exponentially growing if and only if it induces an outer automorphism of infinite order of free Burnside groups with sufficiently large odd exponent.

Group Theory · Mathematics 2017-06-14 Rémi Coulon , Arnaud Hilion

We show that, if $H$ is a random subgroup of a finitely generated free group $F_k$, only inner automorphisms of $F_k$ may leave $H$ invariant. A similar result holds for random subgroups of toral relatively hyperbolic groups, more generally…

Group Theory · Mathematics 2019-06-26 Vincent Guirardel , Gilbert Levitt

In this paper we define a quantity called the rank of an outer automorphism of a free group which is the same as the index introduced in [D. Gaboriau, A. Jaeger, G. Levitt and M. Lustig, `An index for counting fixed points for automorphisms…

Group Theory · Mathematics 2014-10-01 Armando Martino

We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.

Combinatorics · Mathematics 2008-12-31 Alexander Dainiak

We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations. Using this, we characterize automorphism groups of…

Combinatorics · Mathematics 2015-08-05 Pavel Klavík , Peter Zeman

Let $\mathcal{A} = {A_1, ..., A_k}$ be a system of free factors of $F_n$. The group of relative automorphisms $\mathrm{Aut}(F_n; \mathcal{A})$ is the group given by the automorphisms of $F_n$ that restricted to each $A_i$ are conjugations…

Geometric Topology · Mathematics 2011-12-02 Erika Meucci

We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the…

Discrete Mathematics · Computer Science 2014-10-24 Abbas Mehrabian

We study those fully irreducible outer automorphisms phi of a finite rank free group F_r which are ``parageometric'', meaning that the attracting fixed point of phi in the boundary of outer space is a geometric R-tree with respect to the…

Group Theory · Mathematics 2007-05-23 Michael Handel , Lee Mosher

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

Combinatorics · Mathematics 2025-05-16 J. Pascal Gollin , Jay Lilian Kneip

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

This is the second part of a series of three articles which introduce laminations for free groups (see math.GR/0609416 for the first part). Several definition of the dual lamination of a very small action of a free group on an $\R$-tree are…

Group Theory · Mathematics 2014-02-26 Thierry Coulbois , Arnaud Hilion , Martin Lustig

We present three examples of countable homogeneous structures (also called Fraisse limits) whose automorphism groups are not universal, namely, fail to contain isomorphic copies of all automorphism groups of their substructures. Our first…

Group Theory · Mathematics 2021-08-25 W. Kubis , S. Shelah

A group is boundedly simple if, for some constant N, every nontrivial conjugacy class generates the whole group in N steps. For a large class of trees, Tits proved simplicity of a canonical subgroup of the automorphism group, which is…

Group Theory · Mathematics 2012-06-29 Jakub Gismatullin

We investigate the profinite completions of a certain family of groups acting on trees. It turns out that for some of the groups considered, the completions coincide with the closures of the groups in the full group of tree automorphisms.…

Group Theory · Mathematics 2007-05-23 Ekaterina Pervova

Consider an infinite tree. A hierarchomorphism (spheromorphism) is a homeomorphism of the absolute which can be extended to the tree except a finite subtree. Examples of groups of hierarchomorphisms: groups of locally analitic…

Representation Theory · Mathematics 2013-01-16 Yurii A. Neretin

We give a simple proof of the finite presentation of Sela's limit groups by using free actions on $\bbR^n$-trees. We first prove that Sela's limit groups do have a free action on an $\bbR^n$-tree. We then prove that a finitely generated…

Digital Libraries · Computer Science 2007-05-23 Vincent Guirardel

For a finitely generated free group F_n, of rank at least 2, any finite subgroup of Out(F_n) can be realized as a group of automorphisms of a graph with fundamental group F_n. This result, known as Out(F_n) realization, was proved by…

Group Theory · Mathematics 2007-05-23 Matt Clay

We give a complete criterion for when two hyperbolic automorphisms of a tree generate a free, discrete subgroup. The decision depends only on three geometric invariants: the translation lengths of the generators and the length of overlap of…

Group Theory · Mathematics 2025-12-02 Yukun Du , Sa'ar Hersonsky

Using the canonical JSJ splitting, we describe the outer automorphism group $\Out(G)$ of a one-ended word hyperbolic group $G$. In particular, we discuss to what extent $\Out(G)$ is virtually a direct product of mapping class groups and a…

Group Theory · Mathematics 2007-05-23 Gilbert Levitt

We define and give explicit construction of the universal tree-graded space with a given collection of pieces. We apply that to proving uniqueness of asymptotic cones of relatively hyperbolic groups whose peripheral subgroups have unique…

Group Theory · Mathematics 2011-03-22 Denis Osin , Mark Sapir
‹ Prev 1 3 4 5 6 7 10 Next ›