Syllabus
Basic combinatorial structures.
1. Finite geometries.
2. Finite projective planes.
3. Balanced incomplete block designs.
4. Steiner triple systems.
5. Symmetric designs, Bruck-Ryser-Chowla theorem.
6. Hadamard matrices.
7. Mutually ortogonal Latin squares.
Annotation
Advanced course in Computer Science
Survey of regular structures, constructions and existence-nonexistence theorems (finite planes and geometries, block designs, Steiner triple systems, mutually orthogonal Latin squares, difference sets, Hadamard matrices).