Abstract

Let n be an integer greater than 1. A group G is said to be “ n-rewritable” whenever for every n elements x 1,…,x n of G, there exist distinct permutations τ, σ on the set {1,2,…, n} such that x τ(1) ··· x τ(n) = x σ (1) ··· x σ (n). In this article, we complete the classification of 3-rewritable finite nilpotent groups and prove that a finite nilpotent group G is 3-rewritable if and only if G has an abelian subgroup of index 2 or the derived subgroup has order < 6.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call