Abstract

We construct an extension E(A,G)E(A,G) of a given group GG by infinite non-Archimedean words over an discretely ordered abelian group like ZnZ^n. This yields an effective and uniform method to study various groups that "behave like GG". We show that the Word Problem for f.g. subgroups in the extension is decidable if and only if and only if the Cyclic Membership Problem in GG is decidable. The present paper embeds the partial monoid of infinite words as defined by Myasnikov, Remeslennikov, and Serbin (Contemp. Math., Amer. Math. Soc., 378:37-77, 2005) into E(A,G)E(A,G). Moreover, we define the extension group E(A,G)E(A,G) for arbitrary groups GG and not only for free groups as done in previous work. We show some structural results about the group (existence and type of torsion elements, generation by elements of order 2) and we show that some interesting HNN extensions of GG embed naturally in the larger group E(A,G)E(A,G).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.