SearcharxivSearch

arXiv · 2501.11486

On the Normalizer-Solubilizer Conjecture_V3

Abstract

Let $G$ be a finite group and $x$ be an element of $G$. Define $\textrm{Sol}_G(x)$ as the set of all $y \in G$ such that $\langle {x,y}\rangle$ is soluble. We provide an equivalent condition for the normalizer-solubilizer conjecture, namely $|\mathcal{N}_G(\langle x\rangle)| \mid |\textrm{Sol}_G(x)|$, where $\mathcal{N}_G(\langle x\rangle)$ is the normalizer of $\langle x\rangle$. Furthermore, we demonstrate that the conjecture holds in the special case where $\mathcal{N}_G(\langle x\rangle)$ is a Frobenius group with kernel $\mathcal{C}_G(x)$, the centralizer of $x$, and $|\mathcal{N}_G(\langle x\rangle): \mathcal{C}_G(x)|$ is of prime order. Finally, we will classify all finite simple groups $G$ that contain an element $x$ for which $\textrm{Sol}_G(x)$ is a maximal subgroup of order $pq$, where $p$ and $q$ are prime numbers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hamid Mousavi. 2025-01-20. On the Normalizer-Solubilizer Conjecture_V3. https://arxiv.org/abs/2501.11486

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