On the automorphism group of a finite group having no non-identity normal subgroups of odd order

1966 ◽  
Vol 93 (2) ◽  
pp. 154-160 ◽  
Author(s):  
George Glauberman
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Normal Subgroups ◽  
Odd Order ◽  
A Finite Group

scholarly journals A on simplicity criterion for finite groups

1969 ◽  
Vol 10 (3-4) ◽  
pp. 359-362
Author(s):  
Nita Bryce
Keyword(s):  
Finite Group ◽  
Normal Subgroup ◽  
Finite Groups ◽  
Odd Order ◽  
A Finite Group

M. Suzuki [3] has proved the following theorem. Let G be a finite group which has an involution t such that C = CG(t) ≅ SL(2, q) and q odd. Then G has an abelian odd order normal subgroup A such that G = CA and C ∩ A = 〈1〉.

On S-Quasinormal and C-Normal Subgroups of Prime Power Order in Finite Groups

2011 ◽  
Vol 18 (04) ◽  
pp. 685-692
Author(s):  
Xuanli He ◽  
Shirong Li ◽  
Xiaochun Liu
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Prime Power ◽  
Maximal Subgroups ◽  
Prime Power Order ◽  
Normal Subgroups ◽  
A Finite Group

Let G be a finite group, p the smallest prime dividing the order of G, and P a Sylow p-subgroup of G with the smallest generator number d. Consider a set [Formula: see text] of maximal subgroups of P such that [Formula: see text]. It is shown that if every member [Formula: see text] of is either S-quasinormally embedded or C-normal in G, then G is p-nilpotent. As its applications, some further results are obtained.

scholarly journals On Schur p-Groups of odd order

2017 ◽  
Vol 16 (03) ◽  
pp. 1750045 ◽  
Author(s):  
Grigory Ryabov
Keyword(s):  
Finite Group ◽  
Odd Order ◽  
A Finite Group ◽  
Natural Way

A finite group [Formula: see text] is called a Schur group if any [Formula: see text]-ring over [Formula: see text] is associated in a natural way with a subgroup of [Formula: see text] that contains all right translations. We prove that the groups [Formula: see text], where [Formula: see text], are Schur. Modulo previously obtained results, it follows that every noncyclic Schur [Formula: see text]-group, where [Formula: see text] is an odd prime, is isomorphic to [Formula: see text] or [Formula: see text], [Formula: see text].

scholarly journals Automorphism orbits of finite groups

1986 ◽  
Vol 40 (2) ◽  
pp. 253-260 ◽  
Author(s):  
Thomas J. Laffey ◽  
Desmond MacHale
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Finite Groups ◽  
Prime Power ◽  
Structure Theorem ◽  
Equivalence Classes ◽  
Prime Power Order ◽  
A Finite Group

AbstractLet G be a finite group and let Aut(G) be its automorphism group. Then G is called a k-orbit group if G has k orbits (equivalence classes) under the action of Aut(G). (For g, hG, we have g ~ h if ga = h for some Aut(G).) It is shown that if G is a k-orbit group, then kGp + 1, where p is the least prime dividing the order of G. The 3-orbit groups which are not of prime-power order are classified. It is shown that A5 is the only insoluble 4-orbit group, and a structure theorem is proved about soluble 4-orbit groups.

Subgroups of Central Separable Algebras

1973 ◽  
Vol 25 (4) ◽  
pp. 881-887 ◽  
Author(s):  
E. D. Elgethun
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Division Ring ◽  
Multiplicative Group ◽  
Prime Field ◽  
Odd Order ◽  
Multiplicative Subgroup ◽  
A Finite Group ◽  
Separable Algebras

In [8] I. N. Herstein conjectured that all the finite odd order sub-groups of the multiplicative group in a division ring are cyclic. This conjecture was proved false in general by S. A. Amitsur in [1]. In his paper Amitsur classifies all finite groups which can appear as a multiplicative subgroup of a division ring. Let D be a division ring with prime field k and let G be a finite group isomorphic to a multiplicative subgroup of D.

Tournaments With a Given Automorphism Group

1964 ◽  
Vol 16 ◽  
pp. 485-489 ◽  
Author(s):  
J. W. Moon
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Oriented Graph ◽  
Not Given ◽  
Oriented Graphs ◽  
Vertex Set ◽  
A Finite Group ◽  
Graph Form

The set of all adjacency-preserving automorphisms of the vertex set of a graph form a group which is called the (automorphism) group of the graph. In 1938 Frucht (2) showed that every finite group is isomorphic to the group of some graph. Since then Frucht, Izbicki, and Sabidussi have considered various other properties that a graph having a given group may possess. (For pertinent references and definitions not given here see Ore (4).) The object in this paper is to treat by similar methods a corresponding problem for a class of oriented graphs. It will be shown that a finite group is isomorphic to the group of some complete oriented graph if and only if it has an odd number of elements.

THE NUMBER OF CONJUGACY CLASSES CONTAINED IN NORMAL SUBGROUPS OF SOLVABLE GROUPS

2013 ◽  
Vol 12 (05) ◽  
pp. 1250204
Author(s):  
AMIN SAEIDI ◽  
SEIRAN ZANDI
Keyword(s):  
Finite Group ◽  
Normal Subgroup ◽  
Solvable Groups ◽  
Conjugacy Classes ◽  
Normal Subgroups ◽  
A Finite Group

Let G be a finite group and let N be a normal subgroup of G. Assume that N is the union of ξ(N) distinct conjugacy classes of G. In this paper, we classify solvable groups G in which the set [Formula: see text] has at most three elements. We also compute the set [Formula: see text] in most cases.

Sign in / Sign up

Export Citation Format

Share Document