Skip to Main content Skip to Navigation

Analytic Combinatorics in Several Variables : Effective Asymptotics and Lattice Path Enumeration

Stephen Melczer 1, 2
2 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : The field of analytic combinatorics, which studies the asymptotic behaviour ofsequences through analytic properties of their generating functions, has led to thedevelopment of deep and powerful tools with applications across mathematics and thenatural sciences. In addition to the now classical univariate theory, recent work in thestudy of analytic combinatorics in several variables (ACSV) has shown how to deriveasymptotics for the coefficients of certain D-finite functions represented by diagonals ofmultivariate rational functions. This thesis examines the methods of ACSV from acomputer algebra viewpoint, developing rigorous algorithms and giving the firstcomplexity results in this area under conditions which are broadly satisfied.Furthermore, this thesis gives several new applications of ACSV to the enumeration oflattice walks restricted to certain regions. In addition to proving several openconjectures on the asymptotics of such walks, a detailed study of lattice walk modelswith weighted steps is undertaken.
Complete list of metadata

Cited literature [240 references]  Display  Hide  Download
Contributor : Abes Star :  Contact Connect in order to contact the contributor
Submitted on : Thursday, September 14, 2017 - 3:53:32 PM
Last modification on : Saturday, September 11, 2021 - 3:18:44 AM


Version validated by the jury (STAR)


  • HAL Id : tel-01587716, version 1


Stephen Melczer. Analytic Combinatorics in Several Variables : Effective Asymptotics and Lattice Path Enumeration. Symbolic Computation [cs.SC]. Université de Lyon, 2017. English. ⟨NNT : 2017LYSEN013⟩. ⟨tel-01587716⟩



Record views


Files downloads