Algorithmic methods for enumerative combinatorics - lecture 2
Apparaît dans la collection : ALEA Days 2025 / Journées ALEA 2025
We showcase several algorithmic methods that can assist in solving combinatorial problems. Such algorithms include recurrence guessing, closure properties for D-finite functions, creative telescoping, or cylindrical algebraic decomposition, which are implemented in many today's computer algebra systems. We demonstrate with numerous examples how these can be applied beneficially in the context of enumerative combinatorics.
