Combinatorial Structures - NDMI036
|
|
|
||
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).
Last update: T_KAM (06.05.2001)
|
|
||
Oral exam. The exam may be performed remotely. Last update: Kratochvíl Jan, prof. RNDr., CSc. (23.09.2020)
|
|
||
Hall, M. Jr.: Combinatorial Theory, Wiley, New York, 1986 Last update: Zakouřil Pavel, RNDr., Ph.D. (05.08.2002)
|
|
||
The exam is oral and may be performed remotely. The knowledge and skills examined correspond to the syllabus in extent presented during the lectures. Common understanding to all notions and their relationship, theorems including proofs and ability to apply the acquired skills to simple situations related to the topics of the class are subject of the examination. Last update: Kratochvíl Jan, prof. RNDr., CSc. (23.09.2020)
|
|
||
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. Last update: Hladík Milan, prof. Mgr., Ph.D. (01.04.2015)
|