Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the second lecture in a series on algorithmic methods for enumerative combinatorics, delivered by Christoph Koutschan at the Centre International de Rencontres Mathématiques in Marseille, France. Discover various algorithmic approaches that help solve combinatorial problems, including recurrence guessing, closure properties for D-finite functions, creative telescoping, and cylindrical algebraic decomposition. Learn how these techniques, implemented in modern computer algebra systems, can be effectively applied to enumerative combinatorics through numerous practical examples. This 76-minute lecture was recorded during the "ALEA Days" thematic meeting in March 2025. Access this video and other mathematical talks on CIRM's Audiovisual Mathematics Library, which offers helpful features like chapter markers, keywords, abstracts, bibliographies, and multi-criteria search functionality.
