10 citations · 28 across the 6 of their papers we have counts for
Showing 2017 · math.GRShow all
3 papers · 2 filters
math.GR2017★ 8 cited
Group Embeddings with Algorithmic Properties
Arman Darbinyan
We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Mor…
math.GR2017
Groups with decidable word problem that do not embed in groups with decidable conjugacy problem
Arman Darbinyan
We show the existence of finitely presented torsion-free groups with decidable word problem that cannot be embedded in any finitely generated group with decidable conjugacy problem…
math.GR2017★ 4 cited
The word and conjugacy problems in lacunary hyperbolic groups
Arman Darbinyan
We study the word and conjugacy problems in lacunary hyperbolic groups (briefly, LHG). In particular, we describe a necessary and sufficient condition for decidability of the word…