Tutorial Sheet : 2

Course Code : BMAT205L

Course Title : Discrete Mathematics and Graph Theory

Module 2: Algebraic Structures

EASY

1. Find the minimum distance of the given code words x = 10110, y = 11110 and z = 10011.

Solution: Hint:Find Hamming distances between all pairs of encoded words

2. Given the generator matrix  

1 0 0 0 1 1 0
0 1 0 0 1 0 1
 
G=
 
0 0 1 0 0 1 1

 
0 0 0 1 1 1 1
corresponding to the encoding function e : B4 → B7 , find the corresponding parity check matrix
and use it to decode the following received words and hence, to find the original message. Are
all the words decoded uniquely?
(i)1100001, (ii) 1110111, (iii) 0010001, (iv) 0011100.

Solution: original message is (i) 1100, (ii) 1110, (iii) 0010 (iv) 0011

3. Construct the decoding table for the group code given by the generator matrix

1 0 0 1 1 0


G =  0 1 0 0 1 1 .
0 0 1 1 0 1

Decode the following received words using the decoding table obtained. Which of the words
could not be decoded uniquely?
(i)101111, (ii) 011010, (iii) 101110, (iv) 111111

Solution: (i) 100 (ii) 010 (iii) 001 (iv) 110 (v) 101 (vi) 011.

4. Show that the Mapping f : Z → G , from set of integer under the operation addition to the group
G = {1, −1} under the operation multiplication defined as
(
1, if x is even
f ( x) = is a homomorphism.
−1, if x is odd

Solution: Hint: Use f ( x + y) = f ( x). f ( y)

5. If G is the additive group of integers and H is the subgroup of G obtained by multiplying each
element of G by 3, find the distinct right cosets of H in G .
 Solution: Hint: Totally 3 distinct cosets could be found.

6. Let N be the set of natural numbers. Check whether ∗ is an associative operation

(a) a ∗ b = a + 2 b
(b) a ∗ b = max{a, b}

Solution: (a) No (b) Yes

7. What will be order of any element in a group of order 7? Justify.

Solution: Hint: Use Lagrange’s Theorem

8. If R is the set of real numbers and ∗ is the operation defined by a ∗ b = a + b + 3ab, where a, b ∈ R,
show that (R, ∗) is a monoid. Is the operation commutative? Do all the elements have an inverse?

9. Find the order of each element of the multiplication group G = {a, a2 , a3 , a4 , a5 , a6 = e}.

Solution: o(a) = 6, o(a2 ) = 3, o(a3 ) = 2, o(a4 ) = 3, o(a5 ) = 6, o(a6 ) = 1

10. Show that the set of permutations

µ ¶ µ ¶ µ ¶ µ ¶
a b c d a b c d a b c d a b c d
{ , , , }
a b c d b a c d a b d c b a d c

forms a group.

MODERATE

11. If G be an abelian group with identity e, then prove that all elements x of G satisfying the
equation x2 = e forms a sub-group H of G .

Solution: Hint: Based on definition of subgroup, it can be proved

12. If a be a fixed element of the group G , then show that the set N (a) = { x ∈ G | xa = ax} is a
sub-group of G .

Solution: Hint: Based on Theorem: Necessary and sufficient condition for a non empty
subset H of a group to be a subgroup, it can be proved.

13. If G is the additive group of integers and H is a subgroup of G , defined by H = {5 x/where x ∈ G },

find the distinct left cosets of H in G .

Page 2
 Solution: Total number distinct cosets will be 5.

14. Check if the set S = {1, 2, 3, 4} forms a group for the operation multiplication modulo 5.

Solution: Hint: Check all properties of group.

µ ¶ µ ¶
1 2 3 4 5 6 1 2 3 4 5 6
15. If α = and β = are two elements of the symmetric group
3 1 5 4 6 2 5 3 1 6 2 4
S 6 , find αβ, βα, α2 , β2 , α−1 and β−1 .

16. Solve the equation α x = β, if the permutations of the elements of 1, 2, 3, 4, 5 are given by
µ ¶ µ ¶
1 2 3 4 5 1 2 3 4 5
α= and β = .
2 3 1 4 5 1 2 3 5 4
Also, find βα and α−1 .
µ ¶ µ ¶
1 2 3 4 1 2 3 4
17. If α = and β = are two elements of the symmetric group S 4 , find αβ,
3 4 2 1 2 4 3 1
βα, α2 , α−1

18. The generating matrix of an encoding function E : Z23 → Z26 is given by


1 0 0 1 1 0


G = 0 1 0 0 1 1
0 0 1 1 0 1

i. Find the code words assigned to 110 and 010.

ii. Obtain associated parity-check matrix.

iii. Decode the message 111111 by using H.


1 0 1 1 0 0


Solution: ( ii ) H=1 1 0 0 1 0
0 1 1 0 0 1


1 0 1 1 0 0


19. The parity-check matrix for an encoding function E : Z23 → Z26 is given by G = 1 1 0 0 1 0
1 0 1 0 0 1

i. Determine the associated generator matrix.

ii. Does this code correct all single errors in transmission? Justify.

Solution:

1 0 0 1 1 1


i. 0 1 0 0 1 0
0 0 1 1 0 1

Page 3
 − C ∗ defined by f ( x) = e x is a homomorphism. Also, find kernel of f .
20. Show that f : ℜ+ →

Solution: Kernel 2π n

HARD
 
0 1 0 1 0 0 0
 1 0 1 0 1 0 0 
 
21. Prove that the code words generated by the parity check matrix H = 
 0 0 1 0 0 1 0 

1 0 0 0 0 0 1
3 7
with respect to encoding function e : B −→ B with respect to the parity check matrix form a
group with respect to the operation ⊕.

Solution: Hint: Find all the code words. Prove all the four properties of a group.

22. If G is the multiplicative group of all ( n × n) non-singular matrices whose elements are real
numbers and G ′ is the multiplicative group of all non-zero real numbers, show that the mapping
f : G → G ′ , where f ( A ) = | A |, for all A ∈ G is a homomorphism. .

Solution: Hint:use f ( AB) = f ( A ). f (B)

23. Let G = ( Z, +), G ′ = (2 Z, +) and a mapping φ : G → G ′ be defined by φ(a) = 2a, a in G. Examine

if φ is a homomorphism.

Solution: Hint: φ(a + b) = φ(a) + φ( b)

24. Let G = S 3 be the permutation group on three symbols a, b, c and

½µ ¶ µ ¶¾
a b c a b c
H= ,
a b c a c b

be a subgroup of G, find the value of H f and f H , where

µ ¶
a b c
f= ∈G
c b a

25. Let G = a, a2 , a3 , a4 , = 1 , o(G) = 4, H = 1, a2 is a sub-group of G. Find all the cosets of H in G

© ª © ª

and prove that G is equal to union of all these cosets and also establish that any two cosets are
either disjoint or identical.

Solution: Two distinct cosets = H, aH.

26. Find out the generators, if any, of the group: (i) {(1, 2, 3, 4, 5, 7, 8), ×7 } and (ii) {(1, 2, 4, 5, 7, 8), ×9 }.

Page 4
 Solution: (i) 2,3,5 and (ii) 2, 5

27. Let ( H, ∗) be a subgroup of a group (G, ∗). Let N = { x| x ∈ G, xHx−1 = H }. Show that ( N, ∗) is a
subgroup of (G, ∗).

28. An element a ∈ S , where (S, ∗) is a semigroup, is called left cancellable if for all x, y ∈ S, a ∗ x =
a ∗ y → x = y. Show that a and b are left cancellable then a ∗ b is also cancellable.

29. Let f and g be homomorphisms from group (G, ∗) to group ( H, o). Show that (C, ∗) is a subgroup
of (G, ∗), where C = { x ∈ G, f ( x) = g( x)}.

30. Prove that the set G of all rational numbers other than 1 with the operation defined by a ∗ b =
a + b − ab forms an abelian group.

Page 5