Mathematics Department Colloquium
|
|---|
| TIME | SPEAKER | TITLE |
| August 27
| Alexia Yavicoli
(University of British Columbia) |
On the Erdös Similarity Conjecture |
| September 3
| Sergio Fenley
(Florida State University) |
Exotic codimension one Anosov flows |
| September 17
| Yu Yuan
(University of Washington) |
TBD |
| October 2
| Alexander Barvinok
(University of Michigan) |
KOI Combinatorics Lectures |
| October 8
| Anne Gelb
(Dartmouth College) |
TBD |
| November 12
| Piotr Hajlasz
(The University of Pittsburgh) |
TBD |
| November 16-18
| Rado Lectures
(tbd) |
TBD |
| March 22-24
| Zassenhaus Lectures
(tbd) |
TBD |
Welcome Seminar Calendar Thursdays 3:00-3:55 pmLocation: Scott Labs E004 |
|---|
| TIME | SPEAKER | TITLE |
| September 10
| Vlad Kobzar
|
Online Komlós converges to mean curvature flow |
(V. Kobzar): We establish a direct connection between combinatorial discrepancy minimization problems and curvature flows in R^m. This is done by determining the long-time asymptotics of an online version of the classic vector balancing problem, known as the Komlós conjecture, and showing it is exactly determined by the extinction time of mean curvature flow on the m-dimensional cube. Our proof builds upon Kohn and Serfaty's work on deterministic games and mean curvature flow, and Banaszczyk's Euclidean analogue of the Beck-Fiala theorem. As a consequence of this geometric characterization, we show that the leading order term of the value of this game grows as \Theta (\sqrt { T \log m}) as the time horizon T gets large. This is joint work with Nestor Guillen at Courant available here. A geometric PDE-inspired perspective is also fruitful in the more classic, offline Komlós setting, and I will briefly preview our most recent results in this direction at the end of the talk.
This page is maintained by Marjorie Drake.