Classification of Groups of Order (p^l)(q^m)(r^n)

In summary, Tom is having trouble with the classification of groups of order 3, 5, and 6. He is looking for online resources that can help him.
  • #1
quantumdude
Staff Emeritus
Science Advisor
Gold Member
5,584
24
Hello,

I'm taking a seminar in group theory, and the main focus of the course is the classification of low-order groups (by classification, I mean finding all of the groups of a given order). I've got the hang of classification of (some) groups G that are products of powers of 2 distinct primes p,q (that is, the order of G is plqm). I'm having trouble when a power of a third prime r is thrown into the mix.

Can anyone point me to any online sources that treat this sort of thing? Specifically, it would be very helpful to find something for p=2, q=3, and r=5.

Thanks,

Tom
 
Physics news on Phys.org
  • #2
You're not going to get one in general, is my gut feeling. The point for p^aq^b, is that we know these are soluble (Burnside). This fails for the products of three primes (|A_5|=4.3.5).

In the case of 2.3.5, at least the group is soluble (any group of order 59 or less is). You can apply Sylow to show one of the p-subgroups is normal (can't remember which), then do something with the semi-direct products of the two smaller sized subgroups.

Of course things like Magma, have small subgroup databases - though I don't know how they are generated. And there huge numbers of groups of given sizes (there are 267 groups of order 64 for instance). Up to what do you wish to classify them? How explicit do you want to be and how much time do you have?http://www.math.usf.edu/~eclark/algctlg/small_groups.html

might be useful (google for 'groups of order 30').
 
Last edited:
  • #3
matt grime said:
Up to what do you wish to classify them? How explicit do you want to be and how much time do you have?

I want to classify them up to isomorphism. In the seminar I am taking our objective is to classify all groups of order 64 or less.

http://www.math.usf.edu/~eclark/algctlg/small_groups.html

might be useful (google for 'groups of order 30').

I'll check it out, thanks.
 
  • #4
I meant how explicit do you want to be in your description of them. Do you want to say that all groups of order 6 are semi-direct products of C_3 with C_2, and there are precisely 2 of them or do you want to write them out with generators and relations? As I said, there are 267 groups of order 64. That is not an easy thing to write down.
 
  • #5
So far it's been very simple. We've not had to cite an isomorphism class that isn't one of the few groups with which we are already familiar ([itex]\mathbb{Z}_n[/itex], the permutations [itex]S_n[/itex], alternating group [itex]A_n[/itex], the dihedrals [itex]D_n[/itex], and the quaternions [itex]Q_n[/itex]). At the moment I'm trying to find the isomorphism classes of groups of order 66, and I don't even know if I have to go beyond that list.
 
  • #6
As I said, Magma, and presumably GAP have complete lists of 'small groups' should you need a reference. GAP is free. Magma has all groups up to order 2048 or something. I would imagine GAP can match it or get very close trying.

EDIT: I checked and it goes up to 2000 in GAP with the exception of groups of order 1024 (Magma also omits this order - I presume there just to many of them)

EDIT EDIT: Yes, there are over 460,000,000 million groups of order 1024.

EDIT EDIT EDIT: There are 4 groups of order 66. All polycyclic. They are

S_3 x C_11
D_22 x C_3
one of type 3:2+11:2 (no, I don't understand the lingo)
C_66EDIT EDIT EDIT EDIT: That oddly described 3rd one is a group with 3 generators, x,y,z and relations

x^2=e, xy^2=yx, zx = xz^10, y^3=e zy=yz, z^11=e,

so it's some extension of C_33 by C_2 (y,z generate a copy of C_33 in there), conjugation by x sends y to y^-1 and z to z^-1.
 
Last edited:
  • #7
Here is a (now better since it omits order 1 and order p a prime) list of

Order Number of groups of that order
4 2
6 2
8 5
9 2
10 2
12 5
14 2
15 1
16 14
18 5
20 5
21 2
22 2
24 15
25 2
26 2
27 5
28 4
30 4
32 51
33 1
34 2
35 1
36 14
38 2
39 2
40 14
42 6
44 4
45 2
46 2
48 52
49 2
50 5
51 1
52 5
54 15
55 2
56 13
57 2
58 2
60 13
62 2
63 4
64 267
65 1
66 4
68 5
69 1
70 4
72 50
74 2
75 3
76 4
77 1
78 6
80 52
81 15
82 2
84 15
85 1
86 2
87 1
88 12
90 10
91 1
92 4
93 2
94 2
95 1
96 231
98 5
99 2
100 16
 
Last edited:
  • #8
order 66, can you find 4 such groups? using Z/6, Z/11 and S(3), one can form 2 direct products and 2 semi direct products.

also every such group has (by sylow) a normal subgroup of order 11 and one of order 3. to show there are no other groups, it would suffice to show every such group has a subgroup of order 6. but probably since the subgroup of order 3 is normal, the element of order 2 should generate a subgroup of order 6 with it.

i think that does it for 66.
 

Related to Classification of Groups of Order (p^l)(q^m)(r^n)

1. What is the classification of groups of order (p^l)(q^m)(r^n)?

The classification of groups of order (p^l)(q^m)(r^n) is a theorem in group theory that states any group of this order can be classified into one of five types: cyclic, abelian non-cyclic, non-abelian with a cyclic Sylow subgroup, non-abelian with a normal Sylow subgroup, and non-abelian with no normal Sylow subgroups. This theorem was proved by William Burnside in 1904.

2. What is the significance of classifying groups of order (p^l)(q^m)(r^n)?

The classification of groups of order (p^l)(q^m)(r^n) is significant because it gives a framework for understanding the structure of groups of this order. This theorem helps to simplify the study of groups and provides a starting point for further research and applications in other areas of mathematics.

3. How is the classification of groups of order (p^l)(q^m)(r^n) related to Sylow's theorems?

The classification of groups of order (p^l)(q^m)(r^n) is closely related to Sylow's theorems. Sylow's first theorem states that for any prime factor p of the order of a group G, there exists a subgroup of G of order p^k for some k. This theorem is used to classify groups into the five types mentioned in question 1. Sylow's third theorem is also used in the proof of this classification theorem.

4. Can the classification of groups of order (p^l)(q^m)(r^n) be extended to other types of groups?

Yes, the classification of groups of order (p^l)(q^m)(r^n) can be extended to other types of groups. For example, the theorem can be extended to classify groups of order p^nq^m where p and q are distinct primes, and n and m are positive integers. This classification theorem has also been extended to other types of groups, such as solvable groups and finite simple groups.

5. What are the applications of the classification of groups of order (p^l)(q^m)(r^n)?

The classification of groups of order (p^l)(q^m)(r^n) has many applications in mathematics, particularly in the study of finite groups. It has been used to prove other theorems, such as the Feit-Thompson theorem, which states that every finite group of odd order is solvable. This classification theorem has also been applied in other areas, such as coding theory, cryptography, and number theory.

Similar threads

  • Linear and Abstract Algebra
Replies
11
Views
1K
  • Linear and Abstract Algebra
Replies
17
Views
4K
  • Linear and Abstract Algebra
Replies
1
Views
1K
Replies
3
Views
2K
  • Linear and Abstract Algebra
Replies
2
Views
1K
  • Linear and Abstract Algebra
Replies
9
Views
2K
  • Linear and Abstract Algebra
Replies
1
Views
2K
  • Calculus and Beyond Homework Help
Replies
3
Views
615
Replies
9
Views
6K
  • Linear and Abstract Algebra
Replies
2
Views
2K
Back
Top