A simplicity criterion for finite groups

DOI10.1006/JABR.1997.6869MaRDI QIDQ1357566zbMATH OpenOpenAlexFDO

Publication date 13 October 1997

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jabr.1997.6869

classification of simple groups element orders finite groups finite simple groups prime graph components

Finite simple groups and their classification (20D05) Arithmetic and combinatorial problems involving abstract finite groups (20D60) General structure theorems for groups (20E34)

Review text

For a finite group \(G\), denote by \(\pi(G)\) the set of all primes dividing \(|G|\), by \(\pi_e(G)\) the set of all element orders of \(G\) and by \(\psi(G)\) the number of composite numbers in \(\pi_e(G)\). By cleverly using the classification of simple groups and known facts about the prime graph components of simple groups, the authors prove the following surprising Theorem B: For every finite group \(G\) we have the inequality \(|\pi(G)|\leq\psi(G)+3\); moreover, if equality holds, then \(G\) must be a simple group. The second main result, Theorem A, classifies all finite simple groups \(G\) satisfying the equality \(|\pi(G)|=\psi(G)+3\).

Recommendations

Cites work

Cited in

(15)

This page was built for publication: A simplicity criterion for finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1357566)