Winter School on Combinatorics and Computing

COURSE DATES : December 8th – December 12th

4 courses, 6 hours each (24h total)
2h of small research talks

 

APPLICATION DEADLINE : November 16, 2025

LANGUAGE : English

STUDY LEVEL : Students in their final year of a  bachelor’s degree or the first year of a master’s degree.

NUMBER OF ECTS : 3

 

Description of the winter school

The Winter School on Combinatorics and Computing is an international winter school designed to introduce advanced students (equivalent to the third or fourth year of university studies) to the foundations of combinatorics and theoretical computer science. Its goal is to strengthen their scientific background through intensive training that combines theoretical lectures and practical workshops in an immersive multicultural environment.

Special attention is given to making mathematics accessible to all. To this end, we focus on topics that require little or no prerequisites but allow students to engage with concrete and practical aspects of subjects that can lead to genuine research directions.

With the help of the ERUA, we offer students who might otherwise not afford to attend international conferences or workshops the opportunity to take part in an active research environment — an experience that can significantly enhance their academic profile if they choose to pursue an academic career.

 

Learning outcomes

  • Acquire basic knowledge in various topics in between combinatorics and computer science.
  • Learn to connect theoretical concepts with algorithmic or computational applications.
  • Strengthen problem-solving skills through guided exercises and small projects.
  • Discover topics related to fundamental research in between mathematics and computer science.
  • Collaborate in an international and multidisciplinary environment.

 

Assessment methods

  • Exercises to hand in during practice/problem-solving sessions
  • Coding projects integrating the topics covered

 

Why You Should Apply:

If you are currently studying mathematics, computer science, or a related field, and you are curious about advancing your knowledge (and even getting a glimpse of some research-level
ideas) in discrete mathematics, this school is made for you.

It offers a unique opportunity to explore, through a series of short courses, various topics at the intersection of mathematics and computer science. The aim is to spark your curiosity and deepen your interests as you progress in your studies.

If you are also considering pursuing an academic or research-oriented path, the school will give you a first experience of the research environment through mini-lectures and presentations on current research topics.

Who can apply

 This course is open to everyone, with ERUA and Paris 8 students being particularly welcome to apply.

How to apply

If you are interested, please submit your application by November 16, 2025 to the following address:
https://paris8.moveonfr.com/locallogin/660eb384386d1ea0ce0c5ad8/eng

Your application should include:

  • CV
  • Cover letter (no AI-generated letters, please!)

If your application is accepted, you and your ERUA local team will be notified by November 19, 2025 and if you are selected they will inform you about travel and accommodation funding.

If you have any other administrative questions about the course, please contact your local ERUA team at your university or Paris 8 local team (erua.eui@univ-paris8.fr).

 

Recommended bibliography

  • Baader F, Nipkow T. Term Rewriting and All That. Cambridge University Press; 1998.
  • Flajolet P, Sedgewick R. Analytic Combinatorics. Cambridge University Press; 2009.
  • Stanley R. P, Enumerative Combinatorics, volumes 1 and 2, Cambridge University Press.

Follow Us:

Copyright © 2024 ERUA
All Rights Reserved

Co-funded by the European Union. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or European Education and Culture Executive Agency (EACEA). Neither the European Union nor the granting authority can be held responsible for them