Given a finite group G, we denote by l G the length of the longest chain of subgroups of G. We study whether certain sets of non-isomorphic finite simple groups S with bounded l S are finite or infinite. We prove, in particular, that there exists an infinite number of non-isomorphic non-abelian fini
Finite Groups of Chain Difference One
β Scribed by Margaret A. Hartenstein; Ronald M. Solomon
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 165 KB
- Volume
- 229
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
β¦ Synopsis
A finite group G is said to have chain difference one if the lengths of any two unrefinable subgroup chains of G differ by at most one. Finite simple groups of Ε½ chain difference one were classified by B. Brewster et al. 1993, J. Algebra 160, . 179α191 using the classification of finite simple groups. We give an more elementary proof of this result. In particular we give an elementary proof that a minimal counterexample has dihedral or semidihedral Sylow 2-subgroups.
π SIMILAR VOLUMES
We show that certain properties of groups of automorphisms can be read off from the actions they induce on the finite characteristic quotients of their underlying group G. In particular, we obtain criteria for groups of automorphisms of a Ε½ . residually finite and soluble minimax -by-finite group G
## Abstract The structure of the finite Krutikβgroups is investigated. It is shown that they are solvable groups with very special properties.