๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


On Finite Groups Satisfying the Permutiz
โœ James C. Beidleman; Derek J.S. Robinson ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 231 KB

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 Structure of Some Permutation Module
โœ Darren G.D. Gray ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 301 KB

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

Locally Soluble-by-Finite Groups with th
โœ Martyn R. Dixon; Martin J. Evans; Howard Smith ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 159 KB

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.

Nilpotency in Groups with the Minimal Co
โœ Frank O Wagner ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 110 KB

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

An Algorithm for Solving the Factorizati
โœ T. Minkwitz ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 345 KB

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,