Professional Documents
Culture Documents
Discrete Mathematics
Mathematics
Imperial College London
ii
These notes are based on a course of lectures given by Professor Liebeck during Autumn Term 2007 at
Imperial College London. In general the notes follow the lectures very closely and only few changes
were made mostly to make the typesetting easier.
These notes have not been checked by Professor Liebeck and should not be regarded as official notes
for the course. In particular, all the errors are made by me. However, I dont take any responsibility for
their consequences; use at your own risk (and attend lectures, they are fun).
Please email me at as1005@ic.ac.uk with any comments or corrections.
Anton Stefanek
March 2008
CONTENTS
iii
Contents
1 Introduction
1.1 Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1.2 Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1.3 Designs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2 Error-correcting codes
2.1 Code correction . . . . . . . . . . . . . . .
2.2 Linear codes . . . . . . . . . . . . . . . . .
2.3 The Check Matrix . . . . . . . . . . . . . .
2.3.1 Check matrix and error correction
2.4 Hamming codes . . . . . . . . . . . . . . .
2.5 Correcting one error . . . . . . . . . . . .
2.6 Correcting more than one error . . . . . .
2.7 The Hamming Bound . . . . . . . . . . .
2.8 Codes correcting 1 error . . . . . . . . . .
2.9 Perfect Codes . . . . . . . . . . . . . . . .
2.10 Gilbert-Varshamov bound . . . . . . . . .
2.11 The Golay Code . . . . . . . . . . . . . . .
2.11.1 Some numerology for G 24 and G 23
1
1
2
2
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
5
5
6
7
8
9
9
9
11
12
12
13
14
17
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
19
22
22
23
28
4 Designs
4.1 Theory of 2-designs . . . . . . . .
4.1.1 Incidence matrix . . . . .
4.1.2 Symmetric 2-designs . . .
4.2 Difference sets . . . . . . . . . . .
4.2.1 A family of difference sets
4.3 Affine Planes . . . . . . . . . . . .
4.4 Projective planes . . . . . . . . .
4.5 Higher-dimensional geometry .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
31
32
32
34
35
35
36
37
38
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
5 Some connections
41
5.1 Isomorphisms of designs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
iv
CONTENTS
1. INTRODUCTION
Chapter 1
Introduction
Algebraic combinatorics we will study
1. error-correcting codes (subsets of Zn2 ),
2. graphs (vertices and edges),
3. designs.
These are combinatorial objects. We will study them using linear algebra (vector spaces, matrix theory,
eigenvalues,. . . ) and a little group theory.
Prerequisites none, except a bit of memory.
Books,office hours see www.ma.ic.ac.uk/ mwl.
Coursework 1 piece.
1.1 Codes
Code is a language for machine communication. The alphabet consists of 0, 1, the words are selected
strings of characters from the alphabet. Recall that
Z2 = {0, 1}
alphabet
word
Z2
length
1. INTRODUCTION
1.2 Graphs
graph
vertices
edges
neighbours
regular
valency
A graph consists of a set V of vertices and a set E edges of pairs of vertices. We denote this as = (V, E ).
Example. V = {1, 2, 3}, E = {{1, 2} , {1, 3}}.
For any vertex x V , the neighbours of x are the vertices joined to x by an edge.
Definition. Graph is regular if every vertex has the same number of neighbours. Call this number the
valency of .
Example.
Petersen graph
The square is strongly regular, valency 2, a = 0, b = 2. The pentagon is strongly regular too, valency 2,
a = 0, b = 1. The hexagon is regular, but not strongly regular. The Petersen graph has valency 3, a = 0,
b = 1.
Here is a theorem we will prove using the theory of strongly regular graphs:
Theorem 1.1 (Friendship theorem). In a community where any 2 people have exactly 1 mutual acquaintance, there is someone who knows everybody. That is, if in a graph every two vertices have exactly one
common neighbour, there is a vertex joined to all the other vertices of the graph.
The only known proof uses lots of linear algebra.
1.3 Designs
Manufacturer makes products in v varieties. Consumers test these for fairness:
(1) each consumer tests the same number k of varieties,
(2) each variety is tested by the same number r of consumers.
1. INTRODUCTION
C1
1234
C2
5678
C3
1357
C4
2468
C5
1247
C6
3568
Definition. Let X be a set, |X | = v and let B be a collection of subsets of X , all of size k. Then B is a
design if every element of X lies in the same number r of subsets in B. The subsets in B are the blocks
of the design. The parameters are (v, k, r ).
Example. In the above example, X = {1, 2, . . . , 8} with
B = {{1, 2, 3, 4} , {5, 6, 7, 8} , . . . }.
design
blocks
parameters
vr
k
vr
k
v
k .
Definition. A design B is a 2-design if any 2 elements of X lie in the same number of blocks.
2-design
This says that any 2 varieties are compared by the same number of consumers.
Example. 1234, 5678, 1357, 2468, 1247, 3568 is not a 2-design 1, 2 are in two blocks, 1, 6 in none.
More generally, for t N, B is a t -design if every set of t elements in X lies in (is a subset of ) the same
number of blocks.
For 2-designs, there are lots of nice examples and nice theory. The t -designs for t > 2 are much harder
to find. For example the first (non-trivial when B is the collection of all the k-subsets of X ) 6-design
wasnt found until 1982.
Example (A 2-design from geometry). Let p be a prime. Then Zp is a field. Define the plane Z2p =
(x 1 , x 2 ) | x i Zp with p 2 points. Define X = Z2p , B as the lines in this plane, i.e. vectors satisfying a
linear equation. Any 2 points are on a unique line.
t -design
1. INTRODUCTION
2. ERROR-CORRECTING CODES
Chapter 2
Error-correcting codes
Recall that Z2 = {0, 1}, Zn2 = {(x 1 , . . . , x n ) | x i Z2 }. This is a vector space over Z2 with addition
(x 1 , . . . , x n ) + (y 1 , . . . , y n ) = (x 1 + y 1 , . . . , x n + y n )
and scalar multiplication
(x 1 , . . . , x n ) = (x 1 , . . . , x n )
for Z2 . We will abbreviate vectors, for example we will write (1, 0, 1, 1, 0) as 10110.
Definition. A (binary) code of length n is a subset C of Zn2 . The vectors in C are called codewords.
The distance between x, y Zn2 is d (x, y), the number of positions where x and y have different coordinates.
code
codewords
distance
d (x, y)
B = i | x i = y i , x i 6= z i ,
C = i | x i 6= y i , x i 6= z i .
Then |B | + |C | = |A| = d (x, z) and
|B | d (y, z),
|C | d (x, y).
d (C ) = min d (x, y) | x, y C , x 6= y .
minimum distance
d (C )
Equivalently, let S e (c) = x Zn2 | d (c, x) e . Then C corrects e errors if S e (c) S e (c 0 ) = ; for all c, c 0 C ,
c 6= c 0 .
corrects
2. ERROR-CORRECTING CODES
C = x Zn2 | Ax = 0
is a linear code.
Proof. Obvious.
x4 = x1 + x2 , x5 = x1 + x3 ,
(x 1 , . . . , x 6 )
x6 = x2 + x3
and that is
Z62 1
0
1
0
1
0
1
1
1
0
0
0
1
0
0x = 0 .
So C 3 is linear.
Linear codes have bases, dimension and so on.
Proposition 2.4. If C is a linear code of dimension m then
|C | = 2m .
Proof. Let c 1 , . . . , c m be the basis of C . So every codeword in C has a unique expression as a linear
combination of the basis
1 c 1 + + m c m = 0
for i Z2 . There are 2m such expressions.
Example. Basis of C 3 is 100110, 010101, 001011 so dim(C ) = 3 and |C | = 8.
2. ERROR-CORRECTING CODES
weight
wt(x)
wt(x) = number of 1s in x.
Example. wt(101011) = 4.
Lemma 2.5. For x, y, z Zn2 , d (x, y) = d (x + z, y + z).
Proof. Observe that x + z and y + z are x,y respectively, changed in the positions where z has a 1. So
x + z, y + z differ in the same positions as x and y do.
Proposition 2.6. If C is a linear code
d (C ) = min {wt(c) | c C , c 6= 0} .
Proof. Let c C , c 6= 0 with c of the minimum weight r . Now 0, c C and d (0, c) = wt(c) = r . So
d (C ) r.
Next, if x, y C with x 6= y,
2.5
d (x, y) = d (x + y, y + y)
= d (x + y, 0)
= wt(x + y).
Since C is linear, x + y C , so wt(x + y) r . Hence
d (C ) r.
So d (C ) = r by
and
Definition. If A is a n n matrix over Z2 and C = x Zn2 | Ax = 0 we call A a check matrix of the linear
code C .
Example. The code C 3 has a check matrix
1
1
0
1
0
1
0
1
1
1
0
0
0
1
0
0
0 .
1
check matrix
2. ERROR-CORRECTING CODES
Example. Let
1
0
A=
1
0
1
1
0
1
0
1
0
0
1
0
1
0
0
1
1
1
1
1
,
0
1
0
0
1
1
0
0
0
1
1
0
1
0
0
0
0
1
0
0
1
1
.
0
0
0
.
..
c = 1 = ei
..
.
0
(e i is the i th standard basis vector). As c C , Ac = 0, so 0 = Ae i = i th column of A, contradicting assumption (2). If wt(c) = 2 then
c = ei + e j
so 0 = A(e i + e j ) = i th column + j th column. This means that columns i and j are the same (A is over
Z2 ), contradicting the assumption (1).
Example. By 2.8, C 3 corrects 1 error.
What is the maximum dimension of a code C such that
(1) a check matrix of C has rank 3,
(2) C corrects 1 error?
If C Zn2 , then dim(C ) = n 3, so we need to maximise n. Look for a 3 n check matrix A with all
columns different and non-zero. Take A to have as columns all the nonzero vectors in Z32 . So
1
A= 1
1
1
1
0
1
0
1
0
1
1
1
0
0
0
1
0
0
0 .
1
2. ERROR-CORRECTING CODES
x5 = x1 + x2 + x3 ,
C = x Z72 x 6 = x 1 + x 2 + x 4 ,
.
x = x +x +x
7
1
3
4
This corrects one error (by 2.8) and has dimension 4, the largest possible.
1
1
1
1
1
0
1
1
0
1
1
1
0
0
1
0
1
1
1
0
1
0
1
0
0
1
0
1
1
1
0
1
1
0
0
1
0
1
0
0
1
1
1
0
0
0
0
1
0
0
0
0
1
0
0
0
.
0
1
Hamming code
Ham(k)
10
2. ERROR-CORRECTING CODES
(1) Suppose that d (C ) d 1. Then by 2.6 there exists codeword c C , c 6= 0, with wt(c) d 1. Say
c = e i 1 + + e i r , r d 1. Then as c C , Ac = 0, so
0 = Ae i 1 + + Ae i r
= column 1 of A + + column i r of A.
So columns i 1 , . . . , i r are linearly dependent, contradicting the hypothesis.
(2) Suppose there exists a set c i 1 , . . . , c i d of linearly dependent columns of A. As any d 1 of these are
linearly independent, the dependence relation must be
c i 1 + + c i d = 0.
This means that
A(e i 1 + + e i d ) = 0.
So e i 1 + + e i d is a codeword in C of weight d . Hence d (C ) d and so d (C ) = d by (1).
Example. Find a linear code of length 9, dimension 2, correcting 2 errors. We need d (C ) 5 by 2.2. So
we need to find check matrix A such that
(1) A is 7 9 (of rank 7 to get dimension 2),
(2) every set of 4 columns is linearly independent.
Try
A=
c1
c2
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
c1 =
1
1
1
1
0
0
0
c2 =
1 0 1 0 0 0
1 0 0 1 0 0
1 0 0 0 1 0
A= 1 1 0 0 0 1
0 1 0 0 0 0
0 1 0 0 0 0
0 1 0 0 0 0
0
0
0
1
1
1
1
0
0
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
2. ERROR-CORRECTING CODES
11
C = x Z92 | Ax = 0
= {abaaa(a + b)bbb | a, b Z2 }
of length 9, dimension 2 and corrects 2 errors.
n
e .
Theorem 2.11 (The Hamming Bound). Suppose code C Zn2 corrects e errors. Then
|C |
2n
n
.
1 + n + 2 + + ne
Proof. As C corrects e errors, all the spheres S e (c) for c C are disjoint. By 2.10, therefore,
!!
S e (c) = |C | 1 + n + +
.
e
cC
S
Since cC S e (c) Zn2 , the right hand side is less than or equal to |Zn2 | = 2n and so
!
!!
n
n
|C | 1 + n +
++
2n .
2
e
Example. Let C be a linear code of length 9, correcting 2 errors. What is the maximum possible dimension of C ? By 2.11,
29
29
|C |
.
9 =
46
1+9+
2
As |C | = 2k where k is the dimension of C and |C | 29 /46 < 24 , we get k < 4. We found such C of
dimension 2 before. Is there a linear code of length 9, dimension 3, correcting 2 errors? We are looking
for a check matrix A which is 6 9 (rank 6), with any 4 columns linearly independent. Try
c1 c2 c3 1 0 0 0 0 0
0 1 0 0 0 0
0 0 1 0 0 0
A=
.
0 0 0 1 0 0
0 0 0 0 1 0
0 0 0 0 0 1
We need
S e (c)
12
2. ERROR-CORRECTING CODES
(a) wt(c i ) 4,
(b) wt(c i + c j ) 3,
(c) wt(c 1 + c 2 + c 3 ) 2.
See the Sheet 2.
cC
2n
.
1+n
S 1 (c) = Zn2 ?
2n
iff n = 2k 1 and |C | = 2nk .
1+n
Proof.
We have, since |C | = 2n /(1 + n), n + 1 = 2k for some k and hence n = 2k 1, |C | = 2nk .
Since n = 2k1 , |C | = 2nk , we have |C | = 2n /(1 + n).
Example. Ham(k) has length n = 2k 1 and dimension 2k 1k = nk. So | Ham(k)| = 2nk = 2n /(1+n).
2n
1+n ++
n .
e
Golay code
23 23
11
2 + 3 = 2048 = 2 .
2. ERROR-CORRECTING CODES
13
holds (stated later), then there does exist a code C with certain properties (stated later too).
Example. Let C Z11
2 be linear code correcting 2 errors. The Hamming bound tells us |C |
11
11
2
1+11+ 11
2
I8
..
.
..
.
..
.
c1
c 11
We argue that A exists with required properties by counting. The number of vectors in Z82 which are
the sum of at most 3 of the columns c 1 , . . . , c 8 is at most
!
!
8
8
N8 = 1 + 8 +
+
= 1 + 8 + 28 + 56 < 28 .
0 ci
2
3
c i +c j
c i +c j +c k
8
So
there exists a vector
c 9 Z2 which is not the sum of at most 3 of the columns c 1 , . . . , c 8 and the matrix
c 1 c 8 c 9 has any 4 columns linearly independent.
The number of vectors in Z82 which are the sums of at most 3 of the columns c 1 , . . . , c 9 is at most
!
9
N9 = 1 + 9 +
+
c
0
2
i
c i +c j
!
9
3
= 1 + 9 + 36 + 84 < 28 .
c i +c j +c k
8
So
is not the sum of at most 3 of c 1 , . . . , c 10 and the matrix
there exists c 10 Z2 which
!
n 1
n 1
1+n 1+
++
< 2nk .
2
d 2
Then there exists a linear code C of length n, dimension k with d (C ) d .
Proof. We need to find a check matrix A such that A is (n k) n (of rank n k) and any d 1 columns
of A are linearly independent. Start with A nk = I nk . We will continue by adding columns to this, one
by one, until we have n columns. Say we have i , n k i n 1 columns c 1 , . . . , c i with any d 1 of them
14
2. ERROR-CORRECTING CODES
linearly independent. The number of vectors in Z2nk which are sums of at most d 2 of the columns
c 1 , . . . , c i is at most
!
!
i
i
.
++
1+ i +
cj
d 2
2
c j +c k
215
1 + 15 +
15 =
2
215
< 29 ,
121
there does not exists such C with dimension greater than 8. It does not say
anything
14 about the existence
of such codes with dimensions 8, 7, . . . . The G-V bound, since 1 + 14 + 14
2 + 3 = 29, says that there
exists such C of dimension 6. However, it does not say anything about the existence of such codes of
dimensions 7 or 8.
1
1
1
1
1
0
1
0
1
0
1
1
1
0
0
0
1
0
0
0
1
0
1
0
1
0
0
0
1
1
1
0
1
1
1
0
1
1 .
1
We can add parity check bits to H and K to get codes H 0 and K 0 of length 8. The codewords in H 0 are
00000000,
10001110,
10110010,
11010100,
11101000,
01011010,
01100110,
00111100,
11111111,
01110001,
01001101,
00101011,
00010111,
10100101,
10011001,
11000011.
00000000,
11100010,
10011010,
01010110,
00101110,
10110100,
11001100,
01111000,
11111111,
00011101,
01100101,
10101001,
11010001,
01001011,
00110011,
10000111.
2. ERROR-CORRECTING CODES
15
Proposition 2.15.
(1) |H 0 | = |K 0 | = 16,
(2) wt(x) = 0, 4 or 8 for all x H 0 K 0 ,
(3) H 0 K 0 = {0 0, 1 1}.
Proof. (1) and (2) is clear. For (3), let w H K . As w H , w = abcd (a + b + c)(a + b + d )(a + c + d ) for
some a, b, c, d Z2 . As w K
c + (a + b + c) + (a + b + d ) + (a + c + d ) = 0,
b + d + (a + b + d ) + (a + c + d ) = 0,
a + d + (a + b + c) + (a + c + d ) = 0.
Simplifying, we get a + c = c + d = a + b = 0, that is a = b = c = d and so w = 0000000 or 1111111.
[v, w]
16
2. ERROR-CORRECTING CODES
Proof. Write wt(v) = 4a and wt(w) = 4b. Then by 2.19 wt(v + w) = 4a + 4b 2[v, w]. This is divisible by
4 precisely when [v, w] is even.
Lemma 2.21. If a, b, x Zn2 then [a, x] + [b, x] + [a + b, x] is even.
Proof. Let r = [a, x], s = [b, x]. Re-ordering coordinates, write x = 1 10 0, a = 1r 0 0 , b = 1u 0r u 1su 0 0 .
So a + b = 0u 1r u 1su 0 0 and hence
[a, x] + [b, x] + [a + b, x] = r + s + r u + s u = 2(r + s u),
an even number.
2. ERROR-CORRECTING CODES
17
Ni , M i
N8 = N16 .
Proof. We know that for all c G 24 , c 6= 0, wt(c) is divisible by 4 and is at least 8. Now 124 G 24 and
the map c 7 x + 124 is a bijection between the codewords of weight i and codes of weight 24 i . So
Ni = N24i . Since N4 = 0, it follows that N20 = 0. Also N8 = N16 .
Proposition 2.27. Codewords in G 23 have weights 0, 7, 8, 11, 12, 15, 16 or 23 and
M 0 = M 23 ,
M 7 = M 16 ,
M 8 = M 15 ,
M 11 = M 12 .
Proof. Again 123 G 23 and the map x 7 x + 123 gives M i = M 23i for all i .
1.
It
is
also
the
number
of
S
(c)s
times
the
number
of
vs
per
S
(c),
that
is
M
3
3
7
4
4 . Hence
23
M 7 = 47
4
23 22 21 20 3 2 1
=
4321 765
= 23 11 = 253.
To calculate M 8 , count pairs (v, S 3 (c)) where v Z23
8 and v S 3 (c).
2 is of weight 5, c G 23 is of weight7 or
The number of pairs is the number of vs times the number of S 3 (c)s per v, that is 23
1. It is also the
5
0
number of cs of weight 7 times the number
of
vs
in
S
(c)
plus
the
number
of
c
s
of
weight
8 times the
3
number of vs in S 3 (c 0 ), that is M 7 72 + M 8 83 . So
!
!
!
23
7
8
= M7
+ M8
5
2
3
!
76
8
23 22 21 20 19
M8
=
23 11
54321
21
3
= 23 11 7(19 3)
23 11 7 16 3 2 1
M8 =
876
= 506.
Using G 24 , define points to be the 24 coordinate positions 1, 2, . . . , 24. For each codeword c in G 24 of
weight 8 define block B c to be the set of 8 positions where c has a 1. For example for c = 18 08 08 , B c =
{1, 2, . . . , 8}. So we have 759 blocks called octads.
octads
18
2. ERROR-CORRECTING CODES
Theorem 2.30 (The Witt design). The 759 octads are the blocks of a 5-design in which any set of 5 points
lies in a unique octad.
We will give two proofs of this theorem.
First proof. Let S be a set of 5 points, and let v S be the corresponding vector in Z24
2 of weight 5. Delete
0
the last bit of v S giving vector v S0 Z23
of
weight
4
or
5.
As
G
is
3-perfect,
v
lies
in a unique sphere
23
2
S
S 3 (c) for c G 23 and clearly c must have weight 7 or 8. Add parity check bit to c to get c 0 G 24 of weight
8. Then the positions of the 1s in v S0 are also the positions of 1s in c. Hence the same is true for v S and
c 0 . In other words, S is in B c . By the uniqueness of S 3 (c), this is the unique octad containing S.
Second proof. First, we will show that any 5 points lie in at most 1 octad, by showing that any 2 octads
intersect in less than 5 points. Let c 1 , c 2 G 24 be codewords of weight 8 and let B c1 and B c2 be the
corresponding octads. Note that |B c1 B c2 | = [c 1 , c 2 ]. We know by 2.19 that wt(c 1 +c 2 ) = wt(c 1 )+wt(c 2 )
2[c 1 , c 2 ]. Also wt(c 1 ) = wt(c 2 ) = 8 and by 2.18, wt(c 1 + c 2 ) 8 (as c 1 + c 2 G 24 ). Hence
2[c 1 + c 2 ] = wt(c 1 ) + wt(c 2 ) wt(c 1 + c 2 )
8 + 8 8 = 8.
So |B c1 B c2 | = [c 1 , c 2 ] 4.
Next, we show that every set of 5 points lies in exactly one octad. By the previous, the number of 5-sets
lying in some octad is the number of octads times the number of 5-sets per octad, that is
!
876
8
759
= 23 11 3
321
5
!
23 23 22 21 20
24
=
=
,
54321
5
that is the total number of 5 sets. Hence every 5-set lies in some octad, hence in exactly 1 octad by the
first part.
19
Chapter 3
graph
= (V, E )
edges
joined
regular
path
length
connected
distance
diameter
Proposition 3.1. Let = (V, E ) be a connected regular graph of valency k and diameter d . Then
|V | 1 + k + k(k 1) + k(k 1)2 + + k(k 1)d 1 = 1 + k
dX
1
i =0
(k 1)i .
complete
Kn
20
Sd
k 1
k 1
S2
k
S1
v
So |V |
N (k, d )
Pd
i =0 |S i | 1 +
Pd 1
i =1
k(k 1)i 1 .
Write
N (k, d ) = 1 +
dX
1
k(k 1)i .
i =0
Moore graph
Definition. A Moore graph is a connected regular graph of valency k, diameter d with |V | = N (k, d ).
Example. For k = 2, we have N (2, d ) = 1 + 2d . Here is (2d + 1)-gon with diameter d , so is a Moore
graph.
For k = 3 and d = 2, we have N (3, 2) = 1 + 3 + 3 2 = 10. There exists such a graph the Petersen graph.
Check that it does have valency 3 and diameter 2.
21
Proof. Suppose is such a Moore graph. Then does not have any triangles or quadrilaterals: starting
with any vertex in the centre, there have to be 12 vertices at distance 2 from it; has to look like on Figure
3. This clearly has no triangles and quadrilaterals (because we can place any vertex of in the centre).
Start with an edge {0, }. Let a, b, c be further neighbours of 0 and x, y, z the further neighbours of .
Note that a, b, c are not joined with x, y, z as there would be a quadrilateral. As the diameter is 2, there
exists a common neighbour of a and x, say (a, x). Get 9 further vertices (a, x), . . . , (c, z). Observe that
(a, x) is not joined with (a, y), otherwise there would be a triangle. Also (a, x) is not joined to (b, x). So
(a, x) has two neighbours in
strongly regular
Triangluar graph
T (n)
Lattice graph
L(n)
Paley graph
P (p)
22
o
x 2 | x Zp (where Zp = Zp {0}). For example for p = 5, Q = {1, 4}. We know Q is a subgroup of
(Zp , ) of size (p 1)/2. Also 1 Q and x Q iff x Q. Take vertices to be elements of Zp and join x
and y iff x y Q. Then this graph is strongly regular. The parameters are v = p and k = (p 1)/2. For
a, b and proofs, see solution to Sheet 4. These are called Paley graphs P (p). Can be generalized with the
same definition, replacing Zp with any finite field Fq of q elements, where q 1 mod 4.
k a 1
b
v k 1
complement
c
If = (V, E) is a graph, then
the complement of , written , is the graph with vertex set V and edge set
E c where x, y E c iff x, y E .
Example.
c =
Proposition 3.4. If is a strongly regular graph with parameters (v, k, a, b), then c is also strongly
regular of valency v k 1.
Proof. Sheet 4, where you will also find the parameters of c .
Let be a graph with vertex set e 1 , . . . , e v . The adjacency matrix of is v v matrix A = (a i j ) where
(
1 if e i joined to e j ,
ai j
0 if not.
Example. The adjacency matrix of a pentagon is
0 1
1 0
A=
0 1
0 0
1 0
0
1
0
1
0
0
0
1
0
1
1
0
0
1
0
23
1
k
. .
A .. = .. ,
1
k
so A J = k J .
(2) As A is symmetric, A = A T , so A 2 = A A T . Hence
i j -entry of A 2 = i j -entry of A A T
= (row i of A).(column j of A T )
= (row i of A).(row j of A)
= number of common neighbours of e i and e j
k if i = j ,
= a if e i joined to e j (i 6= j ),
b if e i not joined to e j (i 6= j ).
So A 2 has k on diagonal, a where A has 1 and b where A has 0 (off-diagonal). Therefore
A 2 = k I + a A + b(J A I )
= (a b)A + (k b)I + b J .
3.2.1 Eigenvalues of A
As A is real and symmetric, the Principal Axis theorem, the eigenvalues of A are real and there exists
invertible P such that
..
P 1 AP =
.
.
v
The multiplicity of an eigenvalue is the number of times it appears on the diagonal.
Example. Let D be a diagonal matrix with 000112 on the diagonal. Then D has eigenvalues 0, 1, 2 with
multiplicities 3, 2, 1.
Main theorem of this chapter:
multiplicity
24
Theorem 3.6. Let be a strongly regular graph with parameters (v, k, a, b) and assume that v > 2k and
b > 0. Then
(1) A has exactly 3 distinct eigenvalues. These are k, r 1 and r 2 where r 1 and r 2 are roots of the
quadratic equation
x 2 (a b)x (k b) = 0.
(2) The eigenvalue k has multiplicity 1 and the eigenvalues r 1 , r 2 have multiplicities m 1 , m 2 where
m 1 + m 2 = v 1,
m 1 r 1 + m 2 r 2 = k.
(3) Either r 1 , r 2 Z, or the parameters (v, k, a, b) are of the form (4b + 1, 2b, b 1, b).
Note. The assumption that v > 2k and b > 0 is essential. But if b = 0, we know , by 3.2. If v 2k, then
c is strongly regular of valency k 0 = v k 1 and v > 2k 0 , so can apply Theorem 3.6 to c (unless c has
its b = 0).
(1)
r 1 m 1 + r 2 m 2 = k.
(2)
p
p
m1
2
1 + 4k 3 +
1 4k 3 = k
2
2
p
(m 1 + m 2 ) + 4k 3(m 1 m 2 ) = 2k.
From equation (1), m 1 + m 2 = k 2 , so
p
4k 3(m 1 m 2 ) = k 2 2k.
(3) By 3.6(3), either r 1 , r 2 Z or (v, k, a, b) = (4b + 1, 2b, b 1, b). As b = 1, latter only happens if the
parameters are (5, 2, 0, 1), in which case is the pentagon. So suppose now that k > 2 (so v > 5).
Then r 1 , r 2 Z. Hence n =
25
p
4k 3 Z. By (
),
k 2 2k
m1 m2 = p
4k 3
k(k 2)
=p
4k 3
2
=
n +3
4
n 2 5
4
n
(n 2 + 3)(n 2 5)
=
.
16n
This is m 1 m 2 , so is an integer. However, hcf(n, n 2 +3) divides 3 and similarly hcf(n, n 2 5) divides
2
5. Hence n divides 15, so can be 1, 3, 5 or 15. As k = n 4+3 , it follows that k = 1, 3, 7, 57.
Friendship Theorem
Theorem 3.8 (Friendship Theorem). In a community where any two people have exactly one common
acquaintance, there is a person who knows everybody.
Proof. Define a graph with vertices the people and join two people if they know each other. The
assumption states that any two vertices in have exactly one common neighbour. Suppose (for a contradiction), that there is no vertex which is joined to all the other vertices.
First, we show that under this assumption is regular: Let P be a vertex. By assumption, there exists
vertex Q not joined to P . Let v(P ), v(Q) be the number of neighbours of P,Q. Then v(P ) = v(Q): Let R be
the common neighbour of P and Q. Let S be the common neighbour of P and R and T be the common
neighbour of Q and R. Note that S 6= T . Let u 1 , . . . , u m be the remaining neighbours of P and v 1 , . . . , v n
the remaining neighbours of Q. These are all distinct as R is the only common neighbour of P and Q.
Now u 1 and Q have one common neighbour. It is not P or R, so it is one of the v i s, say v 1 . Similarly, the
common neighbour of u 2 and Q is one of the v i s, say v 2 . Similarly, common neighbour of u i and Q is
v i for i = 1, . . . , m. Hence n m. Likewise, by symmetry, m n and hence n = m, that is v(P ) = v(Q).
R
P
u1
un
vm
v1
Take non-joined vertices P and Q. Let R be the common neighbour of P , Q. For any further vertex S,
either S is not joined to P or S is not joined to Q. So v(S) = v(P ) or v(Q). Therefore v(S) = v(P ) = v(Q).
Finally, there exists a vertex S not joined to R (we supposed there is no vertex joined to all vertices). We
get v(R) = v(S) and hence is regular.
Now we get to a contradiction: By the first step, is strongly regular with parameters (v, k, 1, 1). The
balloon equation 3.3 is k(k 2) = v k 1. So
v = k 2 k + 1.
26
Notice that k 2 k +1 > 2k iff k 2 3k +1 > 0 iff k 3, which is true (clearly k 6= 2 for this graph). So v > 2k,
b = 1 and Theorem 3.6 applies. By 3.6(1), the
p eigenvalues of adjacency matrix of are k, r 1 , r 2 where
r 1 , r 2 are roots of x 2 (k 1) = 0. So r 1 , r 2 = k 1. By 3.6(2), multiplicities m 1 , m 2 satisfy
m 1 + m 2 = v 1,
r 1 m 1 + r 2 m 2 = k.
So
p
k 1(m 1 m 2 ) = k.
Squaring, we get
(k 1)(m 1 m 2 )2 = k 2
and therefore k 1 divides k 2 . But hcf(k 1, k) = 1 and also hcf(k 1, k 2 ) = 1. It follows that k 1 = 1, so
k = 2, a contradiction. Hence there exists a vertex joined to all others.
v
X
ai i .
i =1
v
X
i .
i =1
a 11
a 12
a 1v
a
a 22
a 2v
21
0 = |I A| =
..
.
a v1
av v
= v + v1 (a 11 a 22 a v v ) +
This is ( 1 ) ( v ), which has v1 coefficient (1 + + v ). Therefore
X
X
i = a i i = tr(A).
Proof of Theorem 3.6. Let be strongly regular with parameters (v, k, a, b) with v > 2k and b > 0. By 3.5,
AJ = K J,
A 2 = (a b)A + (k b)I + b J .
1
.
Step 1 k is an eigenvalue of A: If j = .. , A j = k j .
1
Step 2 A has at most 3 (distinct; shown later) eigenvalues k, r 1 , r 2 , where r 1 , r 2 are roots of
x 2 (a b)x (k b) = 0
and eigenvectors of A not in span( j ) have eigenvalues r 1 or r 2 : Let w be an eigenvector of A not in
span( j ), with Aw = w. Then,
A 2 w = 2 w
27
and so by
2 w = A 2 w = (a b)w + (k b)w + b J w.
Now J w = c j where c is the sum of all entries in w. So
2
(a b) (k b) w = bc j.
Since w span( j ), this implies that
2 (a b) (k b) = 0.
Step 3 the eigenvalue k has multiplicity 1 and k 6= r 1 or r 2 : Suppose k = r 1 or r 2 . Then k is a root of the
above quadratic so
k 2 (a b)k (k b) = 0.
Combine with the balloon equation 3.3 to get
k(k a 1) = b(v k 1)
2
k (a b)k (k b) = bv.
Hence bv = 0, a contradiction (we assumed b > 0). Therefore k 6= r 1 or r 2 . By Step 2, it follows that the
k-eigenspace is just span( j ), 1-dimensional, so the multiplicity of k is 1.
Step 4 part (2) of 3.6 holds, that is multiplicities m 1 , m 2 of the eigenvalues r 1 , r 2 satisfy
m 1 + m 2 = v 1,
r 1 m 1 + r 2 m 2 = k :
Recall that as A is symmetric, there exists P such that P 1 AP is a diagonal v v matrix with m 1 entries
being r 1 , m 2 entries being r 2 and one being k. So
m 1 + m 2 = v 1.
Also by 3.9, tr(A) equals to the sum of the eigenvalues of A, so
tr(A) = k + r 1 m 1 + r 2 m 2 .
But since A is the adjacency matrix, it has 0s on the diagonal, so tr(A) = 0. Therefore
r 1 m 1 + r 2 m 2 = k.
Step 5 the roots of the quadratic r 1 , r 2 are integers, unless
(v, k, a, b) = (2b + 1, 2b, b 1, b) :
We know that
p
1
a b (a b)2 + 4(k b)
2
p
1
=
a b D
2
r1, r2 =
where D = (a b)2 + 4(k b). Note that k > b so D > 0 and r 1 6= r 2 . By Step 4,
p
p
m 1 (a b + D) + m 2 (a b D) = 2k
p
(m 1 + m 2 )(a b) + (m 1 m 2 ) D = 2k.
28
p
Suppose m 1 m 2 6= 0. Then D is clearly rational, hence an integer. This means either r 1 , r 2 Z or
2y+1
r 1 = 2x+1
2 and r 2 = 2 where x, y Z. Latter case is impossible as r 1 r 2 = (k b) Z. Hence if m 1 6= m 2 ,
then r 1 , r 2 Z. Now suppose m 1 = m 2 . By
(m 1 + m 2 )(a b) = 2k.
As m 1 + m 2 = v 1,
(v 1)(b a) = 2k.
As v 1 2k, this implies that v 1 = 2k and b a = 1. Also by the balloon equation 3.3
k(k a 1) = b(v k 1) = bk
so b = k a 1 so k = a + b + 1 = 2b. Hence the parameters are (4b + 1, 2b, b 1, b).
Step 6: m 1 , m 2 > 0, that is r 1 , r 2 are eigenvalues of A: Suppose m 2 = 0. Then m 1 = v 1 and r 1 m 1 = k
by Step 4 and r 1 Z by Step 5. So
r 1 (v 1) = k.
This means v 1 divides k, a contradiction since v > 2k. This completes the proof.
p
1
a b (a b)2 + 4(7 b)
2
As a + b = 6 we get
r1, r2 =
p
1
2a 6 (2a 6)2 + 4(a + 1) .
2
29
30
4. DESIGNS
31
Chapter 4
Designs
Definition. A t -design is a collection B of subsets (blocks) of a set X , all of size k, such that any t
elements of X lie in the same number r t of blocks. The parameters are (v, k, r t ) where v = |X |. A design
is a 1-design.
Example. The octads in G 24 form a 5-design with parameters (24, 8, 1). The codewords of weight 4 in
the extended Hamming code H 0 form a 3-design with parameters (8, 4, 1) (Sheet 3).
The X = Zk2 {0} with blocks {u, v, u + v} form a 2-design with parameters (2k 1, 3, 1) (Sheet 1).
Proposition 4.1. If B is a t -design with parameters (v, k, r t ) then B is also a (t 1)-design with parameters (v, k, r t 1 ) with
(v t + 1)r t
r t 1 =
.
k t +1
Proof. Let S X with |S| = t 1 and r (S) be the number of blocks containing S. Count pairs (x, B ) where
x X \ S, B B and S {x} B . Number of such pairs is
(number of xs) (number of B s) = (v (t 1)) r t
and also
(number of B s) (number of xs per B ) = r (S) (k (t 1)).
Hence
r (S) =
(v t + 1)r t
.
k t +1
(v t + 2)
(v t + 2)(v t + 1)r t
r t 1 =
.
k t +2
(k t + 2)(k 2 + 1)
(v t + 1)(v t + 2) (v s)
rt .
(k t + 1)(k t + 2) (k s)
In particular, r s is an integer.
Corollary 4.3. A t -design is a design with each point in r = r 1 blocks and the number of blocks b =
Example. Is there a 2-design with parameters (56, 11, 1)? If so,
r = r1 =
v 1
55
r2 =
.
k 1
10
vr
k
t -design
block
parameters
design
32
4. DESIGNS
r = r1 =
vr 22 7
=
= 22.
k
22
So divisibility conditions are satisfied. We will need to find answer to this question later.
vr
k
vr
, r (k 1) = (v 1).
k
v1
k1 by 4.1.
v1
v1
k1 with k1
1. If r then r = and v = k, so
(
1 if x i B j ,
0 otherwise.
Note that each row sum is r (each point lies in r blocks) and each column sum is k (each block has k
points).
Proposition 4.6. Let B be a 2-design with parameters (v, k, ) and A be its incidence matrix. Then A A T
is the v v matrix
r
r
T
= J + (r )I .
AA =
..
4. DESIGNS
33
det(A A T ) =
..
r r r r
r
0
0
r
0
=
..
0
0
r
r + (v 1)
0
0
r
0
0
r
0
=
..
0
0
r
= (r )v1 (r + (v 1)).
v1
45
k1 = 9
= 5. So b =
vr
k
34
4. DESIGNS
Example. Let X = Z32 {0} with blocks {u, v, u + v}, u 6= v X , the 2-design with parameters (7, 3, 1). Then
v1
r = k1
= 3 = k and b = 7, so this design is symmetric. This is the Fano plane.
100
101
110
111
001
011
010
Proof of Theorem 4.10. Let B be such a symmetric 2-design and A be the incidence matrix of B. As B
is symmetric, b = v and so A is a square v v matrix. So det(A) exists and is an integer. We know by 4.6
det(A A T ) = (r )v1 (r + (v 1)).
Also det(A) = det(A T ) and so det(A A T ) = det(A)2 . So
det(A)2 = (r )v1 (r + (v 1)).
Now B is symmetric so r = k and (v 1) = r (k 1) = k(k 1), so
r + (v 1) = k + k(k 1) = k 2 .
So by
det(A)2 = (k )v1 k 2 .
The right hand side is a square, hence so is (k )v1 . As v 1 is odd, this forces k to be a square.
Theorem 4.11. If B is a symmetric 2-design with parameters (v, k, ) then any two distinct blocks of B
intersect in exactly points.
Proof. Let A be the incidence matrix of B. Then A J = k J and J A = k J (rows and column sums of A are
equal to k). Also by 4.6, A A T = J + (k )I . Now A commutes with J and with I , hence A commutes
k
k
.
AT A = A AT =
..
4. DESIGNS
35
Now
i j -th entry of A T A = (row i of A T ) (column j of A)
= (column i of A) (column j of A)
= |B i B j |.
Hence |B i B j | = for any i 6= j .
13 = 5
03 = 4
30 = 3
10 = 1
3 1 = 2.
These are all different. Now a, b B i iff a i , b i B 0 ; clearly there is only one possible i for a 6= b.
Definition. Let v and be positive integers. A subset B 0 Zv is a -difference set if for any d Zv , there
exist exactly ordered pairs (a, b) a, b B 0 and a b = d .
Proposition 4.12. Let B 0 be a -difference set in Zv with |B 0 | = k. Define
B i = B 0 + i for i = 0, . . . , v 1.
Then the sets B i are blocks of a symmetric 2-design with parameters (v, k, ).
Proof. Let r, s Zv with r 6= s. Then r, s B i if and only if r i , s i B 0 . The number of i s for which this
holds is equal to the number of pairs of elements in B 0 which differ by r s. This number is . Hence
B i s form a 2-design. The number of blocks is v, so this design is symmetric.
p3
4
and |Q| =
p1
2 .
Corollary 4.14. For each prime p 3 mod 4 there exists a symmetric 2-design with parameters
p1 p3
(p, 2 , 4 ). The blocks are Q i = Q + i for i = 0, 1, . . . , p 1.
Example. For p = 7, Q = {1, 4, 2}. The parameters are (7, 3, 1). This is the example above (B 0 = {1, 4, 2}).
For p = 11, Q = {1, 4, 9, 5, 3}. The parameters are (11, 5, 2).
Here is an example of a difference set in Z13 . Let B 0 = {0, 1, 3, 9}. Check that this is a 1-difference set that
gives a symmetric design with parameters (13, 4, 1).
For the proof of 4.13 we need:
-difference set
36
4. DESIGNS
n
o
Proposition 4.15. Let p 3 mod 4 and Q = x 2 | x Zp . Then
(1) |Q| =
p1
2
and Q is a subgroup of Zp ,
(2) As p 3 mod 4, 2 is odd. By Lagrange, Q therefore has no element of order 2 and hence 1 Q.
Finally, the 2 right cosets of Q are Q and (1)Q and Zp is their union.
Proof of 4.13. Let p 3 mod 4 and Q as above. For q Q define
E q = (x 1 , x 2 ) | x i Q, x 1 x 2 = q .
Let r Q. Then for x 1 , x 2 , q Q, we have r x 1 , r x 2 , r q Q and x 1 x 2 = q iff r x 1 r x 2 = r q. Hence
(x 1 , x 2 ) E q iff (r x 1 , r x 2 ) E r q . So |E q | = |E r q |. Also if q Q then q Q by 4.15 and (x 1 , x 2 ) E q iff
(x 2 , x 1 ) E q . So |E q | = |E q |. As Zp = Q (Q) by 4.15, we have now shown that |E x | is constant over all
x Zp . Hence Q is a -difference set for some . To find , consider the number of ordered pairs (a, b)
in Q with a 6= b which is |Q|(|Q| 1). This is also equal to |Zp | = (p 1). So
p 1 p 3
(p 1) =
2
2
p 3
=
.
4
Note. Same construction, replacing Zp by a field F with |F | = 3 mod 4 (we also know that |F | = p k for
p k 3
p prime) and Q = x 2 | x F , gives -difference set in F , = 4 .
Note. Similar proof shows that the Paley graphs are strongly regular.
Example. Take Z3 . The points are (x, y) | x, y Z3 . There are 9 lines of the form y = mx + c and 3 lines
of the form x = c. Some of them are
y =x
: 00, 11, 22
y = x +1
: 01, 12, 20
y = x +2
: 02, 10, 21
..
.
x =2
4. DESIGNS
37
Proposition 4.16. Every pair of points lies on a unique line. Hence the lines form blocks of a 2-design
with parameters (p 2 , p, 1).
Proof. First, observe that every line has p points. Now let v 1 , v 2 F 2 with v 1 6= v 2 . Clearly, v 1 and v 2 lie
on the line L = v 1 + span(v 2 v 1 ). Suppose v 1 , v 2 also lie on line L 0 = a + span(b) for a, b Z2p . So
v 1 = a + 1 b,
v 2 = a + 2 b
for some i F . So v 1 v 2 = (1 2 )b and b = (v 1 v 2 ) where = (1 2 )1 F . Then
L 0 = {a + b | F }
= {v 1 1 b + b | F }
= {v 1 (v 1 v 2 ) | F }
= L.
Definition. The points and lines in F 2 form a 2-design called the affine plane over F , denoted AG(2, F ).
Two lines in AG(2, F ) meet in 1 or 0 points or are parallel if they meet in 0 points.
affine plane
parallel
L m = line y = mx + c | c F
and
L = {line x = c | c F } .
Each of these sets contains p parallel lines.
parallel classes
Proposition 4.18. Each point in F 2 lies on exactly one line in each parallel class.
Proof. Each parallel class contains p disjoint lines and so contains p 2 points, hence the whole of F 2 .
l = pm , p | m F .
So points of PG(2, F ) are F 2 , p m , p (p 2 + p + 1 of them) and lines of PG(2, F ) are (y = mx + c) p m ,
(x = c) p and l (p 2 + p + 1 of them, all of size p + 1).
projective plane
PG(2, F )
38
4. DESIGNS
p
p2
p1
p0
L0
l
L2
L1
L
m p
p 1 p n1 1 p nm+1 1
n
.
= m
m
p 1 p m1 1 p 1
p
Example.
n
1 p
p n 1 5
p1 , 2 3
35 1 34 1
= ( 32 1)((31)) .
(
)
m p.
if m = 1,
if m > 1.
if m = 1,
0
1
n2
m2 p
if m = 2,
if m > 2.
4. DESIGNS
39
Now define a design as follows: Let F = Zp , and m, n integers with 1 m n 1. Points are vectors in
F n and blocks are subsets of the form v + W , v F n , W a m-dimensional subspace. Call this design
AG(n, F )m
Example. Let n = 2, m = 1. Points are the vectors in F 2 and blocks the subsets v + span(w), that is the
lines in AG(2, F ). So in this case, design is the affine plane AG(2, F ).
Proposition 4.21.
(1) AG(n, F )m is a 2-design with parameters (p n , p m , ) where
(
1
= n1
m1 p
if m = 1,
if m > 1.
if m = 2,
if m > 2.
(p n 1) (p n p) p n p 2 p n p m1
w3
(p m 1) (p m p) p m p 2 p m p m1
(p n p) (p n p 2 ) p n p m1 .
AG(n, F )m
40
4. DESIGNS
(p m p) (p m p 2 ) p m p m1 .
(p n p)(p n p 2 ) (p n p m1 )
n 1
.
=
m 1
(p m p)(p m p 2 ) (p m p m1 )
p
5. SOME CONNECTIONS
41
Chapter 5
Some connections
We have seen some connections of codes leading to designs (e.g. G 24 gives us 5-design with parameters
(24, 8, 1), weight 4 codewords in H 0 give us a 3-design with parameters (8, 4, 1)). Here are results giving
other connections:
(1) strongly regular graphs to designs,
(2) designs to strongly regular graphs (more interesting),
(3) codes, graphs, designs and groups.
There are many more connections; see the Camerons book.
Proposition 5.1.
(1) Suppose is strongly regular graph with parameters (v, k, a, a). Define a design with points the
vertices of and blocks the sets B x of neighbours of x for each vertex x. This is a symmetric
2-design with parameters (v, k, a).
(2) Suppose is strongly regular graph with parameters (v, k, a, a + 2). Define a design with points
the vertices of and blocks the sets x B x (B x as above) for each vertex x. This is a symmetric 2
design with parameters (v, k + 1, a + 2)
Proof.
(1) Let x, y be vertices of . The blocks containing x, y are B w for w joined to both x and y. Since
a = b for , the number of such ws is a.
(2) The blocks containing x, y in case they are joined is B w , w a common neighbour of x and y and
also B x and B y there are a + 2 such blocks. If x, y are not joined, blocks containing both are B w
for w a common neighbour of x, y there are a + 2 such blocks.
Example. T (6) has parameters (15, 8, 4, 4) and so we get a symmetric design with parameters (15, 8, 4).
L(4) has parameters (16, 6, 2, 2) and so we get a symmetric design (16, 6, 2). T (6)2 has parameters (15, 6, 1, 3)
and so we get a symmetric design (15, 6, 3).
Definition. A 2-design is quasi-symmetric if there exist integers x, y such that for any two blocks B 1 , B 2 ,
|B 1 B 2 | = x or y.
Note. Why the name? Because if |B 1 B 2 | is constant, then the design is symmetric (Sheet 5).
Example. In affine plane AG(2,G), any two lines meet in 0 or 1 points.
Golay code G 23 leads to a four design with points the 23 coordinate positions and the blocks equal
positions of 1s in weight 7 codewords. The parameters are (23, 7, 1).
quadi-symmetric
42
5. SOME CONNECTIONS
Example. Let B = AG(2, F ). Vertices of (B) are the lines in AG(2, F ) and we join two lines if they
intersect (in one point). So in (B)c we join two lines if they are parallel. Each parallel class L m forms a
complete graph K p , so (B)c is a union of disjoint complete graphs; a strongly regular graph with b = 0
by 3.2.
Let B be a 4 design constructed from G 23 as above. What are the parameters of (B)? We have v the
number of blocks, that is the number of codewords of weight 7 in G 23 . For k, a, b see the advanced
coursework.
Now a connection between designs, codes, graphs and groups.
Let B1 , B2 be designs with point sets X 1 , X 2 . We say B1 , B2 are isomorphic if there exists a bijection
: X 1 X 2 sending the blocks in B1 to the blocks in B2 . Call an isomorphism.
Example. Let X = Z7 , B1 be the blocks
B i = {0, 1, 3} + i , a 2-design with parameters (7, 3, 1). Let X 2 =
Z32 {0}, B2 be the blocks x, y, x + y , x, y X 2 , x 6= y. Is B1 ' B2 ? We can try to construct the bijection:
x
x+y
automorphism
Definition. For B a design with point set X , an isomorphism B B (i.e. a bijection X X sending
blocks to blocks) is called an automorphism of B.
Aut(B)
Notice that is a bijection X X , that is a permutation of X , so Sym(X ), the group of all permutations of X . Define Aut(B) to be the set of all automorphisms of B.
Proposition 5.3. Aut(B) is a subgroup of Sym(X ). In particular, Aut(B) is a group called the automorphism group of B.
5. SOME CONNECTIONS
43
Example. Let B be an affine plane AG(2, Zp ). Let G = Aut(B) Sym(Z2p ). Then G contains: (1) g
GL(2, Zp ): g gives permutation v 7 g v so g Sym(Z2p ). We have g (v + w) = g v + g w and hence g
sends v + span(w) g v + span(g v) and so g Aut(B). (2) Translation t x for x Z2p with t x (v) = v + x
for v Z2p . Then t x Sym(Z2p ) and t x (v + w) = v + x + w so t x sends v + span(w) v + x + span(w).
Hence t x Aut(B).
Note that for A GL(2, Zp ) and x Z2p we have t x (Av) = Av + x for all v Z2p . This is an affine transformation of Z2p . Denote it by A,x . We leave proofs of the following statements as an exercise:
1. { A,x | A GL(2, Zp ), x Z2p } is a group. It is called the affine general linear group AGL(2, Zp ).
2. Translations T = {t x | x Z2p } form a normal subgroup of AGL(2, Zp ).
3. T ' (Z2p , +) ' C p C p and AGL(2, Zp )/T ' GL(2, Zp ).
4. Aut(B) = AGL(2, Zp ).
Example. Consider B a projective plane in PG(2, Zp ). There is an alternative viewpoint on PG(2, Zp ):
Let V = Z3p , a 3-dimensional vector space over Zp . Identify points in PG(2, Zp ) with 1-spaces: (a, b) with
span(1, a, b), p m with span(0, 1, m) and p with span(0, 0, 1). Note that these are all the 1-spaces in V
p 3 1
since the number of those is 31 p = p1 = p 2 + p + 1, the number of points in PG(2, Zp ).
Claim. The lines in PG(2, Zp ) are of the form L W , where W is a 2-space in V and L W = span(v) | v W, v 6= 0 .
There are many automorphisms of B: Let g GL(3, Zp ). We have
g (span(v)) = span(g (v)).
Therefore g sends L W to L g (W ) and so is an automorphism of B.
Final point
If g = I for Zp then g gives identity permutation. If we define g to be the permutation of points
given by
then the map g 7 g in GL(3, Zp ) Sym(X ) is a homomorphism with kernel Z = {I |
Zp }. So its image is isomorphic with GL(3, Zp )/Z = PGL(3, Zp ). So PGL(3, Zp ) Aut(B). In fact, we can
prove that PGL(3, Zp ) = Aut(B).
T HE END.
AGL(2, Zp )
44
INDEX
Index
K n , 19
L(n), 21
N (k, d ), 20
P (p), 21
S e (c), 11
T (n), 21
[v, w], 15
AG(n, F )m , 39
bb Zp ), 43
Aut(B), 42
= (V, E ), 19
Ham(k), 9
F ), 37
PG(2,
n
,
38
m p
-difference set, 35
wt(x), 7
d (C ), 5
d (x, y), 5
e-perfect, 12
t -design, 3, 31
2-design, 3
affine plane, 37
alphabet, 1
automorphism, 42
block, 31
blocks, 3
check matrix, 7
code, 5
Golay, 12
Hamming, 9
linear, 6
codewords, 5
complement, 22
connected, 19
corrects, 5
Fano plane, 34
Golay Code, 16
graph, 2, 19
complete, 19
lattice, 21
Moore, 20
Paley, 21
regular, 2
strongly, 2
Triangular, 21
Hamming code, 9
isomorphic, 42
isomorphism, 42
joined, 19
Lattice graph, 21
length, 1, 19
minimum distance, 5
Moore graph, 20
multiplicity, 23
neighbours, 2
octads, 17
Paley graph, 21
parallel, 37
parallel classes, 37
parameters, 3, 31
path, 19
Petersen graph, 2
projective plane, 37
quadi-symmetric, 41
regular, 19
strongly regular, 21
design, 3, 31
trivial, 32
diameter, 19
distance, 5, 19
trace, 26
Triangluar graph, 21
edges, 2, 19
extended Golay code, 15
weight, 7
word, 1
valency, 2
vertices, 2