Analytic combinatorics aims to enable precise quantitative predictions of the properties of
large combinatorial structures. The theory has emerged over recent decades as essential …

The combinatorial theory of species, introduced by Joyal in 1980, provides a unified
understanding of the use of generating functions for both labelled and unlabelled structures …

This survey presents a unified and essentially self-contained approach to the asymptotic
analysis of a large class of sums that arise in combinatorial mathematics, discrete …

Asymptotic enumeration methods provide quantitative information about the rate of growth of
functions that count combinatorial objects. Typical questions that these methods answer …

The concept of a Riordan array is used in a constructive way to find the generating function
of many combinatorial sums. The generating function can then help us to obtain the closed …

This article proposes a surprisingly simple framework for the random generation of
combinatorial configurations based on what we call Boltzmann models. The idea is to …

A systematic approach to the random generation of labelled combinatorial objects is
presented. It applies to structures that are decomposable, ie, formally specifiable by …

This book is a clear and self-contained introduction to discrete mathematics. Aimed mainly at
undergraduate and early graduate students of mathematics and computer science, it is …

This paper presents a new static analysis for deriving upper bounds on the expected
resource consumption of probabilistic programs. The analysis is fully automatic and derives …

If you ask a mathematician what they love most about mathematics, certain answers
invariably arise: beauty, abstraction, creativity, logical structure, connection (between …