Wednesday, March 6, 2019
All day 

Before 1am
1am
2am
3am
4am
5am
6am
7am
8am
9am
10am
11am
12pm
1pm
2pm
3pm
4pm
5pm
6pm
7pm
8pm
9pm
10pm
11pm

03/06/2019  4:00pm We consider the problem of certifying an upper bound on the maximum value of a random quadratic form over the hypercube, which corresponds to the problem of optimizing the Hamiltonian of the SherringtonKirkpatrick model of statistical physics. We will show that, conditional on the “lowdegree polynomials conjecture” concerning the computational hardness of random problems, there is no polynomialtime algorithm certifying a better upper bound than the largest eigenvalue of the coefficient matrix. If time permits we will discuss connections to optimization in random graphs. Location:
LOM 200
03/06/2019  4:15pm This talk will be about the analogy between functions and spaces and exporting back and forth constructions that seem more natural in one setting or the other. Among the players are interpolation, entropy, persistent homology, and variational problems. The ultimate goal is to shed some light on the geometry of nonlinear function spaces, and use this to understand the complexity of the solutions of classical topological problems. Location:
215 LOM
