On the complexity of epimorphism testing with virtually abelian targets

arXiv:2501.05283 · math.GR, cs.CC · Submitted 2025-01-09 · Read on arXiv

math.GR, cs.CC

Submitted: 2025-01-09

Updated: 2026-10-28

Comments: 27 pages. Sections 7-9 of previous version of this paper split into a separate article arxiv:TBA

License: http://creativecommons.org/licenses/by/4.0/

The gist: Friedl and Löh (2021, Confl.

Terminology

Abstract

Friedl and Löh (2021, Confl. Math.) prove that testing whether or not there is an epimorphism from a finitely presented group to the direct product of an abelian and a finite group, or to a virtually cyclic group, is decidable. Here we prove that these problems are-complete. In addition, we show that testing epimorphism is-complete when the target is is the semi-direct product of a finitely generated free-abelian group and a finite group which factors through plus or minus Id, thus extending the class of virtually abelian target groups for which decidability of epimorphism is known.

Related papers