Previous Conferences & Workshops

In this talk we will present a near-optimal compression scheme for bounded-round randomized 2-party communication protocols. Previously, such a scheme was only known for protocols where the inputs to the parties are independent. The results yield a...

Abstract - TristanRoy.pdf

Discrete problems have a habit of being beautiful but difficult. This can be true even of discrete problems whose continuous analogues are easy. For example: computing the surface area of a sphere of radius N^{1/2} in k-dimensional Euclidean space...

Write $a \prec b$ if $b \equiv 1 \pmod{a}$. A prime chain is a chain $p_1 \prec p_2 \prec \dotsb \prec p_k$ whose components are prime numbers. In my talk, I will sketch the proof of the fact that the number of prime chains above $p$ (i.e., with $p...

The Ramanujan conjecture states that for a holomorphic cusp form $f(z) =\sum_{n \in N} \lambda_f(n)e(nz)$ of weight $k$, the coefficients $\lambda_f(n)$ satisfy the bound $|\lambda_f(n)| \ll_\epsilon n^{(k−1)/2+\epsilon}$. In the case where $k$ is...