On the class-breadth conjecture for p-groups

arXiv:2606.13423 · math.GR · Submitted 2026-06-11 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: We're looking at the paper: "On the class-breadth conjecture for p-groups".

Title and authors: Ada: So we're looking at this paper called "On the class-breadth conjecture for p-groups". It’s tackling that question about whether the nilpotency class of a p-group is bounded by its breadth plus one, especially for primes greater than two.

Emmy: Right, it's building on some older work where counterexamples were found for the prime two case, and this paper is focused squarely on proving it holds true for all other primes.

Ada: Exactly. The main thing they do is introduce a condition involving semidirect products of p-groups G and P. They state that if a certain structure holds in that setup, then the nilpotency class of the whole product group, clG(P), is bounded by the breadth of G plus one.

Kolya: So it’s not just about checking individual groups anymore; it involves looking at how different p-groups interact when you combine them via a semidirect product. What does this mean for the practical application, Ada?

Ada: It means they've developed a theorem that gives us a structural way to control the nilpotency class of these larger groups by looking at the properties of their components. They define breadth b(G) as the maximum log p of G over all elements x in G, which is essentially measuring how much the centralizer shrinks when you look at an element.

Emmy: From my perspective, this paper really dives into the algebraic geometry side of it. They use these concepts like lower central series terms and maximal subgroups to show a deep relationship between the structure of a group and its nilpotency class, which is always related to how many times you have to take commutators until you hit the identity.

Ada: The paper lays out two main conditions that must be met for this theorem to apply. One condition deals with the case where a subgroup Q has a non-cyclic factor group, and it requires checking the nilpotency class of certain subgroups derived from maximal subgroups Q1 and Q2 within Q.

Kolya: That second condition seems more direct, when the factor group is cyclic, it just says that the nilpotency class of the subgroup generated by G and a part of P has to be less than or equal to its breadth. Is that a strong enough constraint for real-world groups?

Title and authors: Ada: It's a structural constraint within this specific framework, Kolya. If P/gamma G one Q is cyclic, then they require that the nilpotency class of the subgroup generated by G and Q has to be bounded by the breadth of Q. This suggests a tighter control when things are structured in a simpler way.

Emmy: And I see how that relates to how we can decompose these complex groups into smaller, more manageable pieces where we can track the nilpotency step by step using induction on the size of the product group G and P, which they describe in detail on page three <ref:2606.13423#pg1>.

Ada: That induction is key because it allows them to handle both cases: when things are cyclic and when they aren't. When things aren't cyclic, they look at the relationship between certain subgroups P three and P four, suggesting that their breadth values stabilize for those specific groups, which helps bound the nilpotency class of P.

Kolya: So if you take a group with a complicated structure where no simple pattern emerges in those intermediate steps, this paper suggests we can still pin down the nilpotency class using the maximal subgroups. What's the actual result for someone just looking at their own p-group?

Ada: The result is that for any p-group G and P combined as a semidirect product, if you satisfy those two conditions, then clG(P) is at most bG(P) plus one. That's the core statement of this paper.

Emmy: It’s a concrete bound derived from the definition of breadth using the centralizer size, which is a very fundamental measurement in group theory that connects structure directly to complexity.

Ada: Before we wrap up, let's talk about what they suggest for future work or related ideas. The paper hints at weakened versions of this conjecture, like Corollary four which applies to an abelian normal subgroup H instead of the whole semidirect product G and P.

Kolya: That sounds like a useful step because it simplifies the structure we're analyzing by looking at a normal subgroup H within G. Does that simplification help us get closer to the general case?

Title and authors: Ada: It does, Kolya. Corollary four states that for any p-group G and its normal abelian subgroup H, the nilpotency class of H in G is bounded by the breadth of G plus one. This is a much more focused statement than the main theorem because it restricts what kind of subgroup we are looking at.

Emmy: It suggests that even when you embed an abelian structure within a larger p-group, its nilpotency class still respects this breadth bound, which is a nice structural property to have in our understanding of these objects.

Ada: So, to wrap up on "On the class-breadth conjecture for p-groups," the paper provides a strong result for prime numbers greater than two by establishing that under specific structural conditions related to semidirect products, the nilpotency class is controlled by the breadth plus one.

Kolya: I just want to add that while they prove this for p > two under these conditions, it’s still open for p=two which is where we already saw counterexamples <ref:2606.13423#pg1>. So this paper fills a specific gap in our knowledge about the general case, but it doesn't solve the entire problem at once.

Ada: Exactly. The paper offers tools and theorems that allow us to predict these classes based on structure, which is what we need when dealing with very large groups where direct computation isn't feasible. That’s how we can start to understand the behavior of these complex p-groups better.

Emmy: It seems like a solid piece of work because it rigorously connects the definition of breadth—that log p of the index related to centralizers—to the nilpotency class in a way that is highly dependent on group structure.

Ada: We've talked about how they handle the main theorem, and how Corollary four gives us a result for normal abelian subgroups, and we've noted that it specifically addresses primes greater than two. It’s important to remember that these results are contingent on those structural conditions being met in the semidirect product setup.

Kolya: I agree. The caveat is always there, and the paper makes it very clear where its scope ends, which is a good thing for setting expectations about what we can expect from this line of research.

Ada: So that's our rundown on "On the class-breadth conjecture for p-groups." It’s a technical piece, but it gives us better bounds when we look at specific group constructions involving semidirect products. We’ll be looking at more papers next week.

The paper's summary: Ada: So we're looking at this paper called "On the class-breadth conjecture for p-groups," and basically, it’s about figuring out if you can always find a simple size limit for the nilpotency class of a p-group based on its breadth.

Emmy: Right. They tackle that idea that the nilpotency class—which is how many times you have to take commutators before you get nothing new—is bounded by this thing called breadth plus one, and they focus specifically on prime numbers greater than two, since it already failed for the number two case.

Ada: Exactly. The big takeaway is that they’ve built a theorem for semidirect products of p-groups G and P, showing that if you meet certain conditions about how those subgroups interact—specifically involving whether factor groups are cyclic or not—then the nilpotency class of the whole structure stays under control by the breadth of G plus one.

Emmy: It’s a structural proof, you know. They use induction on the size of that semidirect product, and they break it down into cases based on whether P has a cyclic part or not, which lets them handle all the different group shapes in one go.

Ada: And they show that even when things get complicated with non-cyclic parts, by looking at certain intermediate subgroups P three and P four—where the breadth values stabilize—they can prove that the whole thing stays bounded by that initial breadth plus one. That’s a pretty tight control over how complex these groups can be.

Emmy: It means they’ve found a way to use those structural properties, like looking at maximal subgroups Q one and Q two inside another subgroup Q, to determine if the nilpotency class is manageable. It ties the geometric structure of the group directly into that numerical measure of breadth.

Ada: The real implication here is that for these larger groups built from smaller p-groups, you don't have to calculate every single element’s nilpotency step by step; you just need to check those two conditions on the pieces G and P. It gives us a reliable way to predict the behavior of these groups based on their construction, which is super useful for when the groups get massive.

Emmy: And they also look at a weaker version, this corollary about normal abelian subgroups H, showing that even just an abelian subgroup inside a p-group has its nilpotency class bounded by the breadth of the whole p-group plus one. That’s a simpler statement to work with when you're analyzing embeddings.

Ada: It’s about finding those specific structural levers—like those conditions on Q one and Q two—that allow us to make that connection between the size measure, which is breadth, and the nilpotency class bound. It moves the discussion from just finding counterexamples to providing a constructive method for bounding these classes in many important settings.

Emmy: So what this means for someone just trying to understand these p-groups without diving into all that heavy notation is that if you can build your group structure using semidirect products and satisfy those two rules, you get a solid upper limit on how complicated its nilpotency can get.

Ada: And the caveat is still there, though, because they explicitly state this theorem only works when those specific structural conditions are met within the semidirect product setup; it doesn't apply to every single p-group without that extra layer of structure.

Emmy: The next step in this research seems to be exploring how these bounds hold up in more general settings, and they also touch on related ideas like the Manin constant in other papers, which hints that these structural constraints might be important across different areas of group theory.

The paper's improvements: Ada: So we’re moving on to how they suggest improving this theorem about the class-breadth conjecture for p-groups, and it’s all about making the conditions even more flexible so more groups fit into this framework.

Emmy: Right, they aren't just stopping at the main theorem; they are looking at weakened versions, like corollary four, which applies to normal abelian subgroups H instead of the whole semidirect product G and P.

Ada: Exactly. That means if you have a smaller subgroup H inside a p-group G, even if it’s just an abelian one, its nilpotency class is still bounded by the breadth of the whole group G plus one. That’s a nice simplification for analysis.

Emmy: It suggests that this bounding behavior isn't just tied to the full product structure; it holds true at a more fundamental level when you consider normal abelian components within larger p-groups. It treats that specific type of structure with a certain respect in terms of its complexity measure, which is breadth.

Ada: The authors are trying to show that this relationship between nilpotency and breadth isn't just an artifact of the semidirect product construction; it’s a more general property tied to the internal relationships within these groups. They’re looking for the structural reason why those specific conditions on Q one and Q two matter so much.

Emmy: They are essentially trying to find that deeper geometric or algebraic structure that forces the nilpotency class to behave this way, even when you look at subgroups that aren't directly related by a semidirect product. It’s about generalizing the concept of breadth control beyond just one specific group construction.

Ada: So what they suggest is that we should focus on those structural constraints—the ones involving the non-cyclic nature of factor groups or the relationship between P three and P four—because they are the mechanisms that enforce this bound in these broader contexts. It’s about finding the minimal set of requirements to keep that nilpotency class under control.

Emmy: And by looking at these improvements, they are setting up a path to maybe tackle cases where those initial structural assumptions don't perfectly align, perhaps leading toward even more nuanced bounds on when things might break down or how fast they grow.

Ada: It’s about building a toolkit for analyzing p-groups where the tools you have let you prove that for many cases, the complexity stays within the realm of breadth plus one. The hope is that this framework will help us understand why prime two was different and why primes greater than two behave more predictably under these conditions.

Emmy: It’s a step toward a more universal understanding of how algebraic structure dictates nilpotency, using breadth as the primary metric for that relationship.

Conclusion: Tom: So we're wrapping up on "On the class-breadth conjecture for p-groups," and basically, they’ve given us a structural way to bound nilpotency class by breadth plus one under specific conditions for prime numbers greater than two.

Ada: Right. The main thing is that they showed that if you have a semidirect product of p-groups G and P, and you meet those two complex structural requirements—one about factor groups being non-cyclic, and the other about cyclic factors—then the nilpotency class of the whole thing is controlled by the breadth of G plus one.

Emmy: It’s a structural proof that shows how to control group complexity using that specific measure called breadth, which is based on how much things shrink when you look at their centralizers. It connects the geometry of the group directly to its algebraic depth.

Kolya: What this really means for us is that for these larger constructed groups, we don't have to calculate every single commutator; we just need to check if the structure fits those two conditions, and then you get a solid upper limit on how deep the nilpotency goes. It governs the tail behavior of how fast that class can grow.

Ada: The caveat is that this theorem only works when those specific structural levers are pulled correctly in the semidirect product setup; it’s not a universal proof for every single p-group without those extra constraints.

Emmy: They also gave us a corollary about normal abelian subgroups, which means even if you look at a subgroup H inside G that’s just abelian, its nilpotency class is still bounded by the breadth of G plus one. That’s a nice way to simplify things when analyzing embeddings.

Kolya: So if I'm looking at a normal abelian part of something bigger, I can use this bound without needing the full complexity analysis, and it keeps the constants manageable for application.

Ada: Exactly. It gives us a concrete tool for predicting behavior in these complex group structures when you can verify those structural conditions are met. It’s about establishing bounds where there were previously only counterexamples or open questions.

Emmy: The authors are now looking at how to make those conditions even more flexible, exploring the implications of corollary four and trying to find a more general way to link nilpotency and breadth across different group constructions.

Kolya: It’s interesting because it pushes us toward finding those deeper structural properties that force these bounds, which is where the real work for applying these ideas lies.

Ada: And so, in summary, the paper "On the class-breadth conjecture for p-groups" provides a specific mechanism to show that for many semidirect products of p-groups, the nilpotency class is bounded by the breadth plus one when certain structural properties are met.

Emmy: It’s a precise statement that links the size measure of breadth directly to the algebraic depth of a group structure under controlled circumstances.

Kolya: The implication is that for groups built this way, we have a reliable way to estimate their nilpotency without having to do an exhaustive search on every element.

Ada: We’re heading into another paper next week where they tackle how the regularity of critical immersions affects scale-invariant curvature energies in even dimensions, which is a different kind of structural analysis.

ALEXANDER A. SKUTIN

Russian Science Foundation · Huawei Moscow Research center · Theoretical Physics and Mathematics Advancement Foundation BASIS

math.GR

Submitted: 2026-06-11

Updated: 2026-11-16

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 78/100

The gist: The paper investigates whether the nilpotency class of any p-group is bounded by its breadth plus one for prime numbers greater than two, addressing a conjecture that has been known to fail for p=2.

Key concepts

Nilpotency Class (cl(G))
This measures how 'non-abelian' a group is. It is the smallest integer $c$ such that the lower central series eventually reaches the identity. A lower class means elements commute quickly, while a high class means they do not commute for many steps.
Breadth (b(G))
The breadth of a group G is determined by examining the maximum value of logp|G: ZG(x)| across all elements x in G. This essentially measures how much the centralizer of an element differs from the whole group, providing a measure related to the size and structure of its centralizers.
Semidirect Product (G⋉ P)
This is a way to construct a larger group by combining two smaller groups G and P. The structure of this combined group dictates how elements from G interact with elements from P, which is crucial for applying the main theorem to analyze the overall nilpotency class.
Class-Breadth Conjecture
This conjecture proposes that for any p-group, the nilpotency class is at most one more than its breadth. The paper focuses on proving this holds true for prime numbers $p > 2$, where previous counterexamples existed for $p=2.

Terminology

Summary

The paper investigates whether the nilpotency class of any p-group is bounded by its breadth plus one for prime numbers greater than two, addressing a conjecture that has been known to fail for p=2. p. 0

Where the paper says it

SKUTIN Abstract. The class-breadth conjecture of Leedham-Green, Neumann and Wiegold states that the nilpotency class of any p-group is at most b(G) + 1, where b(G) = max g∈G logp [G : ZG(g)] denotes the breadth of a group G.

Let G be a finite p-group, and the breadth b(G) of G is defined as the maximum of b(g) over all g in G, where b(x) is defined as logpG: ZG(x). p. 0

Where the paper says it

Introduction Let G be a finite p-group. The breadth b(x) of an element x of a group G is defined as b(x) := logp |G : ZG(x)|, where ZG(x) denotes the centralizer of x in G.

The class-breadth conjecture states that the nilpotency class cl(G) is at most b(G) + 1 for all p-groups G. p. 0
Where the paper says it

SKUTIN Abstract. The class-breadth conjecture of Leedham-Green, Neumann and Wiegold states that the nilpotency class of any p-group is at most b(G) + 1, where b(G) = max g∈G logp [G : ZG(g)] denotes the breadth of a group G.

While counterexamples to this conjecture have been found for p = 2, it remains open in general for p > 2. p. 0
Where the paper says it

The class-breadth conjecture of Leedham-Green, Neumann and Wiegold states that the nilpotency class of any p-group is at most b(G) + 1, where b(G) = max g∈G logp [G : ZG(g)] denotes the breadth of a group G. While several counter-examples to this conjecture have been found for p = 2, it is still open in general for p > 2.

Main Theorem Statement

Theorem 1 states that if G⋉ P is any semidirect product of any p-groups G and P, and for each G-invariant subgroup Q of P at least one of two conditions holds, then clG(P) ≤ bG(P) + 1.

The conditions are:

  1. Q/γG1 (Q) is not cyclic and clG(Q) ≤ max(clG([Q1, GQ]), clG([Q2, GQ])) + 1 for any two different maximal and G-invariant subgroups Q1, Q2 of Q. p. 1

    Where the paper says it

    Let G⋉ P be any semidirect product of any p-groups G and P. Assume that for each G-invariant subgroup Q of P at least one of the following hold: (1) Q/γG 1 (Q) is not cyclic and clG(Q) ≤ max(clG([Q1, GQ]), clG([Q2, GQ])) + 1 for any two different maximal and G-invariant subgroups Q1, Q2 of Q, (2) Q/γG 1 (Q) is cyclic and clG([G, Q]) ≤ b G(Q).

  2. Q/γG1 (Q) is cyclic and clG([G, Q]) ≤ bG(Q). p. 1

    Where the paper says it

    Let G⋉ P be any semidirect product of any p-groups G and P. Assume that for each G-invariant subgroup Q of P at least one of the following hold: (1) Q/γG 1 (Q) is not cyclic and clG(Q) ≤ max(clG([Q1, GQ]), clG([Q2, GQ])) + 1 for any two different maximal and G-invariant subgroups Q1, Q2 of Q, (2) Q/γG 1 (Q) is cyclic and clG([G, Q]) ≤ b G(Q).

Proof Structure for Theorem 1

The proof proceeds by induction on G⋉ P. The base case is trivial when G⋉ P = 1. p. 4

Where the paper says it

Proof of Theorem 1 Induction on |G ⋉ P|. The base case |G ⋉ P| = 1 is trivial.

The inductive step considers two cases based on the cyclic nature of P/γG1 (P) and the relationship between clG([G, P]) and bG(P). p. 4
Where the paper says it

The base case |G ⋉ P| = 1 is trivial. Proof of the induction step: From the conditions of Theorem 1, it follows that either P/γG 1 (P) is cyclic and clG([G, P]) ≤ b G(P), or P/γG 1 (P) is not cyclic and clG(P) ≤ max(clG([P1, GP]), clG([P2, GP])) + 1 for any two different maximal and G-invariant subgroups P1, P2 of P.

If P/γG1 (P) is cyclic and clG([G, P]) ≤ bG(P), then [G, P] ⊴ P. p. 1

Where the paper says it

Let G⋉ P be any semidirect product of any p-groups G and P. Assume that for each G-invariant subgroup Q of P at least one of the following hold: (1) Q/γG 1 (Q) is not cyclic and clG(Q) ≤ max(clG([Q1, GQ]), clG([Q2, GQ])) + 1 for any two different maximal and G-invariant subgroups Q1, Q2 of Q, (2) Q/γG 1 (Q) is cyclic and clG([G, Q]) ≤ b G(Q).

A homomorphism π: P → P/[G, P] is considered where π(P)/π(P)' = clG([G, P]) ≤ bG(P). This leads to clG(P) ≤ clG([G, P]) + 1 ≤ bG(P) + 1. p. 1
Where the paper says it

Let Q be any G-invariant subgroup of P. Define: clG(Q) := min{k ≥ 0 | γ G k (Q) = {e}}, b G(Q) := min ( k ≥ 0 there exist two maximal and G-invariant subgroups Q1, Q2 of Q such that bGQ(x) ≤ k, ∀x ∈ Q \ (Q1 ∪ Q2) ) .

Case Analysis for Non-Cyclic Factors

When P/γG1 (P) is not cyclic and clG(P) ≤ max(clG([P1, GP]), clG([P2, GP])) + 1 for any two different maximal and G-invariant subgroups P1, P2 of P, the proof proceeds by analyzing the relationship between bGP(x) and bGP(x).

The induction step involves showing that for certain integers 3 ≤ n ≤ 4, bG(P3) = bG(P4) = bG(P), which implies that the set of elements where bGPn(x) > bG(Pn) − 1 can be covered by two maximal and G-invariant subgroups P1 ∩ P2. p. 5

Where the paper says it

From {x ∈ P | bGP (x) > b G(P)} ⊆ P1 ∪ P2, Pi \ (P1 ∩ P2) = Pi \ (P1 ∪ P2), ∀3 ≤ i ≤ 4, bGPn (x) < bGPn (x), ∀x ∈ Pn \ X, bGPn (x) ≤ bGP (x), ∀x ∈ GPn, b G(P3) = b G(P4) = b G(P), and X ∩ Pn ⊆ H, it follows that bGPn (x) < bGP (x) ≤ b G(P) = b G(Pn) ∀x ∈ Pn \ ((P1 ∩ P2) ∪ H), i. that the set {x ∈ Pn | bGPn (x) > bG(Pn) − 1} can be covered by two maximal and Ginvariant subgroups P1 ∩ P2, H of Pn, which contradicts to the definition of b G(Pn).

This leads to the conclusion that [Pn, GP] ≤ γG1 (Pn), which then implies clG(P) ≤ max(clG([P3, GP]), clG([P4, GP])) + 1 ≤ bG(P) + 1. p. 1
Where the paper says it

Let G⋉ P be any semidirect product of any p-groups G and P. Assume that for each G-invariant subgroup Q of P at least one of the following hold: (1) Q/γG 1 (Q) is not cyclic and clG(Q) ≤ max(clG([Q1, GQ]), clG([Q2, GQ])) + 1 for any two different maximal and G-invariant subgroups Q1, Q2 of Q, (2) Q/γG 1 (Q) is cyclic and clG([G, Q]) ≤ b G(Q).

Weakened Conjecture and Corollaries

Corollary 4 provides a weakened version of the class-breadth conjecture for p > 2, stating that for any p-group G and its normal abelian subgroup H, clH(G) ≤ b(G) + 1. The proof relies on considering the external semidirect product H∗⋉ G and analyzing the case where bH∗(Q) = 0 or bH∗(Q) > 0. p. 4

Where the paper says it

ON THE CLASS-BREADTH CONJECTURE FOR p-GROUPS 5 Proof. The conjugation action of H on G induces an external semidirect product H∗ ⋉ G, where H∗ ∼= H.

Corollary 1 is also presented, which assumes that γG2 (Q) ⊆ γG1 (Q′) and clG([G, Q]) ≤ bG(Q) for each G-invariant subgroup Q of P. p. 2

Where the paper says it

From k ≥ 1, k ≥ clG([Q1, GQ]), γ G 2 (Q) ⊆ γ G 1 (Q′ ), Proposition 1, and the fact that [K, L] = L ′ for any p-group L and any its maximal subgroup K, it follows that γ G k+1(Q) ⊆ γ G k−1 ( γ G 2 (Q) | {z } ⊆γG 1 (Q′)=γG 1 ([Q1,Q])⊆γG 1 ([Q1,GQ]) ) ⊆ γ G k ([Q1, GQ]) = {e}, Therefore, in both cases, clG(Q) ≤ k + 1 = max(clG([Q1, GQ]), clG([Q2, GQ])) + 1 and, from Theorem 1, clG(P) ≤ b G(P) + 1. □ Corollary 2.

This condition allows the conclusion that clG(P) ≤ bG(P) + 1. p. 1
Where the paper says it

Let Q be any G-invariant subgroup of P. Define: clG(Q) := min{k ≥ 0 | γ G k (Q) = {e}}, b G(Q) := min ( k ≥ 0 there exist two maximal and G-invariant subgroups Q1, Q2 of Q such that bGQ(x) ≤ k, ∀x ∈ Q \ (Q1 ∪ Q2) ) .

Final Proof Steps

The proof of Theorem 1 concludes by demonstrating that if [Pn, GP] is not contained in γG1 (Pn), then the set X = Pn ∩ X is a proper subgroup of Pn. This leads to the inequality bGPn(x) < bGPn(x) for x ∈ Pn X, and ultimately establishes that clG(P) ≤ max(clG([P3, GP]), clG([P4, GP])) + 1 ≤ bG(P) + 1. p. 1

Where the paper says it

Let G⋉ P be any semidirect product of any p-groups G and P. Assume that for each G-invariant subgroup Q of P at least one of the following hold: (1) Q/γG 1 (Q) is not cyclic and clG(Q) ≤ max(clG([Q1, GQ]), clG([Q2, GQ])) + 1 for any two different maximal and G-invariant subgroups Q1, Q2 of Q, (2) Q/γG 1 (Q) is cyclic and clG([G, Q]) ≤ b G(Q).

The paper also provides a proof for Corollary 2 and Corollary 3. p. 4
Where the paper says it

Therefore, in both cases, γ H∗ 2 (Q) ⊆ γ H∗ 1 (Q′ ), clH∗ ([H∗ , Q]) ≤ b H∗ (Q) and, from Corollary 1, clH(P) = clH∗ (P) ≤ b H∗ (P) + 1 = b(P) + 1. Proof of Theorem 1 Induction on |G ⋉ P|.

References

[9] D. J. S. Robinson, A Course in the Theory of Groups, 2nd ed. p. 6

Where the paper says it

Journal of the Australian Mathematical Society 11, no. Robinson, A Course in the Theory of Groups, 2nd ed.

(Graduate Texts in Math. p. 6
Where the paper says it

Robinson, A Course in the Theory of Groups, 2nd ed. (Graduate Texts in Math.

80), Springer-Verlag New York, 1996. p. 6
Where the paper says it

(Graduate Texts in Math. 80), Springer-Verlag New York, 1996.

The paper also cites [1] N. p. 1
Where the paper says it

Then γ G∗ i (G) = γi+1(G), ∀i ≥ 0 and clG∗ (G) = cl(G). The main theorem of this paper is the following: Theorem 1.

Blackburn On a special class of p-groups Acta Math. p. 0
Where the paper says it

The conjecture has been proved in some special cases; see, for example: if b(G) ≤ 4 in [5, 7], if b(G) ≤ p + 1 in [4], if G is a p-group of maximal class in [1], if G is metabelian in [6], and if G is not covered by its two-step centralizers in [6]. See also [2] for more classes of p-groups satisfying the conjecture.

100 (1958) and [7] I. p. 6
Where the paper says it

On a special class of p-groups. 100 (1958).

D. Macdonald Groups of breadth four have class five Glasgow Mathematical Journal 19, no. p. 6
Where the paper says it

Groups of breadth four have class five. Glasgow Mathematical Journal 19, no.

2 (1978). The paper also cites [6] C. p. 1
Where the paper says it

Then γ G∗ i (G) = γi+1(G), ∀i ≥ 0 and clG∗ (G) = cl(G). The main theorem of this paper is the following: Theorem 1.

R. Leedham-Green P. p. 0
Where the paper says it

SKUTIN Abstract. The class-breadth conjecture of Leedham-Green, Neumann and Wiegold states that the nilpotency class of any p-group is at most b(G) + 1, where b(G) = max g∈G logp [G : ZG(g)] denotes the breadth of a group G.

M Neumann J Wiegold The Breadth and the Class of a Finite P-Group Journal of the London Mathematical Society, s2-1: 409-420 (1969). p. 6
Where the paper says it

The Breadth and the Class of a Finite P-Group. Journal of the London Mathematical Society, s2-1: 409-420 (1969).

The paper also cites [8] P. p. 1
Where the paper says it

Then γ G∗ i (G) = γi+1(G), ∀i ≥ 0 and clG∗ (G) = cl(G). The main theorem of this paper is the following: Theorem 1.

M Neumann An improved bound for BFCp-groups Journal of the Australian Mathematical Society 11, no. p. 6
Where the paper says it

An improved bound for BFCp-groups. Journal of the Australian Mathematical Society 11, no.

1 (1970). The paper also cites [3] W. p. 1
Where the paper says it

Then γ G∗ i (G) = γi+1(G), ∀i ≥ 0 and clG∗ (G) = cl(G). The main theorem of this paper is the following: Theorem 1.

Felsch J Neubüser W Plesken Space groups and groups of prime-power order IV Counterexamples to the class-breadth conjecture J London Math Soc 24, 2 (1981). p. 6
Where the paper says it

Space groups and groups of prime-power order, IV. Counterexamples to the class-breadth conjecture, J.

The paper also cites [5] H. p. 1
Where the paper says it

Then γ G∗ i (G) = γi+1(G), ∀i ≥ 0 and clG∗ (G) = cl(G). The main theorem of this paper is the following: Theorem 1.

G. Knoche Über den Frobenius’ schen Klassenbegriff in nilpotenten Gruppen Mathematische Zeitschrift 55 (1951). p. 6
Where the paper says it

Über den Frobenius’ schen Klassenbegriff in nilpotenten Gruppen. Mathematische Zeitschrift 55 (1951).

The paper also cites [2] B Eick M F Newman E A O’Brien The class-breadth conjecture revisited Journal of Algebra, 300, 1 (2006). p. 6
Where the paper says it

100 (1958). The class-breadth conjecture revisited, Journal of Algebra, 300, 1, (2006).

The paper also cites [4] J A Gallian On the breadth of a finitep-group Math Z 126, 224–226 (1972). p. 6
Where the paper says it

24, 2, (1981). On the breadth of a finitep-group, Math Z 126, 224–226 (1972).

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Improved understanding of p-group nilpotency class bounds by incorporating semidirect products of p-groups and arbitrary groups P. This allows AI systems to predict the nilpotency class clG(P) for complex group structures based on the properties of its components G and P, as stated in Theorem 1.

  2. Enhanced prediction of nilpotency classes for a wide range of prime numbers p greater than 2 by utilizing the class-breadth conjecture framework. This is achieved by applying Corollary 1 and Corollary 4 to determine clG(P) based on the breadth bG(P) and structural properties like cyclicity or the relationship between subgroups.

  3. Ability to classify group structures based on their behavior under conjugation and normal abelian subgroups. The system can determine if clH(G) is bounded by b(G) + 1 for a normal abelian subgroup H, as described in Corollary 4, which provides a specific bound for the nilpotency class of the subgroup relative to its ambient group.

Abstract

The class-breadth conjecture of Leedham-Green, Neumann and Wiegold states that the nilpotency class of any p-group is at most b(G) + 1, where denotes the breadth of a group G. While several counter-examples to this conjecture have been found for p = 2, it is still open in general for p > 2. This article is dedicated to the general case p > 2 of the conjecture.

Related papers