English
Algorithmic methods for enumerative combinatorics - lecture 1
Multi angle
Auteurs : Koutschan, Christoph (Auteur de la Conférence)
CIRM (Editeur )
05A19 - Combinatorial identities, bijective combinatorics
05A20 - Combinatorial inequalities
68W30 - Symbolic computation and algebraic computation
47L20 - Operator ideals
Ressources complémentaires :
https://www.cirm-math.fr/RepOrga/3341/Slides/cours-koutschan-final.pdf
CIRM (Editeur )
Loading the player...
|
Résumé :
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.
Keywords : cylindrical algebraic decomposition; CAD; lattice reduction; LLL; recurrence guessing; D-finite function; creative telescoping
Codes MSC : Keywords : cylindrical algebraic decomposition; CAD; lattice reduction; LLL; recurrence guessing; D-finite function; creative telescoping
05A19 - Combinatorial identities, bijective combinatorics
05A20 - Combinatorial inequalities
68W30 - Symbolic computation and algebraic computation
47L20 - Operator ideals
Ressources complémentaires :
https://www.cirm-math.fr/RepOrga/3341/Slides/cours-koutschan-final.pdf
|
Informations sur la Vidéo
Réalisateur : Récanzone, LucaLangue : Anglais Date de publication : 00/00/0000 Date de captation : 17/03/2025 Sous collection : Research School arXiv category : Combinatorics ; Symbolic Computation Domaine : Algebra ; Combinatorics ; Computer Science Format : MP4 (.mp4) - HD Durée : 01:14:19 Audience : Researchers ; Graduate Students ; Doctoral Students, Post-Doctoral Students Download : https://videos.cirm-math.fr/2025-03-17_Koutschan_1.mp4 
|
Informations sur la Rencontre
Nom de la rencontre : ALEA Days / Journées ALEAOrganisateurs de la rencontre : Fang, Wenjie ; Jugé, Vincent ; Noy, Marc ; Pivoteau, Carine Dates : 17/03/2025 - 21/03/2025 Année de la rencontre : 2025 URL Congrès : https://conferences.cirm-math.fr/3341.html
Données de citation
DOI : 10.24350/CIRM.V.20327903Citer cette vidéo: Koutschan, Christoph (2025). Algorithmic methods for enumerative combinatorics - lecture 1. CIRM. Audiovisual resource. doi:10.24350/CIRM.V.20327903 URI : http://dx.doi.org/10.24350/CIRM.V.20327903 |
Voir aussi
- [Multi angle] Algorithmic methods for enumerative combinatorics - lecture 2 / Auteur de la Conférence Koutschan, Christoph.
- [Multi angle] Pattern avoiding 3-permutations and triangle bases / Auteur de la Conférence Schabanel, Juliette.
- [Multi angle] Maths and AI / Auteur de la Conférence Lelarge, Marc.
- [Multi angle] Chaînes montantes-descendantes et limites d'échelle / Auteur de la Conférence Féray, Valentin.
Bibliographie
- 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
Imagette Video
