Abstract:
The kernel method has become one of the standard tools for solving lattice
path enumeration problems. I will start by introducing the method in the
context of constrained 1-dimensional random walks. When we move up to 2
dimensions, the generating functions of random walk models can display a
very broad range of analytic properties. In this context the kernel method
becomes much richer and I will demonstrate a few of the ways in which it may
be applied. I'll finish (time permitting) with a few open problems
concerning more complicated boundary conditions.
An introduction to the kernel method
31.10.2017 15:15 - 16:45
Organiser:
M. Drmota
Location: