Previous Conferences & Workshops

An “oblivious subspace embedding” (OSE) is a distribution over matrices S such that for any low-dimensional subspace $V$, with high probability over the choice of $S$, $\|Sx\|_2$ approximately equals $\|x\|_2$ (up to $1 + \epsilon$ multiplicative...

For a set of polynomials F, we define their bilinear complexity as the smallest k so that F lies in an ideal generated by k bilinear polynomials. The main open problem is to estimate the bilinear complexity of the single polynomial $\sum_{i,j}x_i^2...

The random loop representations of Toth ('93) and Aizenman-Nachtergaele ('94) can be extended to describe certain SU(2)-invariant spin-1 Heisenberg models. Quantum spin correlations are given in terms of loop correlations. Existence of long-range...