SearcharxivSearch

arXiv · 1307.2924

Non-Solvable Graph of a Finite Group and Solvabilizers

Abstract

Let $G$ be a finite group. For $x \in G$, we define the solvabilizer of $x$ in $G$, denoted $sol_G(x)$, to be the set $\{g \in G \mid \langle g,x \rangle$ is solvable$\}$. A group $G$ is an S-group if $sol_G(x)$ is a subgroup of $G$ for every $x \in G$. In this paper we prove that $G$ is solvable $\Leftrightarrow$ $G$ is an S-group. Secondly, we define the non-solvable graph of $G$ (denoted ${\mathcal S}_{G}$). Its vertices are $G$ and there is an edge between $x,y \in G$ whenever $\langle x,y \rangle$ is not solvable. If $S(G)$ is the solvable radical of $G$ and $G$ is not solvable, we look at the induced graph over $G \setminus S(G)$, denoted $\hat{{\mathcal S}_{G}}$. We prove that if $G$ is not solvable, then $\hat{{\mathcal S}_{G}}$ is irregular. In addition, we prove some properties of solvabilizers and non-solvable graphs.

Explore related subjects

Keep this discovery

BibTeXRIS

Doron Hai-Reuven. 2013-07-10. Non-Solvable Graph of a Finite Group and Solvabilizers. https://arxiv.org/abs/1307.2924

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR