Let R be a group of prime order r that acts on the r'-group G, let RG be the semidirect product of G with R, let 픽 be a field and V be a faithful completely reducible 픽[RG]-module. Trivially, CG(R) acts on CV(R). Let K be the kernel of this action. What can be said about K? This question is considered when G is soluble. It turns out that K is subnormal in G or r is a Fermat or half-Fermat prime. In the latter cases, the subnormal closure of K in G is described. Several applications to the theory of automorphisms of soluble groups are given
There is a large collection of effective algorithms for computing information about finite soluble ...
[EN] A remarkable result of Thompson states that a finite group is soluble if and only if all its tw...
An algorithm is outlined to compute soluble factor groups of finitely presented groups
Let R be a group of prime order r that acts on the r'-group G, let RG be the semidirect product of G...
Let p be a prime. The class of all p-soluble groups G such that every p-chief factor of G is cyclic ...
In this paper some new conditions are given under which a finite group is soluble.</p
summary:Let $R$ be a commutative ring, $M$ an $R$-module and $G$ a group of $R$-automorphisms of $M$...
Let A and G be finite groups of relatively prime orders and suppose that A acts on G via automorphi...
AbstractSuppose G is either a soluble (torsion-free)-by-finite group of finite rank or a soluble lin...
AbstractWe show that certain properties of groups of automorphisms can be read off from the actions ...
In [1] we obtained a short proof of the theorem of Thompson that a finite group is soluble if and on...
Let f.c.d.(G) denote the set of the degrees of the faithful irreducible complex characters of a fini...
AbstractLet r be a prime and suppose the r-group R acts as a group of automorphisms on the r′-group ...
AbstractA finite group G is said to be a PST-group if every subnormal subgroup of G permutes with ev...
In this thesis, a study is made of finite groups which satisfy the following hypothesis:- (*) G is a...
There is a large collection of effective algorithms for computing information about finite soluble ...
[EN] A remarkable result of Thompson states that a finite group is soluble if and only if all its tw...
An algorithm is outlined to compute soluble factor groups of finitely presented groups
Let R be a group of prime order r that acts on the r'-group G, let RG be the semidirect product of G...
Let p be a prime. The class of all p-soluble groups G such that every p-chief factor of G is cyclic ...
In this paper some new conditions are given under which a finite group is soluble.</p
summary:Let $R$ be a commutative ring, $M$ an $R$-module and $G$ a group of $R$-automorphisms of $M$...
Let A and G be finite groups of relatively prime orders and suppose that A acts on G via automorphi...
AbstractSuppose G is either a soluble (torsion-free)-by-finite group of finite rank or a soluble lin...
AbstractWe show that certain properties of groups of automorphisms can be read off from the actions ...
In [1] we obtained a short proof of the theorem of Thompson that a finite group is soluble if and on...
Let f.c.d.(G) denote the set of the degrees of the faithful irreducible complex characters of a fini...
AbstractLet r be a prime and suppose the r-group R acts as a group of automorphisms on the r′-group ...
AbstractA finite group G is said to be a PST-group if every subnormal subgroup of G permutes with ev...
In this thesis, a study is made of finite groups which satisfy the following hypothesis:- (*) G is a...
There is a large collection of effective algorithms for computing information about finite soluble ...
[EN] A remarkable result of Thompson states that a finite group is soluble if and only if all its tw...
An algorithm is outlined to compute soluble factor groups of finitely presented groups