Characterization of solubilizers of elements in minimal simple groups
If \(G\) is a finite group and \(x \in G\), the solubilizer of \(x\) in \(G\) is the set \[\mathrm{Sol}_{G}(x):=\{ y \in G \mid \langle x, y \rangle \ \text{is soluble} \}.\] In general, \(\mathrm{Sol}_{G}(x)\) is not a subgroup of \(G\). However, it has been shown that \(\mathrm{Sol}_{G}(x)\) is a subgroup of \(G\) for any element \(x \in G\) if and only if \(G\) is soluble. It is interesting to consider how the properties of the structure of a single solubilizer can affect the structure of the whole group. Some advances have been made in this context. For instance, it has been proved that if \(G\) is a group having an element \(x\) such that all elements of \(\mathrm{Sol}_{G}(x)\) commute pairwise, then \(G\) is abelian.\N\NThe main aim of the present paper is to obtain more information about how exactly the properties of a single solubilizer set influence the entire group. The authors provide a classification for all solubilizers of elements in minimal simple groups. They also investigate some properties of the induced solubility graph \(\Delta_{S}(G)\) and prove some conditions for when \(\Delta_{S}(G)\) han an Eulerian or Hamiltonian cycle for a minimal simple group \(G\). Also they provide some bounds on the chromatic number of \(\Delta_{S}(G)\) for a minimal simple group. They use the obtained classification to answer some conjectures about the solubilizer sets for minimal simple groups. Finally they present some computational results regarding colorability and Hamiltonian cycles using algorithms for some small simple groups and present some conjectures for further work.
- A characterization of some finite simple groups by orders of their solvable subgroups
- A Characterization of Suzuki's Simple Groups
- Finite groups in which every two elements generate a soluble subgroup
- Finite groups of even order in which Sylow 2-groups are independent
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- Julia: a fresh approach to numerical computing
- Nonsolvable finite groups all of whose local subgroups are solvable. IV
- On the solubilizer of an element in a finite group
- On the soluble graph of a finite group
- Solvable graphs of finite groups
- The maximal subgroups of the low-dimensional finite classical groups.
- The probability of generating a finite soluble group.
- The solubility graph associated with a finite group
- The subgroup structure of finite classical groups in terms of geometric configurations.
- Thompson-like characterizations of the solvable radical.
This page was built for publication: Characterization of solubilizers of elements in minimal simple groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7008859)
