Previous Conferences & Workshops

Abstract: Several equivalent definitions of rank for matrices yield non-equivalent definitions of rank when generalized to higher order tensors. Understanding the interplay between these different definitions is related to important questions in...

Abstract: A problem from theoretical computer science posed by Buhrman asks to show that a certain class of circuits (NC0[+]) is bad at decoding error correcting codes under random noise. (This would be in contrast with an analogous class of quantum...

Abstract: Translational tiling is a covering of a space using translated copies of a building block, called a "tile", without any positive measure overlaps. What are the possible ways that a space can be tiled?
The most well known conjecture in this...

Suppose we are given a random rank-r order-3 tensor---that is, an n-by-n-by-n array of numbers that is the sum of r random rank-1 terms---and our goal is to recover the individual rank-1 terms. In principle this decomposition task is possible when...

Abstract: We will discuss some results on high-degree varieties designed to expand the reach of the polynomial method and explain their applications in incidence geometry.

This workshop brought together researchers with diverse backgrounds ranging from algebra and algebraic geometry to combinatorics, harmonic analysis, and theoretical computer science. The aim was to learn from each...

Abstract: Irreducibility of random polynomials of large degree has been studied recently in works by several authors (in particular by Bary-Soroker, Kozma, Koukoulopoulos and by Varju and myself). We study analogous problems in the setting of word...