3 papers
cs.CC2016
The conjugacy problem in free solvable groups and wreath product of abelian groups is in TC
Alexei Miasnikov, Svetla Vassileva, Armin Weiß
We show that the conjugacy problem in a wreath product is uniform--Turing-reducible to the conjugacy problem in the factors and and the power probl…
math.GR2012
The Magnus embedding is a quasi-isometry
Svetla Vassileva
We show that the Magnus embedding, which embeds the free solvable group of rank r and degree d into the wreath product of the free abelian group of rank r with the free solvable gr…
math.GR2010
Polynomial time conjugacy in wreath products and free solvable groups
Svetla Vassileva
We prove that the complexity of the Conjugacy Problems for wreath products and for free solvable groups is decidable in polynomial time. For the wreath product AwrB, we must assume…