2025/03/03 by Ushakov, Alexander, Weiers, Chloe · 1 citation
#20F10 #20F16 #68W30 #FOS: Mathematics #Group Theory (math.GR)
paper · doi:10.48550/arxiv.2503.01929
In this paper we study the complexity of solving orientable quadratic equations in wreath products A\wr B of finitely generated abelian groups. We give a classification of cases (depending on genus and other characteristics of a given equation) when the problem is computationally hard or feasible.