Video Lectures

Separate tags with a comma.

We develop a simple geometric variant of the Kabatiansky-Levenshtein approach to proving sphere packing density bounds. This variant gives a small improvement to the best bounds known in Euclidean space (from 1978) and an exponential improvement in...

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...