Solvabilizer Numbers of Finite Groups

Abstract

Consider a nonsolvable finite group G, where R(G) represents the solvable radical of G. For any element x in G, the solvabilizer of x in G, denoted by SolG(x), is defined as the set of all elements y in G such that the subgroup generated by x and y is solvable. Notably, the entirety of G can be expressed as the union over all x in G(G) of their respective solvabilizers: $G = x∈ G(G) SolG(x). A solvabilizer covering of G is characterized by a subset X of G(G) such that G= x∈ X SolG(x). The solvabilizer number of G is then defined as the minimum cardinality among all solvabilizer coverings of G. This paper delves into the exploration of the solvabilizer number for diverse nonsolvable finite groups G, shedding light on the interplay between solvability and the structure of these groups.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…