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 Lower central depth in finitely generated soluble-by-finite groups

1978 ◽  
Vol 19 (2) ◽  
pp. 153-154 ◽  
Author(s):  
John C. Lennox
Keyword(s):  
Finite Number ◽  
Nilpotent Group ◽  
Finite Groups ◽  
Soluble Group ◽  
Finite Depth ◽  
Lower Central Series ◽  
Central Series ◽  
Finitely Generated ◽  
Central Depth

We say that a group G has finite lower central depth (or simply, finite depth) if the lower central series of G stabilises after a finite number of steps.In [1], we proved that if G is a finitely generated soluble group in which each two generator subgroup has finite depth then G is a finite-by-nilpotent group. Here, in answer to a question of R. Baer, we prove the following stronger version of this result.

scholarly journals Finite groups of deficiency zero involving the Lucas numbers

1990 ◽  
Vol 33 (1) ◽  
pp. 1-10 ◽  
Author(s):  
C. M. Campbell ◽  
E. F. Robertson ◽  
R. M. Thomas
Keyword(s):  
Finite Groups ◽  
Soluble Group ◽  
Fibonacci Number ◽  
Single Parameter ◽  
The Other ◽  
Finite Soluble Group ◽  
Lucas Numbers ◽  
Lucas Number ◽  
Derived Length ◽  
New Class

In this paper, we investigate a class of 2-generator 2-relator groups G(n) related to the Fibonacci groups F(2,n), each of the groups in this new class also being defined by a single parameter n, though here n can take negative, as well as positive, values. If n is odd, we show that G(n) is a finite soluble group of derived length 2 (if n is coprime to 3) or 3 (otherwise), and order |2n(n + 2)gnf(n, 3)|, where fn is the Fibonacci number defined by f0=0,f1=1,fn+2=fn+fn+1 and gn is the Lucas number defined by g0 = 2, g1 = 1, gn+2 = gn + gn+1 for n≧0. On the other hand, if n is even then, with three exceptions, namely the cases n = 2,4 or –4, G(n) is infinite; the groups G(2), G(4) and G(–4) have orders 16, 240 and 80 respectively.

scholarly journals Finite one-relator products of two cyclic groups with the relator of arbitrary length

1992 ◽  
Vol 53 (3) ◽  
pp. 352-368 ◽  
Author(s):  
C. M. Campbell ◽  
P. M. Heggie ◽  
E. F. Robertson ◽  
R. M. Thomas
Keyword(s):  
Finite Group ◽  
Soluble Group ◽  
Finite Soluble Group ◽  
Arbitrary Length ◽  
Cyclic Groups ◽  
Image Position ◽  
A Finite Group

AbstractIn this paper we consider the groups G = G(α, n) defined by the presentations . We derive a formula for [G′: ″] and determine the order of G whenever n ≦ 7. We show that G is a finite soluble group if n is odd, but that G can be infinite when n is even, n ≧ 8. We also show that G(6, 10) is a finite insoluble group involving PSU(3, 4), and that the group H with presentation is a finite group of deficiency zero of order at least 114,967,210,176,000.

scholarly journals FINITE GROUPS WITH THE SAME JOIN GRAPH AS A FINITE NILPOTENT GROUP

2020 ◽  
pp. 1-11
Author(s):  
ANDREA LUCCHINI
Keyword(s):  
Finite Group ◽  
Nilpotent Group ◽  
Finite Groups ◽  
Finite Nilpotent Group ◽  
Join Graph ◽  
A Finite Group

Abstract Given a finite group G, we denote by Δ(G) the graph whose vertices are the proper subgroups of G and in which two vertices H and K are joined by an edge if and only if G = ⟨H, K⟩. We prove that if there exists a finite nilpotent group X with Δ(G) ≅ Δ(X), then G is supersoluble.

scholarly journals Odd order nilpotent groups of class two with cyclic centre

1974 ◽  
Vol 17 (2) ◽  
pp. 142-153 ◽  
Author(s):  
Y. K. Leong
Keyword(s):  
Nilpotent Group ◽  
Direct Product ◽  
Finite Groups ◽  
Cyclic Subgroup ◽  
Nilpotent Groups ◽  
Isomorphism Problem ◽  
Nilpotency Class ◽  
Central Product ◽  
Odd Order ◽  
Image Position

The isomorphism problem for finite groups of odd order and nilpotency class 2 with cyclic centre will be solved using some results of Brady [1], [2]. Since a finite nilpotent group is the direct product of its Sylow subgroups, we only need to consider finite q-groups where q is a prime. It has been shown in [1] and [2] that a finite q-group of nilpotency class 2 with cyclic centre is a central product either of two-generator subgroups with cyclic centre or of two-generator subgroups with cyclic centre and a cyclic subgroup, and that the q-groups of class 2 on two generators with cyclic centre comprise the following list: , and if q = 2 we have as well .

ON A LATTICE CHARACTERISATION OF FINITE SOLUBLE PST-GROUPS

2019 ◽  
Vol 101 (2) ◽  
pp. 247-254 ◽  
Author(s):  
ZHANG CHI ◽  
ALEXANDER N. SKIBA
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Soluble Group ◽  
Nilpotent Groups ◽  
Chief Factor ◽  
Finite Soluble Group ◽  
A Finite Group

Let $\mathfrak{F}$ be a class of finite groups and $G$ a finite group. Let ${\mathcal{L}}_{\mathfrak{F}}(G)$ be the set of all subgroups $A$ of $G$ with $A^{G}/A_{G}\in \mathfrak{F}$. A chief factor $H/K$ of $G$ is $\mathfrak{F}$-central in $G$ if $(H/K)\rtimes (G/C_{G}(H/K))\in \mathfrak{F}$. We study the structure of $G$ under the hypothesis that every chief factor of $G$ between $A_{G}$ and $A^{G}$ is $\mathfrak{F}$-central in $G$ for every subgroup $A\in {\mathcal{L}}_{\mathfrak{F}}(G)$. As an application, we prove that a finite soluble group $G$ is a PST-group if and only if $A^{G}/A_{G}\leq Z_{\infty }(G/A_{G})$ for every subgroup $A\in {\mathcal{L}}_{\mathfrak{N}}(G)$, where $\mathfrak{N}$ is the class of all nilpotent groups.

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 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.

scholarly journals A Remark on the Orthogonality Relations in the Representation Theory of Finite Groups

1959 ◽  
Vol 11 ◽  
pp. 59-60 ◽  
Author(s):  
Hirosi Nagao
Keyword(s):  
Finite Group ◽  
Irreducible Representation ◽  
Representation Theory ◽  
Finite Groups ◽  
Characteristic Zero ◽  
Orthogonality Relations ◽  
Schur’S Lemma ◽  
Image Position ◽  
A Finite Group ◽  
Schur's Lemma

Let G be a finite group of order g, andbe an absolutely irreducible representation of degree fμ over a field of characteristic zero. As is well known, by using Schur's lemma (1), we can prove the following orthogonality relations for the coefficients :1It is easy to conclude from (1) the following orthogonality relations for characters:whereand is 1 or 0 according as t and s are conjugate in G or not, and n(t) is the order of the normalize of t.

Sign in / Sign up

Export Citation Format

Share Document