A new characterization of the sporadic simple group B

This paper investigates a novel characterization method for the sporadic simple group $B$ (Baby Monster Group). Using the combination of the order component set $OC(G)$ of a finite group and the set $\pi_{p_m}(G)$ of the orders of centralizers of elements of highest order within the group, we proved: a finite group $G$ is isomorphic to the sporadic simple group $B$ if and only if the following two conditions hold: (1) $G$ shares the same largest order component $m_1(G)$ as B; (2) The sets $\pi_{p_m}(G)$ and $\pi_{p_m}(B)$ of the orders of centralizers of their respective highest-order elements are identical. By analyzing the prime graph structure, excluding the possibility of Frobenius groups and 2-Frobenius groups, and utilizing the Classification Theorem of Finite Simple Groups, we ultimately establish the sufficiency and necessity of these characterizing conditions.

Authors

Publication Details

Journal
International Journal of Algebra
Published
2025-01-01
DOI
https://doi.org/10.12988/ija.2025.91965
Primary Topic
Advanced Algebra and Geometry
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A new characterization of the sporadic simple group B

Xiaobo Wen, Lin Lan
International Journal of Algebra
Advanced Algebra and Geometry
article

A new characterization of the sporadic simple group B

Xiaobo Wen, Lin Lan
article en

Abstract

This paper investigates a novel characterization method for the sporadic simple group $B$ (Baby Monster Group). Using the combination of the order component set $OC(G)$ of a finite group and the set $\pi_{p_m}(G)$ of the orders of centralizers of elements of highest order within the group, we proved: a finite group $G$ is isomorphic to the sporadic simple group $B$ if and only if the following two conditions hold: (1) $G$ shares the same largest order component $m_1(G)$ as B; (2) The sets $\pi_{p_m}(G)$ and $\pi_{p_m}(B)$ of the orders of centralizers of their respective highest-order elements are identical. By analyzing the prime graph structure, excluding the possibility of Frobenius groups and 2-Frobenius groups, and utilizing the Classification Theorem of Finite Simple Groups, we ultimately establish the sufficiency and necessity of these characterizing conditions.

International Journal of AlgebraVol. 19(4)
Openalex Percentile: Top 71%
Advanced Algebra and Geometry
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.