The aim of this CIMPA school will be to familiarise graduate students and young researchers with the field of enumerative and analytic combinatorics, and to show its many connections to other areas, especially computer science. The courses range from introductory to more advanced levels. The introductory courses will lay the groundwork by discussing the basic concepts (such as generating functions and q-series) and techniques (various enumeration techniques and analytic methods such as singularity analysis). The more advanced courses will build on these and discuss various more specialised topics, related to random graphs and trees, automata and the analysis of algorithms. These topics are connected in various ways, not only methodologically.
Course 1: “Enumeration methods”, Dimbinaina RALAIVAOSAONA (Stellenbosch University, South Africa)
Course 2: “Introduction to Analytic Combinatorics”, Frédérique BASSINO (Université Paris 13, France)
Course 3: “Partitions and q-series”, Darlison NYIRENDA (University of the Witwatersrand, South Africa)
Course 4: “Automata and Transducers”, Clemens HEUBERGER (Alpen-Adria Universität Klagenfurt, Austria)
Course 5: “Split trees and Galton Watson trees: Two important classes of random trees”, Cecilia HOLMGREN (Uppsala University, Sweden)
Course 6: “Advanced Algorithms”, Vonjy RASENDRAHASINA (ENS Université d’Antananarivo, Madagascar)
Course 7: “Analysis of algorithms”, Amalia DUCH-BROWN (Universitat Politècnica de Catalunya, Spain)
All participants must register here.
Application to a CIMPA financial support, follow the instructions given here.
Deadline for registration and application: March 15, 2020.
Dimbinaina Ralaivaosaona, PhD
Tel: +27 21 808 9506
Address: Mathematics Division
Mathematics/Industrial Psychology Building
7600 Stellenbosch, SOUTH AFRICA