A Simplicity Criterion for Finite Groups
โ Scribed by Huiwen Deng; Wujie Shi
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 193 KB
- Volume
- 191
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper, we investigate the relation between the number of primes and that of ลฝ . composite numbers in G and obtain a criterion for the simplicity of finite e groups. แฎ 1997 Academic Press 1. INTRODUCTION Throughout this paper, all groups are finite and all simple groups are nonabelian.
Given a group G, we denote the set of all prime divisors of order G by ลฝ . ลฝ . ลฝ . G and the set of all element orders of G by G . Clearly, G is the e ลฝ .
< < set consisting of primes that lies in G . Usually X denotes the number e of elements of a set X. For convenience, we define G s the number of composite numbers in G ,
ลฝ .
ลฝ .
e ลฝ . ลฝ . ร 4 which in fact is the number of elements of G y G y 1 . All e further unexplained notation is standard and can be found, for example, in w x 4 .
๐ SIMILAR VOLUMES
In this paper we exhibit an intimate relationship between the simplicity of an FG-module V of a finite group G generated by a noncentral involution t / 1 and ร 4 some other element u in G and the socles of the eigenspaces E for in y1, 1 of ลฝ . the involution t considered as FC-modules, where C s C t
We conjecture that every finite group G has a short presentation in terms of . generators and relations in the sense that the total length of the relations is ลฝ < <. Oลฝ1. log G .