3
$\begingroup$

Let $G$ be a finite $p$-group of nilpotency class $c$ and of derived length $d$. As is well known, we have $d\leq \lfloor\log_2 c\rfloor+1$,

(https://groupprops.subwiki.org/wiki/Derived_length_is_logarithmically_bounded_by_nilpotency_class).

Does there exist any information or any classification of finite $p$-group $G$, where $d=\lfloor\log_2 c\rfloor+1$?

Any answer or comment will be greatly appreciated!

$\endgroup$
2
  • 1
    $\begingroup$ I don't have any deep thoughts about it, but just an observation that if the class is very large, then the coclass is small and then the derived length is also small. So you won't have equality in this case. $\endgroup$ Mar 22, 2018 at 23:40
  • 1
    $\begingroup$ Another stupid observation any group of class 2 satisfies this condition. Thus, as observed by the answer below, a classification is unlikely. Maybe a more sensible question is to ask for a group of order $p^n$ what is the maximal class for which such equality can still be achieved? $\endgroup$ Mar 23, 2018 at 8:02

1 Answer 1

3
$\begingroup$

My guess is "no", at least as regards a classification. A check with GAP shows that 30,591 of the 34,297 groups of order $5^7$ satisfy this equality; that 7,882 of the 9,310 groups of order $3^7$ satisfy the equality; and that 53,499 of the 56,092 groups of order $2^8$ satisfy the equality.

Here's an easy bit of GAP code to check this:

glist:=AllSmallGroups(Size,5^7,G->DerivedLength(G) = 1 + LogInt( NilpotencyClassOfGroup(G) , 2));; NrSmallGroups(5^7); Length(glist);

Partial information may be attainable, such as constraining various aspects of their character theory, but off-hand I'm not sure. This paper of Glasby's seems to contain all the references needed for the original derivations of the inequality in question (he references [1],[2], and [4] in his bibliography).

$\endgroup$
1
  • $\begingroup$ Dear zibadawa timmy, thank you for your answer. $\endgroup$
    – sebastian
    Mar 25, 2018 at 17:19

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.