New sets for old: Shifts


Write down any CDS. (In our example we use the previously encountered set {0,3,5,12} modulo 13.) On the line underneath it, write the same set but increase each number by 1. Instead of 13 just write 0. Do the same again with that new line and continue until you end up with the same line as you started with.

This is what you should get:

   0   3   5  12
   1   4   6   0
   2   5   7   1
   3   6   8   2
   4   7   9   3
   5   8  10   4
   6   9  11   5
   7  10  12   6
   8  11   0   7
   9  12   1   8
  10   0   2   9
  11   1   3  10
  12   2   4  11
(  0   3   5  12 )
If we leave out the (repeated) last line we find 13 different sets. They are called shifts of the original CDS. In general, for every CDS of size s and modulus n we may construct n different shifts.

Shifts have remarkable properties

You may use the example above to check the following properties which hold for shifts of any CDS: We shall not prove these properties here.

Apart from providing us new CDSs for old ones, the notion of `shifts' is also useful in providing a geometrical interpretation of cyclic difference sets as will be explained in the following pages.

Problems


Is this geometry?

96/12/30 - Kris Coolsaet