Orateur
Paul Zinn-Justin
(University of Melbourne)
Description
24 years ago, Jean-Bernard suggested we work together on the enumeration of knots, tangles and links using matrix models and related combinatorial tools. Though we managed to derive some exact results, many questions remain unanswered, including the important issue of the asymptotic enumeration of knot diagrams as the number of crossings goes to infinity. In this talk I will give an update on these questions, both on the theoretical side (precise predictions from QFT coupled to 2D gravity) and on the numerical side.