Alin Bostan (INRIA Saclay Île-de-France) Computer algebra for lattice path combinatorics

SKU:

$0.00

Unavailable

per item

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.

• Facebook
• Twitter
• Pinterest
• Google+

Quantity

Add to Cart