pith. sign in

arxiv: 1302.5697 · v1 · pith:O7HXC7ATnew · submitted 2013-02-22 · 🧮 math.GR

Criteria for solvable radical membership via p-elements

classification 🧮 math.GR
keywords everysolvablecheckelementenoughradicalsolvabilitycharacterized
0
0 comments X
read the original abstract

Guralnick, Kunyavskii, Plotkin and Shalev have shown that the solvable radical of a finite group $G$ can be characterized as the set of all $x\in G$ such that $<x,y>$ is solvable for all $y\in G$. We prove two generalizations of this result. Firstly, it is enough to check the solvability of $<x,y>$ for every $p$-element $y\in G$ for every odd prime $p$. Secondly, if $x$ has odd order, then it is enough to check the solvability of $<x,y>$ for every 2-element $y\in G$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.