8 citations · 12 across the 2 of their papers we have counts for
2 papers
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★ 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…