The strict inequality conjecture for primitive detection degrees

About 20 years old · traced to

Let GG be a finite group. Let e(G)e(G) be the degree associated with the top primitives, and let e′(G)e^{\prime}(G) be the largest degree dd for which QACessd(G)Q_A Cess^d(G) is nonzero when Cess∗(G)Cess^*(G) is nonzero; if Cess∗(G)=0Cess^*(G)=\mathbf 0, set e′(G)=−1e^{\prime}(G)=-1.

Strict inequality conjecture. If GG is not pp-central, then

e′(G)<e(G).e^{\prime}(G)<e(G).

This conjecture compares the primitive detection degree with the top primitive degree. The source proves it when r−c=1r-c=1 and explains that the Strong Regularity Conjecture implies it for a fixed finite group; Benson's conjecture is known when r−c≤2r-c\leq 2, but the general status remains open.

References

Primary source

Nicholas J. Kuhn, “Primitives and central detection numbers in group cohomology”, arXiv:math/0612133 (2007).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.