## Ε½ . Γ < Let G be a finite group and let N G s n g N G has a conjugacy class C, We have proved previously that: If M is a sporadic simple group or a simple group having its prime graph with at least three prime graph components, then Thompson's conjecture is correct. In this paper, we shall pro
On Thompson's Conjecture
β Scribed by Chen Guiyun
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 148 KB
- Volume
- 185
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
β¦ Synopsis
Ε½ . Γ < Let G be a finite group and N G s n g N G has a conjugacy class C, such < < 4 that C s n . Professor J. G. Thompson has conjectured that ''If G be a finite Ε½ . Ε½ . group with Z G s 1 and M a nonabelian simple group satisfying that N G s Ε½ . N M , then G ( M.'' We have proved that if M is a sporadic simple group, then Thompson's conjecture is correct. In this paper, we shall further prove that if M is a finite simple group having at least three prime graph components, then the conjecture is also correct. G G G
π SIMILAR VOLUMES
Let p be a prime divisor of the order of a finite group G. Thompson (1970, J. Algebra 14, 129-134) has proved the following remarkable result: a finite group G is p-nilpotent if the degrees of all its nonlinear irreducible characters are divisible by p (in fact, in that case G is solvable). In this
Kummer conjectured the asymptotic behavior of the first factor of the class number of a cyclotomic field. If we only ask for upper and lower bounds of the order of growth predicted by Kummer, then this modified Kummer conjecture is true for almost all primes.
This paper gives an improved lower bound on the degrees d such that for general points p 1 p n β P 2 and m > 0 there is a plane curve of degree d vanishing at each p i with multiplicity at least m.
The weird, invisible insect depopulated an entire planet. Now it was felling Thompson's crew as his ship hurtled toward the sun ... certain death for all, including the disease carrier. Forgotten in the panic was Buster, Thompson's wise cat.
## Abstract C. Thomassen proposed a conjecture: Let __G__ be a __k__βconnected graph with the stability number Ξ±ββ₯β__k__, then __G__ has a cycle __C__ containing __k__ independent vertices and all their neighbors. In this paper, we will obtain the following result: Let __G__ be a __k__βconnected gr