MTH4153 Combinatorics

Combinatorics is the study of arrangements and combinations of discrete objects. Combinatorial problems arise in many areas of pure mathematics, (e.g. algebra, probability, topology, and geometry), and in many applied areas as well (e.g. communications, operations research, experiment design, genetics, statistical physics etc). This unit will cover a selection of topics from the following list: combinatorial enumeration, ordinary and exponential generating functions, asymptotic enumeration, counting via matrix functions or group actions, the principle of inclusion-exclusion, Mobius inversion, permutations, partitions, compositions, combinatorial designs, Latin squares, Steiner triple systems, block designs, Hadamard matrices, finite geometries, algebraic combinatorics, strongly regular graphs, symmetric functions, Young tableaux, additive combinatorics and combinatorial geometry.