Mathematical Conversations

Feb 19 2020

Regularization effect of gradient flow dynamics

Speaker: Yaoyu Zhang
6:00pm | Dilworth Room
I will introduce a math problem from deep learning regarding the regularization effect of gradient flow dynamics for underdetermined problems.
Feb 12 2020

p-adic numbers in cryptography and Rocky Horror

Speaker: Mark Goresky
6:00pm | Dilworth Room
This is a shameless repeat of a Math Conversations I gave about four years ago, and maybe four years before that as well, explaining 2-adic shift registers.
Feb 05 2020

Anosov flows in 3-manifolds and the fundamental group

Speaker: Rafael Potrie
6:00pm | Dilworth Room
The goal of the talk is to explain the statement and proof of a beautiful result due to Margulis (1967) later extended by Plante and Thurston (1972) that imposes restrictions on the growth of the fundamental group of 3-manifolds that support Anosov flows.
Jan 22 2020

What is a Motive?

Speaker: Pierre Deligne
6:00pm | Dilworth Room
I will explain the source of Grothendieck philosophy of motives, and tell of applications.
Jan 15 2020


Speaker: George Deligiannidis
6:00pm | Dilworth Room
I will talk about an approach to proving exponential mixing for some kinetic, non-diffusive stochastic processes, that have recently become popular in computational statistics community.
Dec 18 2019

Faster and Simpler Algorithms for Robust Statistics

Speaker: Yu Cheng
6:00pm | Dilworth Room
In this talk, we will discuss some of the recent advances in high-dimensional robust statistics. In particular, we will focus on designing faster and simpler robust algorithms for fundamental statistical and machine learning problems.  
Dec 11 2019

Cohomology Theories and Formal Groups

Speaker: Jacob Lurie
6:00pm | Dilworth Room
In the 1960's, Quillen found a remarkable relationship between a certain class of cohomology theories and the theory of formal groups. This discovery has had a profound impact on the development of stable homotopy theory. In this talk, I'll give a brief exposition of Quillen...
Dec 04 2019

Episodic memory from first principles

Speaker: Michelangelo Naim
6:00pm | Dilworth Room
To understand human memory one needs to understand both the ability to acquire vast amounts of information and at the same time the limited ability to recall random material. We have recently proposed a model for recalling random unstructured information that gives an...
Nov 27 2019


6:00pm | Dilworth Room
Nov 20 2019

Some challenging graph inequality

Speaker: Fan Wei
6:00pm | Dilworth Room
A main theme in extremal combinatorics is about asking when the random construction is close to optimal. A famous conjecture of Erd\H{o}s-Simonovits and Sidorenko states that if $H$ is a bipartite graph, then the random graph with edge density $p$ has in expectation...