Last modified: 31 May 2022 13:05
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.
Study Type | Undergraduate | Level | 1 |
---|---|---|---|
Term | Second Term | Credit Points | 15 credits (7.5 ECTS credits) |
Campus | Aberdeen | Sustained Study | No |
Co-ordinators |
|
* 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 * Extermal problems * The Pigeonhole Principle * Ramsey theory * Graph theory
Syllabus
Information on contact teaching time is available from the course guide.
Alternative Assessment
Course Assignment - 30%
Course Assignment - 30%
Course Assignment - 40%
Alternative Resit Assessment
Resubmission of failed elements (pass marks carried forward)
There are no assessments for this course.
Knowledge Level | Thinking Skill | Outcome |
---|---|---|
Factual | Remember | ILO’s for this course are available in the course guide. |
We have detected that you are have compatibility mode enabled or are using an old version of Internet Explorer. You either need to switch off compatibility mode for this site or upgrade your browser.