Daniel M. Roy12:00pm | Dilworth Room
Margaret Bilu4:30pm | Princeton University, Fine Hall 214
The Grothendieck group of varieties over a field k is the quotient of the free abelian group of isomorphism classes of varieties over k by the so-called cut-and-paste...
Marc Vinyals11:00am | Simonyi Hall 101
Randomness can provide an exponential saving in the amount of communication needed to solve a distributed problem, and the canonical example of this is the equality function....
David Gabai2:00pm | Simonyi Hall 101
We give the first examples of codimension-1 knotting in the 4-sphere, i.e. there is a 3-ball B1 with boundary the standard linear 2-sphere, which is not isotopic rel boundary...
Vinicius Ramos3:30pm | Simonyi Hall 101
Symplectic embedding problems are at the core of symplectic topology. Many results have been found involving balls, ellipsoids and polydisks. More recently, there has been...
Toniann Pitassi10:30am | Simonyi Hall 101
A pseudodeterministic algorithm for a search problem (introduced by Goldwasser and Gat) is a randomized algorithm that must output the *same* correct answer with high...
Roger Grosse12:00pm | Dilworth Room
I’ll discuss the Noisy Quadratic Model, the toy problem of minimizing a convex quadratic function with noisy gradient observations. While the NQM is simple enough to have...
10:00am | Simonyi Hall 101
Paul Nelson4:30pm | Simonyi Hall 101
We will discuss how to study the cubic moment of any family of automorphic L-functions on PGL(2) using regularized diagonal periods of Eisenstein series, following a strategy...
Henry Yuen11:00am | Simonyi Hall 101
MIP* (pronounced “M-I-P star”) denotes the class of problems that admit interactive proofs with quantum entangled provers. It has been an outstanding question to characterize...