Previous Conferences & Workshops

Nov
14
2016

Computer Science/Discrete Mathematics Seminar I

The mathematics of natural algorithms
11:15am|S-101

I will review some of the recent techniques we've used in our study of natural algorithms. These include Dirichlet series for matrix products, mean-field approximations in opinion dynamics, graph sequence grammars, and tools for renormalizing...

Nov
12
2016

Differential Privacy Symposium

9:30am
Time:9:30am-5:30pmLocation:Wolfensohn Hall

Differential privacy disentangles learning about a dataset as a whole from learning about an individual data contributor. Just now entering practice on a global scale, the...

Nov
10
2016

Joint IAS/Princeton University Number Theory Seminar

Albanese of Picard modular surfaces, and rational points
Mladen Dimitrov
4:30pm|Fine 214, Princeton University

This is a report on a work in progress in collaboration with Dinakar Ramakrishnan. A celebrated result of Mazur states that open modular curves of large enough level do not have rational points. We study analogous questions for the Picard modular...

Nov
09
2016

Analysis/Mathematical Physics Seminar

Strong ballistic transport for quasiperiodic Schrodinger operators and Lieb-Robinson bounds for XY spin chains
1:30pm|S-101

I will discuss some results and open questions related to transport properties of 1D quasiperiodic operators with absolutely continuous spectra, and their relations to integrable many-body systems. Most of the results will be based on https://arxiv...

Nov
09
2016

Working Seminar on Representation Theory

$\mathbb C$-representation theory of $p$-adic groups through the glass of types
11:00am|S-101

It is well known that representations of open compact subgroups (called types) play a fundamental role in studying representations of $p$-adic groups. We give an overview of the theory (after Bernstein, Moy-Prasad, Bushnell-Kutzko) in connection...

Nov
08
2016

Computer Science/Discrete Mathematics Seminar II

Exact tensor completion via sum of squares
10:30am|S-101

In the matrix completion problem, we have a matrix $M$ where we are only given a small number of its entries and our goal is to fill in the rest of the entries. While this problem is impossible to solve for general matrices, it can be solved if $M$...