The prime-graph complement characterization for strictly T-solvable groups
The prime-graph complement characterization for strictly T-solvable groups
Let be a nonabelian finite simple group and let be a prime number. For each , define to be the set of edges
Prime-graph complement characterization. For every strictly -solvable group , there exists a set such that
This proposes a uniform description of the induced prime-graph complement on the set of prime divisors of for strictly -solvable groups, in terms of the prime-graph complement of and the edge sets arising from Brauer characters. The source presents it as a direction for future work; no resolution is supplied.
Sources & referencesView supporting material
Primary source
Thomas Michael Keller, Zachary Martin, Alexa Renner, Gabriel Roca and Eric Yu, “Classification of the Prime Graphs of Sz(8)-, Sz(32)-, and PSL(2, 2^5)-Solvable Groups”, arXiv:2410.21063 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.