Abstract

AbstractWe construct a subgroup Hd of the iterated wreath product Gd of d copies of the cyclic group of order p with the property that the derived length and the smallest cardinality of a generating set of Hd are equal to d while no proper subgroup of Hd has derived length equal to d. It turns out that the two groups Hd and Gd are the extreme cases of a more general construction that produces a chain Hd=K1<···< Kp−1=Gd of subgroups sharing a common recursive structure. For i ∈ {1,. . .,p−1}, the subgroup Ki has nilpotency class (i+1)d−1.

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