Computer algebra for lattice path combinatorics | Vidéo | Carmin.tv

00:00:00 / 00:00:00

Computer algebra for lattice path combinatorics

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

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

Copyright Carmin.tv 2026

Give feedback