MT5862 Discrete Geometry
Academic year
2025 to 2026 Semester 1
Curricular information may be subject to change
Further information on which modules are specific to your programme.
Key module information
SCOTCAT credits
15
SCQF level
SCQF level 11
Availability restrictions
Module runs in alternating odd years
Planned timetable
Lectures - Mon (weeks 1, 3, 5, 8, 10), Wed & Fri- 12 noon
Module Staff
TBA
Module description
Discrete geometry is concerned with combinatorial properties of geometric objects such as point sets, arrangements of affine and projective subspaces, convex polytopes, and geometric graphs. This module introduces the area, covering the basic objects and selected key results.
Relationship to other modules
Pre-requisites
BEFORE TAKING THIS MODULE YOU MUST PASS MT2504 AND PASS MT3501 AND ( PASS MT3502 OR PASS MT3505 OR PASS MT3852 OR PASS MT4003 OR PASS MT4514 OR PASS MT4516 OR PASS MT4512 )
Assessment pattern
2-hour Written Examination = 100%
Re-assessment
Oral examination = 100%
Learning and teaching methods and delivery
Weekly contact
2.5 hour lectures (9 weeks), 1 hour tutorial (10 weeks)
Scheduled learning hours
33
Guided independent study hours
120
Intended learning outcomes
- Know how to work with the basic objects of discrete geometry: point configurations, hyperplane arrangements, polytopes, and geometric graphs. This means being able to define them, state the important properties, and use them to construct proofs that solve unseen problems.
- Be able to define projective duality and translate problems about point configurations to ones about hyperplane arrangements and vice versa. In particular, students will know and use the building blocks of the proof of the Main Theorem of Polytopes and apply the theorem itself
- Know how to apply combinatorial methods to geometric problems and use geometric representations of combinatorial objects to go in the other direction. Examples include using Ramsey’s Theorem to find large cyclic subsets of point configurations and solving combinatorial partitioning problems using the Ham Sandwich Theorem
- Be able to state and prove Euler’s formula for planar graphs (assuming appropriate topological results) and be able to apply it to derive structural properties of planar graphs and results such as the Crossing Number Lemma