Computer Algebra for Lattice path Combinatorics - INRIA - Institut National de Recherche en Informatique et en Automatique Access content directly
Habilitation À Diriger Des Recherches Year : 2017

Computer Algebra for Lattice path Combinatorics

Calcul Formel pour la Combinatoire des Marches

Alin Bostan
  • Function : Author
  • PersonId : 831654

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.
Fichier principal
Vignette du fichier
HDR.pdf (1003.62 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

tel-01660300 , version 1 (12-12-2017)

Identifiers

  • HAL Id : tel-01660300 , version 1

Cite

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

Share

Gmail Mastodon Facebook X LinkedIn More