Fixed subgroups and computation of auto-fixed closures in free-abelian times free groups
Group Theory
2019-06-06 v1
Abstract
The classical result by Dyer--Scott about fixed subgroups of finite order automorphisms of being free factors of is no longer true in . Within this more general context, we prove a relaxed version in the spirit of Bestvina--Handel Theorem: the rank of fixed subgroups of finite order automorphisms is uniformly bounded in terms of . We also study periodic points of endomorphisms of , and give an algorithm to compute auto-fixed closures of finitely generated subgroups of . On the way, we prove the analog of Day's Theorem for real elements in , contributing a modest step into the project of doing so for any right angled Artin group (as McCool did with respect to Whitehead's Theorem in the free context).
Keywords
Cite
@article{arxiv.1906.02144,
title = {Fixed subgroups and computation of auto-fixed closures in free-abelian times free groups},
author = {Mallika Roy and Enric Ventura},
journal= {arXiv preprint arXiv:1906.02144},
year = {2019}
}