Algorithmic methods for enumerative combinatorics - lecture 1 | Vidéo | Carmin.tv

00:00:00 / 00:00:00

Algorithmic methods for enumerative combinatorics - lecture 1

By Christoph Koutschan

Appears in 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.

Information about the video

Date of recording 17/03/2025
Date of publication 31/03/2025
Institution CIRM
Licence CC BY NC ND
Language English
Audience Researchers, Graduate Students
Director(s) Luca Recanzone
Format MP4

Citation data

DOI 10.24350/CIRM.V.20327903
Cite this video Koutschan, Christoph (17/03/2025). Algorithmic methods for enumerative combinatorics - lecture 1. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.20327903
URL https://dx.doi.org/10.24350/CIRM.V.20327903

Domain(s)

Bibliography

DOUGHERTY-BLISS, Robert, KOUTSCHAN, Christoph, TER-SAAKOV, Natalya, et al. The (Symbolic and Numeric) Computational Challenges of Counting 0-1 balanced matrices. arXiv preprint arXiv:2410.07435, 2024. - https://doi.org/10.48550/arXiv.2410.07435
KOUTSCHAN, Christoph, UNCU, Ali Kemal, et WONG, Elaine. A Unified Approach to Unimodality of Gaussian Polynomials. In : Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation. 2023. p. 434-442. - https://doi.org/10.1145/3597066.3597113
KAUERS, Manuel et KOUTSCHAN, Christoph. Guessing with little data. In : Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation. 2022. p. 83-90. - https://doi.org/10.1145/3476446.3535486
KOUTSCHAN, Christoph et WONG, Elaine. Exact lower bounds for monochromatic Schur triples and generalizations. In : Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday. Cham : Springer International Publishing, 2020. p. 223-248. - https://doi.org/10.1007/978-3-030-44559-1_13

MSC codes

Document(s)

https://www.cirm-math.fr/RepOrga/3341/Slides/cours-koutschan-final.pdf

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow

Copyright Carmin.tv 2025

Give feedback