Coursebooks

Probabilistic methods in combinatorics

MATH-467

Lecturer(s) :

Marcus Adam Wade

Language:

English

Summary

We develop a sophisticated framework for solving problems in discrete mathematics through the use of randomness (i.e., coin flipping). This includes constructing mathematical structures with unexpected (and sometimes paradoxical) properties for which no other methods of construction are known.

Content

Keywords

random variable, expected value, probabilistic method, random graph

Learning Prerequisites

Required courses

Probability theory

Recommended courses

Important concepts to start the course

Graph, random variable, expectation, variance, binomial coefficients, asymptotics, eigenvalues

Learning Outcomes

By the end of the course, the student must be able to:

Transversal skills

Teaching methods

Lectures and exercises

Expected student activities

Attending the lectures, solving the exercises, reading sections from the textbook

Assessment methods

Exam written

Dans le cas de l'art. 3 al. 5 du Règlement de section, l'enseignant décide de la forme de l'examen qu'il communique aux étudiants concernés.

Resources

Bibliography

Noga Alon-Joel Spencer: The Probabilistic Method (Wiley)

Ressources en bibliothèque

In the programs

Reference week

 MoTuWeThFr
8-9     
9-10     
10-11     
11-12     
12-13     
13-14    MAA330
14-15    
15-16    MAA330
16-17    
17-18     
18-19     
19-20     
20-21     
21-22     
 
      Lecture
      Exercise, TP
      Project, other

legend

  • Autumn semester
  • Winter sessions
  • Spring semester
  • Summer sessions
  • Lecture in French
  • Lecture in English
  • Lecture in German