Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Homework 5 Solution
Chapter 5 - Permutation groups.
due: Oct. 17.
1. Let
" # " #
1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8
= , = .
3 4 1 2 6 7 5 8 6 5 4 1 3 2 8 7
= (13)(24)(57)(56), = (14)(13)(15)(12)(16)(78),
= (15)(18)(17)(23)(24)(26).
|| = lcm(2, 2, 3) = 6, || = lcm(6, 2) = 6.
2. Let
= (1357)(462), = (265)(13)(47).
1
MATH 3005 Homework Han-Bom Moon
3. (a) Find the maximum of || for S10 . Find an element of S10 with the
maximum order.
{10, 9 + 1, 8 + 2, 8 + 1 + 1, 7 + 3, 7 + 2 + 1, 7 + 1 + 1 + 1, 6 + 4, 6 + 3 + 1, 6 + 2 + 2,
6 + 2 + 1 + 1, 6 + 1 + 1 + 1 + 1, 5 + 5, 5 + 4 + 1, 5 + 3 + 2, 5 + 3 + 1 + 1, 5 + 2 + 2 + 1,
5+2+1+1+1, 5+1+1+1+1+1, 4+4+2, 4+4+1+1, 4+3+3, 4+3+2+1,
4+3+1+1+1, 4+2+2+2, 4+2+2+1+1, 4+2+1+1+1+1, 4+1+1+1+1+1+1,
3 + 3 + 3 + 1, 3 + 3 + 2 + 2, 3 + 3 + 2 + 1 + 1, 3 + 3 + 1 + 1 + 1 + 1, 3 + 2 + 2 + 2 + 1,
3+2+2+1+1+1, 3+2+1+1+1+1+1, 3+1+1+1+1+1+1+1, 2+2+2+2+2,
2 + 2 + 2 + 2 + 1 + 1, 2 + 2 + 2 + 1 + 1 + 1 + 1, 2 + 2 + 1 + 1 + 1 + 1 + 1 + 1,
2 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1, 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1}.
In each case, if we compute the least common multiple of the integers, then
the maximum occurs when 5 + 3 + 2, and lcm(5, 3, 2) = 30. Therefore the
maximum order is 30 and = (12345)(678)(9, 10) is an element of the order.
20
[
(b) Among elements of Sn , find the maximum order and an element with
n=2
the maximum order. (If you are really interested in, try to make a computer
program calculating m(n) := the maximum order of an element in Sn , for
n 100. Can you find any patterns?)
Many of students successfully made some computer code to find the maxi-
mum order. It seems that this computation is too lengthy and heavy to do
by your hands, but you may realize that actually the most part of the com-
putation above is redundant. Here are several observations to reduce the
computation.
Step 1. It is sufficient to consider partitions with1out repeated integers, be-
cause the repeated integers do not affect on the least common multiple. So
we may assume that a1 > a2 > > ak for a given partition a1 +a2 + +ak .
2
MATH 3005 Homework Han-Bom Moon
{20, 19, 18, 17+3, 16+3, 15+4, 14+5, 14+3, 13+7, 13+5+2, 13+4+3, 13+3+2,
Note that the constant map Id has the property that Id(x) = x, so Id stab(x)
and stab(x) 6= . If , stab(x), then (x) = ((x)) = (x) = x. Therefore
stab(x). Also if stab(x), then 1 (x) = 1 ((x)) = (1 )(x) =
Id(x) = x. So 1 stab(x). Thus stab(x) G.
3
MATH 3005 Homework Han-Bom Moon
It is clear that R0 , R180 , H, V are even permutations and D, D0 are odd per-
mutations. Now R90 = (14)(13)(12) and R270 = (12)(13)(14), so they are
odd permutations, too.
7. Let G be a subgroup of Sn .
(a) If there is an odd permutation G, then show that exactly half of the
elements of G are even. (How can we show the fact that the given set has an
even number of elements?)
Let E be the set of even permutations in G, and let O be the set of odd
permutations in G. Define a map f : E O, as f () = . This map is well-
defined, because a product of an odd permutation and an even permutation
is odd. f is one-to-one, because
f (1 ) = f (2 ) 1 = 2 1 = 2
from the cancellation of . The map f is onto because for every odd permu-
tation O, 1 E and f (1 ) = 1 = . So f is a bijection and
|E| = |O|. So we have |G| = |E| + |O| = 2|E| and |G| is even.
(b) Suppose that G has odd number of elements. Show that G An . (Hint: Use
(a).)
If G has an odd permutation, then |G| must be even by (a). So if |G| is odd,
then all elements of G are even permutations. Therefore G An .