Counting Families of Combinatorial Objects with Complex Analysis

Room 3.08 of DMat at UMinho | - | 14:30


António Machiavelo

CMUP - University of Porto


Abstract ::  The methods of Analytic Combinatorics [1], namely using Complex Analysis to count families of combinatorial objects, have been extensively used and refined in the last years. We will give an overview to those methods based on the works [2] and [3], and will describe some of the challenges of use them in some intricate settings related to Theoretical Computer Science.

[1] P. Flajolet and R. Sedgewick. Analytic Combinatorics, Cambridge University Press, 2008. [2] Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis, A Hitchhiker’s Guide to Descriptional Complexity Through Analytic Combinatorics, Theoretical Computer Science 528 (2014) 85–100. [3] Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis, Analytic Combinatorics and Descriptional Complexity of Regular Languages on Average, ACM SIGACT News, 51(1):38–56, March 2020.

Seminar Room of DMat-UMinho (3.08), and via zoom at

Seminar for the Doctoral Program in Applied Mathematics (MAP-PDMA Seminar)