scholarly journals Automorphisms of Finite Groups and their Fixed-Point Groups

1969 ◽  
Vol 9 (3-4) ◽  
pp. 467-477 ◽  
Author(s):  
J. N. Ward
Keyword(s):  
Fixed Point ◽  
Finite Group ◽  
Abelian Group ◽  
Finite Groups ◽  
Upper Bound ◽  
Prime Order ◽  
Soluble Group ◽  
Point Groups ◽  
Derived Series ◽  
A Finite Group

Let G denote a finite group with a fixed-point-free automorphism of prime order p. Then it is known (see [3] and [8]) that G is nilpotent of class bounded by an integer k(p). From this it follows that the length of the derived series of G is also bounded. Let l(p) denote the least upper bound of the length of the derived series of a group with a fixed-point-free automorphism of order p. The results to be proved here may now be stated: Theorem 1. Let G denote a soluble group of finite order and A an abelian group of automorphisms of G. Suppose that (a) ∣G∣ is relatively prime to ∣A∣; (b) GAis nilpotent and normal inGω, for all ω ∈ A#; (c) the Sylow 2-subgroup of G is abelian; and (d) if q is a prime number andqk+ 1 divides the exponent of A for some integer k then the Sylow q-subgroup of G is abelian.

A GENERALIZED FIXED-POINT-FREE ACTION

2012 ◽  
Vol 12 (03) ◽  
pp. 1250172
Author(s):  
İSMAİL Ş. GÜLOĞLU ◽  
GÜLİN ERCAN
Keyword(s):  
Fixed Point ◽  
Finite Group ◽  
Solvable Group ◽  
Upper Bound ◽  
Prime Order ◽  
Free Action ◽  
Group A ◽  
Point Free Action ◽  
A Finite Group ◽  
Coprime Order

In this paper we study the structure of a finite group G admitting a solvable group A of automorphisms of coprime order so that for any x ∈ CG(A) of prime order or of order 4, every conjugate of x in G is also contained in CG(A). Under this hypothesis it is proven that the subgroup [G, A] is solvable. Also an upper bound for the nilpotent height of [G, A] in terms of the number of primes dividing the order of A is obtained in the case where A is abelian.

Conjugate p-Subgroups of Finite Groups

1972 ◽  
Vol 24 (1) ◽  
pp. 17-28
Author(s):  
John J. Currano
Keyword(s):  
Finite Group ◽  
Abelian Group ◽  
Finite Groups ◽  
Nilpotence Class ◽  
A Finite Group

Throughout this paper, let p be a prime, P be a p-group of order pt , and ϕ be an isomorphism of a subgroup R of P of index p onto a subgroup Q which fixes no non-identity subgroup of P, setwise. In [2, Lemma 2.2], Glauberman shows that P can be embedded in a finite group G such that ϕ is effected by conjugation by some element g of G. We assume that P is thus embedded. Then Q = P ∩ Pg. Let H = 〈P,Pg〉 and V = [H,Z(Q)], so Q ⊲ H and V ⊲ H.Let E(p) be the non-abelian group of order p3 which is generated by two elements of order p. Then E(p) is dihedral if p = 2 and has exponent p if p is odd. If p is odd, then E* (p) is defined in § 2 to be a particular group of order p6 and nilpotence class three.

scholarly journals ON THE NUMBER OF PRIME ORDER SUBGROUPS OF FINITE GROUPS

2009 ◽  
Vol 87 (3) ◽  
pp. 329-357 ◽  
Author(s):  
TIMOTHY C. BURNESS ◽  
STUART D. SCOTT
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Prime Order ◽  
A Finite Group

AbstractLet G be a finite group and let δ(G) be the number of prime order subgroups of G. We determine the groups G with the property δ(G)≥∣G∣/2−1, extending earlier work of C. T. C. Wall, and we use our classification to obtain new results on the generation of near-rings by units of prime order.

scholarly journals The Chromatic Number of Finite Group Cayley Tables

10.37236/7874 ◽  
2019 ◽  
Vol 26 (1) ◽  
Author(s):  
Luis Goddyn ◽  
Kevin Halasz ◽  
E. S. Mahmoodian
Keyword(s):  
Finite Group ◽  
Abelian Group ◽  
Chromatic Number ◽  
Finite Groups ◽  
Upper Bound ◽  
Latin Square ◽  
Finite Abelian Groups ◽  
Cayley Table ◽  
Minimum Number ◽  
Cayley Tables

The chromatic number of a latin square $L$, denoted $\chi(L)$, is the minimum number of partial transversals needed to cover all of its cells. It has been conjectured that every latin square satisfies $\chi(L) \leq |L|+2$. If true, this would resolve a longstanding conjecture—commonly attributed to Brualdi—that every latin square has a partial transversal of size $|L|-1$. Restricting our attention to Cayley tables of finite groups, we prove two results. First, we resolve the chromatic number question for Cayley tables of finite Abelian groups: the Cayley table of an Abelian group $G$ has chromatic number $|G|$ or $|G|+2$, with the latter case occurring if and only if $G$ has nontrivial cyclic Sylow 2-subgroups. Second, we give an upper bound for the chromatic number of Cayley tables of arbitrary finite groups. For $|G|\geq 3$, this improves the best-known general upper bound from $2|G|$ to $\frac{3}{2}|G|$, while yielding an even stronger result in infinitely many cases.

Finite Groups with Certain S-Permutable and GS-Maximal Subgroups

2020 ◽  
Vol 27 (04) ◽  
pp. 661-668
Author(s):  
A.M. Elkholy ◽  
M.H. Abd-Ellatif
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Sylow Subgroup ◽  
Prime Order ◽  
Maximal Subgroups ◽  
A Finite Group

Let G be a finite group and H a subgroup of G. We say that H is S-permutable in G if H permutes with every Sylow subgroup of G. A group G is called a generalized smooth group (GS-group) if [G/L] is totally smooth for every subgroup L of G of prime order. In this paper, we investigate the structure of G under the assumption that each subgroup of prime order is S-permutable if the maximal subgroups of G are GS-groups.

Size of free groups in varieties generated by finite groups

2019 ◽  
Vol 29 (08) ◽  
pp. 1419-1430
Author(s):  
William Cocke
Keyword(s):  
Finite Group ◽  
Free Group ◽  
Finite Groups ◽  
Prime Order ◽  
Free Groups ◽  
Affine Group ◽  
Alternating Group ◽  
A Finite Group

The number of distinct [Formula: see text]-variable word maps on a finite group [Formula: see text] is the order of the rank [Formula: see text] free group in the variety generated by [Formula: see text]. For a group [Formula: see text], the number of word maps on just two variables can be quite large. We improve upon previous bounds for the number of word maps over a finite group [Formula: see text]. Moreover, we show that our bound is sharp for the number of 2-variable word maps over the affine group over fields of prime order and over the alternating group on five symbols.

scholarly journals Finite groups admitting fixed point free automorphisms of order pq

1987 ◽  
Vol 30 (1) ◽  
pp. 51-56 ◽  
Author(s):  
Cheng Kai-Nah
Keyword(s):  
Fixed Point ◽  
Finite Group ◽  
Finite Groups ◽  
Fitting Height ◽  
A Finite Group

By the results of Rickman [7] and Ralston [6], a finite group G admitting a fixed point free automorphism α of order pq, where p and q are primes, is soluble. If p = q, then |G| is necessarily coprime to |α|, and it follows from Berger [1] that G has Fitting height at most 2, the composition length of <α>. The purpose of this paper is to prove a corresponding result in the case when p≠q.

New characterizations of p-soluble and p-supersoluble finite groups

2012 ◽  
Vol 49 (3) ◽  
pp. 390-405
Author(s):  
Wenbin Guo ◽  
Alexander Skiba
Keyword(s):  
Finite Group ◽  
Normal Subgroup ◽  
Maximal Subgroup ◽  
Finite Groups ◽  
Prime Order ◽  
Cyclic Subgroup ◽  
Sylow Subgroups ◽  
Quasinormal Subgroup ◽  
A Finite Group

Let G be a finite group and H a subgroup of G. H is said to be S-quasinormal in G if HP = PH for all Sylow subgroups P of G. Let HsG be the subgroup of H generated by all those subgroups of H which are S-quasinormal in G and HsG the intersection of all S-quasinormal subgroups of G containing H. The symbol |G|p denotes the order of a Sylow p-subgroup of G. We prove the followingTheorem A. Let G be a finite group and p a prime dividing |G|. Then G is p-supersoluble if and only if for every cyclic subgroup H ofḠ (G) of prime order or order 4 (if p = 2), Ḡhas a normal subgroup T such thatHsḠandH∩T=HsḠ∩T.Theorem B. A soluble finite group G is p-supersoluble if and only if for every 2-maximal subgroup E of G such that Op′ (G) ≦ E and |G: E| is not a power of p, G has an S-quasinormal subgroup T with cyclic Sylow p-subgroups such that EsG = ET and |E ∩ T|p = |EsG ∩ T|p.Theorem C. A finite group G is p-soluble if for every 2-maximal subgroup E of G such that Op′ (G) ≦ E and |G: E| is not a power of p, G has an S-quasinormal subgroup T such that EsG = ET and |E ∩ Tp = |EsG ∩ T|p.

scholarly journals Finite Groups with All Maximal Subgroups of Prime or Prime Square Index

1964 ◽  
Vol 16 ◽  
pp. 435-442 ◽  
Author(s):  
Joseph Kohler
Keyword(s):  
Finite Group ◽  
Maximal Subgroup ◽  
Finite Groups ◽  
Prime Order ◽  
Maximal Subgroups ◽  
Odd Order ◽  
Order Case ◽  
Chief Factors ◽  
Even Order ◽  
A Finite Group

In this paper finite groups with the property M, that every maximal subgroup has prime or prime square index, are investigated. A short but ingenious argument was given by P. Hall which showed that such groups are solvable.B. Huppert showed that a finite group with the property M, that every maximal subgroup has prime index, is supersolvable, i.e. the chief factors are of prime order. We prove here, as a corollary of a more precise result, that if G has property M and is of odd order, then the chief factors of G are of prime or prime square order. The even-order case is different. For every odd prime p and positive integer m we shall construct a group of order 2apb with property M which has a chief factor of order larger than m.

scholarly journals B.H. Neumann's Question on Ensuring Commutativity of Finite Groups

2006 ◽  
Vol 74 (1) ◽  
pp. 121-132 ◽  
Author(s):  
A. Abdollahi ◽  
A. Azad ◽  
A. Mohammadi Hassanabadi ◽  
M. Zarrin
Keyword(s):  
Finite Group ◽  
Exponential Function ◽  
Finite Groups ◽  
Upper Bound ◽  
Partial Answer ◽  
A Finite Group

This paper is an attempt to provide a partial answer to the following question put forward by Bernhard H. Neumann in 2000: “Let G be a finite group of order g and assume that however a set M of m elements and a set N of n elements of the group is chosen, at least one element of M commutes with at least one element of N. What relations between g, m, n guarantee that G is Abelian?” We find an exponential function f(m,n) such that every such group G is Abelian whenever |G| > f(m,n) and this function can be taken to be polynomial if G is not soluble. We give an upper bound in terms of m and n for the solubility length of G, if G is soluble.

Sign in / Sign up

Export Citation Format

Share Document