Скачать или смотреть Alin Bostan: 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.

Recording during the meeting "AofA: Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms" the June 27, 2019 at the Centre International de Rencontres Mathématiques (Marseille, France)

Filmmaker: Guillaume Hennenfent

Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual Mathematics Library: http://library.cirm-math.fr. And discover all its functionalities:
Chapter markers and keywords to watch the parts of your choice in the video
Videos enriched with abstracts, bibliographies, Mathematics Subject Classification
Multi-criteria search by author, title, tags, mathematical area