Combinatorics: Doron Puder (TAU) "Meanders and Non-Crossing Partitions"

Mon, 20/03/201711:00-13:00
Rothberg B220 (CS bldg)
Speaker: Doron Puder, TAU
Title: Meanders and Non-Crossing Partitions
Abstract: Imagine a long river and a closed (not self-intersecting) racetrack that crosses the river by bridges 2n times. This is called a meander. How many meanders are there with 2n bridges (up to homeomorphisms of the plane that stabilizes the river)? This challenging question, which is open for several decades now, has connections to several fields of mathematics.
I will mostly present the topic and pause some questions, but will also discuss some partial results based on work in progress with Alexandru Nica and Ian Goulden.