Dynamics of Irreducible Endomorphisms of $F_n$

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

v3, 46 pages, corrected gap in decomposition result

Scientific paper

We consider the class non-surjective irreducible endomorphisms of the free group $F_n$. We show that such an endomorphism $\phi$ is topologically represented by a simplicial immersion $f:G \rightarrow G$ of a marked graph $G$; along the way we classify the dynamics of $\partial \phi$ acting on $\partial F_n$: there are at most $2n$ fixed points, all of which are attracting. After imposing a necessary additional hypothesis on $\phi$, we consider the action of $\phi$ on the closure $\bar{CV}_n$ of the Culler-Vogtmann Outer space. We show that $\phi$ acts on $\bar{CV}_n$ with "sink" dynamics: there is a unique fixed point $[T_{\phi}]$, which is attracting; for any compact neighborhood $N$ of $[T_{\phi}]$, there is $K=K(N)$, such that $\bar{CV}_n\phi^{K(N)} \subseteq N$. The proof uses certian projections of trees coming from invariant length measures. These ideas are extended to show how to decompose a tree $T$ in the boundary of Outer space by considering the space of invariant length measures on $T$; this gives a decomposition that generalizes the decomposition of geometric trees coming from Imanishi's theorem.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Dynamics of Irreducible Endomorphisms of $F_n$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dynamics of Irreducible Endomorphisms of $F_n$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamics of Irreducible Endomorphisms of $F_n$ will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-189090

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.