Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore algorithmic methods for solving combinatorial problems in this first lecture by Christoph Koutschan from the "ALEA Days" thematic meeting at Centre International de Rencontres Mathématiques in Marseille, France. Discover techniques including recurrence guessing, closure properties for D-finite functions, creative telescoping, and cylindrical algebraic decomposition that are implemented in modern computer algebra systems. Learn through numerous examples how these algorithms can be beneficially applied to enumerative combinatorics problems. The lecture was recorded on March 17, 2025, and is available with helpful features like chapter markers, keywords, abstracts, bibliographies, and Mathematics Subject Classification on CIRM's Audiovisual Mathematics Library.
