SearcharxivSearch

arXiv · 2307.13875

On the dynamics of endomorphisms of the direct product of two free groups

Abstract

We prove that Brinkmann's problems are decidable for endomorphisms of $F_n\times F_m$: given $(x,y),(z,w)\in F_n\times F_m$ and $\Phi\in \text{End}(F_n\times F_m)$, it is decidable whether there is some $k\in \mathbb{N}$ such that $(x,y)\Phi^k=(z,w)$ (or $(x,y)\Phi^k\sim(z,w)$). We also prove decidability of a two-sided version of Brinkmann's conjugacy problem for injective endomorphisms which, from the work of Logan, yields a solution to the conjugacy problem in ascending HNN-extensions of $F_n\times F_m$. Finally, we study the dynamics of automorphisms of $F_n\times F_m$ at the infinity, proving that that their dynamics at the infinity is asymptotically periodic, as occurs in the free and free-abelian times free cases.

Explore related subjects

Keep this discovery

BibTeXRIS

André Carvalho. 2023-07-26. On the dynamics of endomorphisms of the direct product of two free groups. https://arxiv.org/abs/2307.13875

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR