SearcharxivSearch

arXiv · 2204.04543

Eventually fixed points of endomorphisms of virtually free groups

Abstract

We consider the subgroup of points of finite orbit through the action of an endomorphism of a virtually free group, with particular emphasis on the subgroup of eventually fixed points, EvFix($\varphi$): points whose orbit contains a fixed point. We provide an algorithm to compute the subgroup of fixed points of an endomorphism of a finitely generated virtually free group and prove that finite orbits have cardinality bounded by a computable constant, which allows us to solve several algorithmic problems: deciding if $\varphi$ is a finite order element of End($G$), if $\varphi$ is aperiodic, if EvFix($\varphi$) is finitely generated and, in the free group case, whether EvFix($\varphi$) is a normal subgroup of $F_n$ or not. We also present a bound for the rank of EvFix($\varphi$) in case it is finitely generated.

Explore related subjects

Keep this discovery

BibTeXRIS

André Carvalho. 2022-04-09. Eventually fixed points of endomorphisms of virtually free groups. https://arxiv.org/abs/2204.04543

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