Computer Algebra for Lattice path Combinatorics

Abstract : 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.
Document type :
Habilitation à diriger des recherches
Complete list of metadatas

https://hal.archives-ouvertes.fr/tel-01660300
Contributor : Alin Bostan <>
Submitted on : Tuesday, December 12, 2017 - 11:10:59 AM
Last modification on : Wednesday, December 20, 2017 - 1:16:53 AM
Long-term archiving on: Tuesday, March 13, 2018 - 12:33:09 PM

File

HDR.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : tel-01660300, version 1

Collections

Citation

Alin Bostan. Computer Algebra for Lattice path Combinatorics. Symbolic Computation [cs.SC]. Université Paris 13, 2017. ⟨tel-01660300⟩

Share

Metrics

Record views

238

Files downloads

319