Seminar • Algorithms and Complexity • Computability and Complexity in Analytic Combinatorics

Please note: This seminar will take place in DC 1302 and online.

Steve Melczer, Assistant Professor
Department of Combinatorics and Optimization

Enumerative combinatorics studies discrete objects by capturing aspects of their behaviour (such as the number of objects of a given size) using sequences. In this talk we explore how to combine pure mathematical tools with computational methods to answer questions about the computability and complexity of asymptotic behaviour for sequences under different encodings that arise frequently in combinatorics. Applications discussed will include (time permitting) the analysis of classical algorithms, models predicting the shape of biomembranes, queuing theory, random walks, ratchet models for gene expression, transcendence of zeta values, restricted permutations, maximum likelihood degree in algebraic statistics, sampling algorithms for perfect matchings in bipartite graphs, and parallel synthesis for DNA storage.

To join this seminar on Zoom, please go to https://uwaterloo.zoom.us/j/96421483975.