Orbit problems for free-abelian times free groups and related families
Group Theory
2025-02-17 v2
Abstract
We prove that the Brinkmann Problems (BrP & BrCP) and the twisted-conjugacy Problem (TCP) are decidable for any endomorphism of a free-abelian times free (FATF) group Fn x Z^m. Furthermore, we prove the decidability of the two-sided Brinkmann conjugacy problem (2BrCP) for monomorphisms of FATF groups (and combine it with TCP) to derive the decidability of the conjugacy problem for ascending HNN extensions of FATF groups.
Keywords
Cite
@article{arxiv.2401.14020,
title = {Orbit problems for free-abelian times free groups and related families},
author = {André Carvalho and Jordi Delgado},
journal= {arXiv preprint arXiv:2401.14020},
year = {2025}
}
Comments
15 pages