

Polyhedral sets, lattice points, optimizing compilers and computer algebra - lecture 2
De Marc Moreno Maza


Polyhedral sets, lattice points, optimizing compilers and computer algebra - lecture 1
De Marc Moreno Maza
De Alin Bostan
Apparaît dans la 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.