Computer Algebra for Lattice Path Combinatorics
Résumé
Classifying lattice walks in restricted lattices is an important problem in enumerative combinatorics. Recently, computer algebra methods have been used to explore and solve a number of difficult questions related to lattice walks. In this course, we will 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.
Fichier principal
ellwangen15-l1.pdf (2.86 Mo)
Télécharger le fichier
ellwangen15-l2.pdf (1.9 Mo)
Télécharger le fichier
ellwangen15-l3.pdf (3.24 Mo)
Télécharger le fichier
Loading...