This course covers recent theoretical and algorithmic developments in combi-natorics. It begins with an overview of classical probabilistic methods such as first- and second-moment methods and the local lemma, and of some funda-mental notions and results in extremal combinatorics, such as set systems, graph partitions, and Turán-type problems. The courses then moves on to give an in-depth treatment of the following topics at the cutting-edge of research:the Moser-Tardos algorithm, and derandomization of probabilistic algo-rithms more generally; recent improvements to the Sunflower Lemma and their application to com-puter science and the study of random graphs; the method of Hypergraph Containers and its applications; Vapnik-Chervonenkis dimension and its applications to statistical learning and computational geometry.
Current Topics and Algorithms in Combinatorics, 7.5 hp
Spring Term 2021
24 March 2021
6 June 2021
Type of studies
The course requires a minimum of 90 ECTS in Mathematics or Computer Science, of which at least 60 ECTS must be in Mathematics including a course in Discrete Mathematics of at least 7.5 ECTS and a course in Statistics of at least 7.5 ECTS which includes elementary Probability Theory. Proficiency in English equivalent to Swedish upper secondary course English 5/A. When the language of instruction is Swedish, applicants must prove proficiency in Swedish to the level required for basic eligibility for higher studies.
Applicants in some programs at Umeå University have guaranteed admission to this course. The number of places for a single course may therefore be limited.
Application deadline was
15 October 2020.
Please note: This second application round is intended only for EU/EEA/Swiss citizens.