Fixed subgroups and computation of auto-fixed closures in free-abelian times free groups
Cita com:
hdl:2117/184934
Tipus de documentArticle
Data publicació2020-04-01
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
The classical result by Dyer–Scott about fixed subgroups of finite order automor-phisms of Fnbeing free factors of Fn is no longer true inZm×Fn. Within this more generalcontext, 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 m, n. We also studyperiodic points of endomorphisms of Zm×Fn, and give an algorithm to compute auto-fixed closures of finitely generated subgroups of Zm×Fn. On the way, we prove the analog of Day’sTheorem for real elements in Zm×Fn, contributing a modest step into the project of doing sofor any right angled Artin group (as McCool did with respect to Whitehead’s Theorem in the free context).
CitacióRoy, M.; Ventura, E. Fixed subgroups and computation of auto-fixed closures in free-abelian times free groups. "Journal of pure and applied algebra", 1 Abril 2020, vol. 224, núm. 4, p. 106210: 1-106210: 19.
ISSN0022-4049
Versió de l'editorhttps://www.sciencedirect.com/science/article/pii/S0022404919302178
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
arxiv.pdf | FIXED SUBGROUPS AND COMPUTATION OF AUTO-FIXED CLOSURES IN FREE-ABELIAN TIMES FREE GROUPS | 321,6Kb | Visualitza/Obre |