Learning Outcomes:
On completion of this module the student should be able to demonstrate an adeptness with structures and concepts in discrete mathematics; solve enumeration problems related to these discrete structures; demonstrate a proficiency with the theory of partially ordered sets; state and prove results in discrete mathematics; solve a variety of problems in discrete mathematics such as characterisation theorems and recursive decompositions.
Indicative Module Content:
Principles and techniques of counting; discrete structures that include graphs, words, permutations, and lattice paths; recursion and generating functions; the theory of partially ordered sets; Young tableaux and the RSK Correspondence; permutation statistics and permutation patterns.