A Bound on the Number of Conjugacy Classes of a Finite Soluble Group

1987 ◽  
Vol s2-36 (2) ◽  
pp. 229-244 ◽  
Author(s):  
Mark Cartwright
Keyword(s):  
Soluble Group ◽  
Conjugacy Classes ◽  
Finite Soluble Group

Prefrattini Subgroups and Cover-Avoidance Properties in 𝔘-Groups

1975 ◽  
Vol 27 (4) ◽  
pp. 837-851 ◽  
Author(s):  
M. J. Tomkinson
Keyword(s):  
Conjugacy Class ◽  
Soluble Group ◽  
Saturated Formation ◽  
Conjugacy Classes ◽  
Pronormal Subgroup ◽  
Finite Soluble Group ◽  
Factors Associated ◽  
Chief Factors

W. Gaschutz [5] introduced a conjugacy class of subgroups of a finite soluble group called the prefrattini subgroups. These subgroups have the property that they avoid the complemented chief factors of G and cover the rest. Subsequently, these results were generalized by Hawkes [12], Makan [14; 15] and Chambers [2]. Hawkes [12] and Makan [14] obtained conjugacy classes of subgroups which avoid certain complemented chief factors associated with a saturated formation or a Fischer class. Makan [15] and Chambers [2] showed that if W, D and V are the prefrattini subgroup, 𝔍-normalizer and a strongly pronormal subgroup associated with a Sylow basis S, then any two of W, D and V permute and the products and intersections of these subgroups have an explicit cover-avoidance property.

scholarly journals Hypercentral injectors in infinite soluble groups

1979 ◽  
Vol 22 (3) ◽  
pp. 191-194 ◽  
Author(s):  
M. J. Tomkinson
Keyword(s):  
Finite Index ◽  
Soluble Group ◽  
Conjugacy Classes ◽  
Finite Soluble Group ◽  
Covering Property ◽  
Soluble Groups ◽  
Finite Case

The Carter subgroups of a finite soluble group may be characterised either as theself-normalising nilpotent subgroups or as the nilpotent projectors. Subgroups with properties analogous to both of these have been considered by Newell (2, 3) in the class of -groups. The results obtained are necessarily less satisfactory than in the finite case, the subgroups either being almost self-normalising (i.e. having finite index in their normaliser) or having an almost-covering property. Also the subgroups are not necessarily conjugate but lie in finitely many conjugacy classes.

scholarly journals On a relation between the Fitting length of a soluble group and the number of conjugacy classes of its maximal nilpotent subgroups

1969 ◽  
Vol 1 (1) ◽  
pp. 3-10 ◽  
Author(s):  
H. Lausch ◽  
A. Makan
Keyword(s):  
Soluble Group ◽  
Conjugacy Classes ◽  
Finite Soluble Group ◽  
Prime Divisors ◽  
Soluble Groups ◽  
Odd Order ◽  
Fitting Length ◽  
Qualitative Nature ◽  
Positive Integers

In a finite soluble group G, the Fitting (or nilpotency) length h(G) can be considered as a measure for how strongly G deviates from being nilpotent. As another measure for this, the number v(G) of conjugacy classes of the maximal nilpotent subgroups of G may be taken. It is shown that there exists an integer-valued function f on the set of positive integers such that h(G) ≦ f(v(G)) for all finite (soluble) groups of odd order. Moreover, if all prime divisors of the order of G are greater than v(G)(v(G) - l)/2, then h(G) ≦3. The bound f(v(G)) is just of qualitative nature and by far not best possible. For v(G) = 2, h(G) = 3, some statements are made about the structure of G.

On Certain Sublattices of the Lattice of Subgroups Generated by the Prefrattini Subgroups, the Injectors and the Formation Subgroups

1973 ◽  
Vol 25 (4) ◽  
pp. 862-869 ◽  
Author(s):  
A. R. Makan
Keyword(s):  
Conjugacy Class ◽  
Soluble Group ◽  
Conjugacy Classes ◽  
Finite Soluble Group ◽  
Soluble Groups ◽  
Hall Subgroups ◽  
Chief Factors ◽  
Lattice Of Subgroups

Various characteristic conjugacy classes of subgroups having covering/avoidance properties with respect to chief factors have recently played a major role in the study of finite soluble groups. Apart from the subgroups which are now called Hall subgroups, P. Hall [7] also considered the system normalizers of a finite soluble group and showed that these form a characteristic conjugacy class, cover the central chief factors and avoid the rest. The system normalizers were later shown by Carter and Hawkes [1] to be the simplest example of a wealth of characteristic conjugacy classes of subgroups of finite soluble groups which arise naturally as a consequence of the theory of formations.

scholarly journals The Fitting length of a finite soluble group and the number of conjugacy classes of its maximal nilpotent subgroups

1972 ◽  
Vol 6 (2) ◽  
pp. 213-226 ◽  
Author(s):  
A.R. Makan
Keyword(s):  
Upper Bound ◽  
Soluble Group ◽  
Conjugacy Classes ◽  
Finite Soluble Group ◽  
Fitting Length

It is shown that there exists a logarithmic upper bound on the Fitting length h(G) of a finite soluble group G in terms of the number ν(G) of the conjugacy classes of its maximal nilpotent subgroups. For ν(G) = 3, the best possible bound on h(G) is shown to be 4.

The Fitting Length of a Finite Soluble Group and the Number of Conjugacy Classes of its Maximal Metanilpotent Subgroups

1973 ◽  
Vol 16 (2) ◽  
pp. 233-237
Author(s):  
A. R. Makan
Keyword(s):  
Soluble Group ◽  
Conjugacy Classes ◽  
Finite Soluble Group ◽  
Fitting Length ◽  
Prime 2

It is known that the Fitting length h(G) of a finite soluble group G is bounded in terms of the number v(G) of the conjugacy classes of its maximal nilpotent subgroups. For |G| odd, a bound on h(G) in terms of v(G) was discussed in Lausch and Makan [6]. In the case when the prime 2 divides |G|, a logarithmic bound on h(G) in terms of v(G) is obtained in [7]. The main purpose of this paper is to show that the Fitting length of a finite soluble group is also bounded in terms of the number of conjugacy classes of its maximal metanilpotent subgroups. In fact, our result is rather more general.

scholarly journals Some remarks on the computation of conjugacy classes of soluble groups

1989 ◽  
Vol 40 (2) ◽  
pp. 281-292 ◽  
Author(s):  
M. Mecky ◽  
J. Neubüser
Keyword(s):  
Soluble Group ◽  
Conjugacy Classes ◽  
General Algorithm ◽  
Finite Soluble Group ◽  
Soluble Groups

Laue et al have described basic algorithms for computing in a finite soluble group G given by an AG-presentation, among them a general algorithm for the computation of the orbits of such a group acting on some set Ω. Among other applications, this algorithm yields straightforwardly a method for the computation of the conjugacy classes of elements in such a group, which has been implemented in 1986 in FORTRAN within SOGOS by the first author and in 1987 in C within CAYLEY. However, for this particular problem one can do better, as discussed in this note.

A Class of Three-Generator, Three-Relation, Finite Groups

1970 ◽  
Vol 22 (1) ◽  
pp. 36-40 ◽  
Author(s):  
J. W. Wamsley
Keyword(s):  
Nilpotent Group ◽  
Finite Groups ◽  
Soluble Group ◽  
Finite Soluble Group ◽  
Finite Nilpotent Group ◽  
Image Position

Mennicke (2) has given a class of three-generator, three-relation finite groups. In this paper we present a further class of three-generator, threerelation groups which we show are finite.The groups presented are defined as:with α|γ| ≠ 1, β|γ| ≠ 1, γ ≠ 0.We prove the following result.THEOREM 1. Each of the groups presented is a finite soluble group.We state the following theorem proved by Macdonald (1).THEOREM 2. G1(α, β, 1) is a finite nilpotent group.1. In this section we make some elementary remarks.

scholarly journals Enumerating subgroups

1987 ◽  
Vol 43 (2) ◽  
pp. 220-223 ◽  
Author(s):  
R. J. Cook ◽  
James Wiecold ◽  
A. G. Wellamson
Keyword(s):  
Prime Divisor ◽  
Soluble Group ◽  
Maximal Subgroups ◽  
Finite Soluble Group

AbstractIt is proved that a finite soluble group of order n has at most (n − 1)/(q − 1) maximal subgroups, where q is the smallest prime divisor of n.

Sign in / Sign up

Export Citation Format

Share Document