Print and PDF Options

MATH 4811 [0.5 credit] Combinatorial Design Theory (Honours)

Existence and construction of combinatorial designs: finite geometries, pairwise balanced designs, balanced incomplete block designs, Steiner triple systems, symmetric designs, PBD closure, latin squares, transversal designs, and applications to information theory.
Prerequisite(s): MATH 3855, or permission of the School.
Lectures three hours a week.