A group G satisfies the permutizer condition P if each proper subgroup H of G permutes with some cyclic subgroup not contained in H. The structure of finite groups with P is studied, the main result being that such groups are soluble with chief factors of order 4 or a prime. The classification of fi
The Permutizer Condition in Infinite Soluble Groups
โ Scribed by James C. Beidleman; Derek J.S. Robinson
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 108 KB
- Volume
- 210
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
โฆ Synopsis
A group satisfies the permutizer condition P if each proper subgroup permutes with some cyclic subgroup not contained in it. Here we characterize the classes of soluble minimax groups and finitely generated soluble groups with P.
๐ SIMILAR VOLUMES
Suppose that โ is an infinite set and k is a natural number. Let โ denote the set of all k-subsets of โ and let F be a field. In this paper we study the ลฝ . w x k FSym โ -submodule structure of the permutation module F โ . Using the representation theory of finite symmetric groups, we show that ever
The authors investigate the structure of locally soluble-by-finite groups that satisfy the weak minimal condition on non-nilpotent subgroups. They show, among other things, that every such group is minimax or locally nilpotent.
The Sylow-2-subgroups of a periodic group with minimal condition on centralizers are locally finite and conjugate. The same holds for the Sylow-p-subgroups for any prime p, provided the subgroups generated by any two p-elements of the group are finite. In the non-periodic context, the bounded left E
The factorization problem in permutation groups is to represent an element g of some permutation group G as a word over a given set S of generators of G. For practical purposes, the word should be as short as possible, but must not be minimal. Like many other problems in computational group theory,