Previous Conferences & Workshops

In this talk, I'll present a new inequality which, for an arbitrary boolean function, relates the influence of its variables to decision tree computation of the function. Combining this with another inequality due to Schramm and Steif, we deduce new...

I'll try to explain what we currently understand about the theoretical power of quantum computers, in a way that's accessible to a general math and physics audience. In particular, I'll demolish the popularly-held belief that quantum computing means...

The infinity Laplacian (informally, the "second derivative in the gradient direction") is a simple yet mysterious operator with many applications. "Tug of war" is a two player random turn game played as follows: SETUP: Assign each player one of two...

The main goal of this talk will be to present a proof of the following theorem. Theorem 1: For every fixed \delta >0 here is a polynomial time (in n = log N) computable function(s) f:[N]x[N]-->{0,1}, for which the following hold. For every two sets...

In 2002, J.B. Conrey and K. Soundararajan showed that there are infinitely many Dirichlet $L$-functions which do not vanish on the critical segment. Let $\mathcal{G}$ be the family of Dirichlet $L$-functions they considered. Following their work, a...

Ordinary 3-by-3 tic-tac-toe is trivial; the 3-dimensional 4-by-4-by-4 version is interesting but very complicated (first player wins; solved by Patashnik; heavy computer use); and the 5-by-5-by-5 version is already unsolved (expected to be a draw)...