Previous Conferences & Workshops

Does computing n copies of a function require n times the computational effort? In this work, we give the first non-trivial answer to this question for the model of randomized communication complexity. We show that: 1. Computing n copies of a...

A three dimensional strongly pseudoconvex Cauchy Riemann manifold can be considered as a contact manifold with a conformal structure on the hyperplane distribution. In this talk, we will discuss CR structures near the standard one on S^3 , the...

Sofic groups are the groups whose Cayley graph that can be approximated by finite graphs. This class of groups contains many known classes, e.g. profinite and amenable groups. Quite a few conjectures are known to hold for sofic groups. The most...

A number of recent results on optimization problems involving submodular functions have made use of the "multilinear relaxation" of the problem. I will show a general approach to deriving inapproximability results in the value oracle model, based on...

Speaking at a general level, a major goal of the p-adic Langlands program (from a global, rather than local, perspective) is to find a p-adic generalization of the notion of automorphic eigenform, the hope being that every p-adic global Galois...

The "sigma_k Yamabe problem" is a fully nonlinear generalization of the Yamabe problem, in which one attempts to find a conformal multiple of a given metric to make constant the k-th elementary symmetric function of the eigenvalues of the Schouten...