Related papers: Growth of intersection numbers for free group auto…

We present the construction of some kind of "convex core" for the product of two actions of a group on $\bbR$-trees. This geometric construction allows to generalize and unify the intersection number of two curves or of two measured…

Let $T$ be an $\mathbb{R}$-tree, equipped with a very small action of the rank $n$ free group $F_n$, and let $H \leq F_n$ be finitely generated. We consider the case where the action $F_n \curvearrowright T$ is indecomposable--this is a…

Given a free group $F_k$ of rank $k\ge 2$ with a fixed set of free generators we associate to any homomorphism $\phi$ from $F_k$ to a group $G$ with a left-invariant semi-norm a generic stretching factor, $\lambda(\phi)$, which is a…

We prove that a "random" free group outer automorphism is an ageometric fully irreducible outer automorphism whose ideal Whitehead graph is a union of triangles. In particular, we show that its attracting (and repelling) tree is a…

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…

By using a notion of a geometric Dehn twist in $\sharp_k(S^2 \times S^1)$, we prove that when projections of two $\mathbb{Z}$-splittings to the free factor complex are far enough from each other in the free factor complex, Dehn twist…

This paper, which is the last of a series of three papers, studies dynamical properties of elements of $\mathrm{Out}(F_{\tt n})$, the outer automorphism group of a nonabelian free group $F_{\tt n}$. We prove that, for every subgroup $H$ of…

We give a classification of iwip outer automorphisms of the free group, by discussing the properties of their attracting and repelling trees.

We compute explicitly the automorphism and outer automorphism group of all large-type free-of-infinity Artin groups. Our strategy involves reconstructing the associated Deligne complexes in a purely algebraic manner, i.e. in a way that is…

Let $G$ be the mapping torus of a polynomially growing automorphism of a finitely generated free group. We determine which epimorphisms from $G$ to $\mathbb{Z}$ have finitely generated kernel, and we compute the rank of the kernel. We thus…

The expansion $G^+$ of a graph $G$ is the 3-uniform hypergraph obtained from $G$ by enlarging each edge of $G$ with a vertex disjoint from $V(G)$ such that distinct edges are enlarged by distinct vertices. Let ex$_r(n,F)$ denote the maximum…

In this paper, we study the orbit intersection problem for the linear space and the algebraic group in positive characteristic. Let $K$ be an algebraically closed field of positive characteristic and let $\Phi_1, \Phi_{2}: K^d…

We continue the study of token sliding reconfiguration graphs of independent sets initiated by the authors in an earlier paper (arXiv:2203.16861). Two of the topics in that paper were to study which graphs $G$ are token sliding graphs and…

Let $F_N$ be a free group of rank $N\ge 2$, let $\mu$ be a geodesic current on $F_N$ and let $T$ be an $\mathbb R$-tree with a very small isometric action of $F_N$. We prove that the geometric intersection number $<T, \mu>$ is equal to zero…

We show that the horoboundary of outer space for the Lipschitz metric is a quotient of Culler and Morgan's classical boundary, two trees being identified whenever their translation length functions are homothetic in restriction to the set…

Let $\mathcal{F}$ be a family of graphs. A graph $G$ is called \textit{$\mathcal{F}$-free} if for any $F\in \mathcal{F}$, there is no subgraph of $G$ isomorphic to $F$. Given a graph $T$ and a family of graphs $\mathcal{F}$, the generalized…

Let $\varphi:V\times V\to W$ be a bilinear map of finite vector spaces $V$ and $W$ over a finite field $\mathbb{F}_q$. We present asymptotic bounds on the number of isomorphism classes of bilinear maps under the natural action of…

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…

In the 1970s Stallings showed that one could learn a great deal about free groups and their automorphisms by viewing the free groups as fundamental groups of graphs and modeling their automorphisms as homotopy equivalences of graphs.…

For graphs F and G an F-matching in G is a subgraph of G consisting of pairwise vertex disjoint copies of F. The number of F-matchings in G is denoted by s(F,G). We show that for every fixed positive integer m and every fixed tree F, the…