On recognizability by spectrum of finite simple groups of types B n , C n , and 2 D n for n = 2 k
The spectrum of a finite group is the set of its element orders. A group is said to be recognizable (by spectrum) if it is isomorphic to any finite group that has the same spectrum. A nonabelian simple group is called quasi-recognizable if every finite group with the same spectrum possesses a unique nonabelian composition factor and this factor is isomorphic to the simple group in question. We consider the problem of recognizability and quasi-recognizability for finite simple groups of types B n , C n , and 2 D n with n = 2 k .
Keywordsfinite simple group spectrum of a group prime graph recognition by spectrum orthogonal group symplectic group
Unable to display preview. Download preview PDF.
- 13.A. V. Zavarnitsin, Preprint No. 48, IM SO RAN (Inst. of Mathematics, Siberian Branch of the Russian Academy of Sciences, 2000).Google Scholar
- 16.G. C. Gerono, Nouv. Ann. Math. (2) 9, 469 (1870).Google Scholar
- 17.A. A. Buturlakin, Preprint, IM SO RAN (Inst. of Mathematics, Siberian Branch of the Russian Academy of Sciences, 2008).Google Scholar