Last modified: 22 May 2019 17:07
Combinatorics is the branch of mathematics concerned with counting. This includes counting structures of a given kind (enumerative combinatorics), deciding when certain criteria can be met, finding "largest", "smallest", or "optimal" objects (external combinatorics and combinatorial optimization), and applying algebraic techniques to combinatorial problems (algebraic combinatorics). The course is recommended to students of mathematics and computing science.
|Session||Second Sub Session||Credit Points||15 credits (7.5 ECTS credits)|
* Induction * Growth rates * Subsets and binomial coefficients (subsets of fixed size, properties of binomial coefficients, the binomial therem) * Partitions and Bell numbers * Counting with symmetry * Recurrences * Generating functions * Derangements * Principle of inclusion-exclusion * External problems * The Pigeonhole Principle * Ramsey theory * Graph theory
Information on contact teaching time is available from the course guide.
1st Attempt: 1 two-hour written examination (80%); in-course assessment (20%). Resit: 1 two-hour written examination paper (maximum of (100%) resit and (80%) resit with (20%) in-course assessment).
Informal assessment of weekly homework through discussions in tutorials.
In-course assignments will normally be marked within one week and feedback provided to students in tutorials.