AofA: Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms / AofA: méthodes probabilistes, combinatoires et asymptotiques pour l analyse d algorithmes

Collection AofA: Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms / AofA: méthodes probabilistes, combinatoires et asymptotiques pour l analyse d algorithmes

Organizer(s) Bassino, Frédérique ; Martínez, Conrado ; Salvy, Bruno

Date(s) 24/06/2019 - 28/06/2019

linked URL https://conferences.cirm-math.fr/1940.html

00:00:00 / 00:00:00

4 5

Computer algebra for lattice path combinatorics

Classifying lattice walks in restricted lattices is an important problem in enumerative combinatorics. Recently, computer algebra has been used to explore and to solve a number of difficult questions related to lattice walks. We give an overview of recent results on structural properties and explicit formulas for generating functions of walks in the quarter plane, with an emphasis on the algorithmic methodology.

Information about the video

Date of recording 27/06/2019
Date of publication 25/07/2019
Institution CIRM
Licence CC BY NC ND
Language English
Audience Researchers
Director(s) Guillaume Hennenfent
Format MP4

Citation data

DOI 10.24350/CIRM.V.19539803
Cite this video Bostan, Alin (27/06/2019). Computer algebra for lattice path combinatorics. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.19539803
URL https://dx.doi.org/10.24350/CIRM.V.19539803

Domain(s)

Bibliography

BOSTAN, Alin. Computer Algebra for Lattice Path Combinatorics. Computer, 2017, vol. 2, p. 47. - http://emis.ams.org/journals/SLC/wpapers/s74vortrag/bostan3.pdf

MSC codes

Document(s)

https://www.cirm-math.fr/RepOrga/1940/Slides/aofa19-bostan.pdf

Last related questions on MathOverflow

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

Ask a question on MathOverflow

All the collection videos

56:41

published on July 26, 2019

Algorithms in high-dimensional non-convex landscapes

By Lenka Zdeborova

01:10:29

published on July 26, 2019

Sampling algorithms and phase transitions

By Dana Randall

01:02:10

published on July 26, 2019

The challenge of linear-time Boltzmann sampling

By Andrea Sportiello

58:56

published on July 25, 2019

Computer algebra for lattice path combinatorics

By Alin Bostan

01:02:42

published on July 26, 2019

Metastability of the contact process on evolving scale-free networks

By Peter Mörters

Copyright Carmin.tv 2024

Give feedback