On the Normalizer-Solubilizer ConjectureV3
Abstract
Let G be a finite group and x be an element of G. Define SolG(x) as the set of all y ∈ G such that x,y is soluble. We provide an equivalent condition for the normalizer-solubilizer conjecture, namely |NG( x)| |SolG(x)|, where NG( x) is the normalizer of x. Furthermore, we demonstrate that the conjecture holds in the special case where NG( x) is a Frobenius group with kernel CG(x), the centralizer of x, and |NG( x): CG(x)| is of prime order. Finally, we will classify all finite simple groups G that contain an element x for which SolG(x) is a maximal subgroup of order pq, where p and q are prime numbers.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.