Analytic combinatorics of discrete differential equations
Published in Mathematics
Speakers
- Eva-Maria Hainzl — École Polytechnique
Abstract
Discrete differential equations (DDEs), also known as catalytic equations, appear in the enumeration of several combinatorial classes, such as lattice walks, polyominoes, planar maps, parking trees and many more. Given a first order DDE with positive coefficients, we discuss its generic combinatorial interpretation in terms of non-negative Q-trees, which are trees where each vertex consists of a chain of blue, red and black pearls and the difference of blue and red pearls, called the excess, satisfies a non-negativity condition in each subtree. We study their asymptotic enumeration and limit laws of certain parameters using analytic combinatorics.
Looking for more in the field?
Explore more events from Journal of Algebraic Combinatorics Webinar Series and Springer Nature's Mathematics & Statistics.
Follow the Topic
-
Journal of Algebraic Combinatorics
The Journal of Algebraic Combinatorics provides a single forum for papers on algebraic combinatorics that used to be distributed throughout a number of journals. Research contributions in the field are increasingly seen to have substantial links with other areas of mathematics.
