YoVDO

Enumeration of Maps via Integrability

Offered By: Erwin Schrödinger International Institute for Mathematics and Physics (ESI) via YouTube

Tags

Combinatorics Courses Graph Theory Courses Generating Functions Courses Integrability Courses Topological Recursion Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the fascinating world of map enumeration in this 46-minute lecture by Valentin Bonzom at the Erwin Schrödinger International Institute for Mathematics and Physics. Delve into the history of map counting, from Tutte's pioneering work in the 1960s to modern approaches using integrability. Learn how generating functions of maps satisfy the KP hierarchy and how this leads to efficient recurrence formulas for enumerating maps by size and genus. Discover the work of Goulden and Jackson on triangulations, as well as contributions by Carrell, Chapuy, Kazarian, and Zograf on general and bipartite maps. Examine recent developments in non-oriented map enumeration, including Bonzom's collaborative work with Chapuy and Dolega. Gain insights into deriving the KP hierarchy from Tutte's equation, understanding recurrence formulas, and appreciating the significance of non-oriented cases in map enumeration.

Syllabus

Valentin Bonzom - Enumeration of maps via integrability


Taught by

Erwin Schrödinger International Institute for Mathematics and Physics (ESI)

Related Courses

Analytic Combinatorics, Part II
Princeton University via Coursera
Analysis of Algorithms
Princeton University via Coursera
Analytic Combinatorics
Princeton University via Coursera
Combinatorial Mathematics | 组合数学
Tsinghua University via edX
Современная комбинаторика (Modern combinatorics)
Moscow Institute of Physics and Technology via Coursera