## 2013 Women and Mathematics

May 21, 2013

Review Sessions/Women in Science Seminar

Yve-Alain Bois

Pablo Picasso did not speak often about abstraction, but when he did, it was either to dismiss it as complacent decoration or to declare its very notion an oxymoron. The root of this hostility is to be found in the impasse that the artist reached in the summer 1910, when abstraction suddenly appeared as the logical development of his previous work, a possibility at which he recoiled in horror. But though he swore to never go again near abstraction, he could not prevent himself from testing his... Read more

May 21, 2013

Review Sessions/Women in Science Seminar

Sören Petrat

Member, School of Mathematics

November 16, 2016

The talk is about the dynamics of a tracer particle coupled strongly to a dense non-interacting electron gas in two dimensions. I will present a recent result that shows that for high densities the tracer particle moves freely for very long times.

Constantin Teleman

University of California, Berkeley and Oxford University

November 15, 2016

I will recall the construction of the space of states in a gauged topological A-model. Conjecturally, this gives the quantum cohomology of Fano symplectic quotients: in the toric case, this is Batyrev’s presentation of quantum cohomology of toric varieties. Time permitting, I will discuss the role of “Coulomb branches” in gauge theory in relation to equivariant quantum and symplectic cohomology.

Eshan Chattopadhyay

Member, School of Mathematics

November 15, 2016

Seeded and seedless non-malleable extractors are non-trivial generalizations of the more commonly studied seeded and seedless extractors. The original motivation for constructing such non-malleable extractors are from applications to cryptography (privacy amplification and tamper-resilient cryptography). Interestingly, explicitly constructing non-malleable extractors have led to many new connections and progress in pseudoranomness as well.

November 12, 2016

Guy Rothblum

Weizmann Institute of Science

November 12, 2016

Adam Marcus

Princeton University; Member, School of Mathematics

November 14, 2016

For certain applications of linear algebra, it is useful to understand the distribution of the largest eigenvalue of a finite sum of discrete random matrices. One of the useful tools in this area is the "Matrix Chernoff" bound which gives tight concentration around the largest eigenvalue of the expectation. In some situations, one can get better bounds by showing that the sum behaves (in some rough way) like one would expect from Gaussian random matrices.

Bernard Chazelle

Princeton University

November 14, 2016

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 network-based dynamical systems. If time permits, I will also discuss anti-mixing techniques for self-sustaining iterated learning. The talk will be self-contained and non-technical.

Aaron Roth

University of Pennsylvania

November 12, 2016

Helen Nissenbaum

Cornell Tech and New York University

November 12, 2016