UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

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

Thumbnail Image

Files

Melczer_Stephen.pdf (4.74 MB)

Date

2017-06-26

Authors

Melczer, Stephen

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

The field of analytic combinatorics, which studies the asymptotic behaviour of sequences through analytic properties of their generating functions, has led to the development of deep and powerful tools with applications across mathematics and the natural sciences. In addition to the now classical univariate theory, recent work in the study of analytic combinatorics in several variables (ACSV) has shown how to derive asymptotics for the coefficients of certain D-finite functions represented by diagonals of multivariate rational functions. This thesis examines the methods of ACSV from a computer algebra viewpoint, developing rigorous algorithms and giving the first complexity results in this area under conditions which are broadly satisfied. Furthermore, this thesis gives several new applications of ACSV to the enumeration of lattice walks restricted to certain regions. In addition to proving several open conjectures on the asymptotics of such walks, a detailed study of lattice walk models with weighted steps is undertaken.

Description

Keywords

Analytic Combinatorics, Enumerative Combinatorics, Singularity Analysis, Computer Algebra, Lattice Paths, Rational Diagonals, Polynomial Systems

LC Keywords

Citation

URI

http://hdl.handle.net/10012/12039

Collections

Theses
Computer Science