Previous Conferences & Workshops

In this talk, we will discuss how the circle method can be used to count solutions to Diophantine problems. After a brief overview of the circle method's history and applications, we will sketch how to prove an asymptotic for the number of integer...

I will present a construction of an n-point negative type metric such that every t-point sub-metric is isometrically L1-embeddable, but embedding the whole metric into L1 incurs distortion at least k, where both t and k are (\log\log\log n)^{\Omega...

We will see how Hodge theory can be a systemic way of finding geometric structures hidden in (higher dimensional) data.

The list decoding problem consists of finding the list of all codewords that differ from an input string (the received word) in at most a certain fraction of positions (equal to the target error-correction radius). Informally, the list decoding...

We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula F is a propositional formula in which each variable appears exactly once. Such a formula...

In the '70s, Kadanoff, Luther and Peschel conjectured universal formulas among the critical indices of certain Ising-like, 2 dimensional, statistical models. We present a proof of some of these formulas.

In this talk, I will discuss several topics related to transverse knots in contact 3-manifolds. I will introduce a conjecture on the maximal self-linking number of a topological knot in the standard contact 3-sphere. I will show how to apply braid...