On recognition of simple groups with disconnected prime graph by spectrum

2025/09/03 by Viktor Panshin, Panshin, Viktor · 1 citation
Mathematics · Computer Science · #Finite Group Theory Research #Rings, Modules, and Algebras #Graph Labeling and Dimension Problems

paper · pdf · doi:10.48550/arxiv.2509.03483

Abstract

Two finite groups are said to be isospectral if they have the same sets of element orders. This paper completes the description of finite groups that are isospectral to finite simple groups with disconnected prime graph.

Citations

• Greatest common divisors of values of integer polynomials and an application to maximal tori

Cited by

• The problem of recognition of finite simple groups by element orders is solved

Related

• Isospectral Cayley graphs of some finite simple groups
• On finite groups isospectral to groups with abelian Sylow 2-subgroups
• Recognisability of the sporadic groups by the isomorphism types of their prime graphs
• Prime Order Element Graph of a Group -- II
• Recognizability by spectrum of alternating groups