Relative order and spectrum in free and related groups

From MaRDI portal
Publication:6186944




Abstract: In this paper, we consider a natural generalization of the concept of order of an element in a group: an element ginG is said to have order k in a subgroup H of G ( esp wrt a coset Hu) if k is the first strictly positive integer such that gkinH ( esp gkinHu). We study this notion and its algorithmic properties in the realm of free groups and some related families. Both positive and negative (algorithmic) results emerge in this setting. On the positive side, among other results, we prove that the order of elements, the set of orders (called spectrum), and the set of preorders (ie the set of elements of a given order) wrt finitely generated subgroups are always computable in free and free times free-abelian groups. On the negative side, we provide examples of groups and subgroups having essentially any subset of natural numbers as relative spectrum; in particular, non-recursive and even non-recursively enumerable sets of natural numbers. Also, we take advantage of Mikhailova's construction to see that the spectrum membership problem is unsolvable for direct products of nonabelian free groups.



Cites work







This page was built for publication: Relative order and spectrum in free and related groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186944)