Previous Conferences & Workshops

The security of several cryptosystems is based on our apparent inability to solve the following computational problem: given as input a basis B for a lattice and a target vector t , find the lattice point closest to t. This problem, referred to as...

One powerful theme in complexity theory and pseudorandomness in the past few decades has been the use of lower bounds to give pseudorandom generators (PRGs). However, the general results using this hardness vs. randomness paradigm suffer a...

Gowers' uniformity norms are defined by average of a function over specific sets of linear forms. We study norms that are similarly defined by a system of linear forms. We prove that for bounded complex functions over $F_p^n$, each such norm is...

I will describe the appearance of special values of Eisenstein series on E6, E7, and E8 that arose in studying the low energy expansion of the 4-graviton scattering amplitude in string theory (see arxiv:1004.0163 and 1111.2983). Through methods to...

We prove new lower bounds on the encoding length of Matching Vector (MV) codes. These recently discovered families of Locally Decodable Codes (LDCs) originate in the works of Yekhanin and Efremenko and are the only known families of LDCs with a...

It is a long-standing problem to lower bound the performance of randomized greedy algorithms for maximum matching. Aronson, Dyer, Frieze and Suen in1995 studied the modified randomized greedy (MRG) algorithm and proved that it approximates the...

1. A (very) special case of Deligne-Lusztig theory yields a construction of cuspidal irreducible representations of the finite group $GL_n(\mathbb F_q)$ in the cohomology of an algebraic variety equipped with an action of $GL_n(\mathbb F_q)$. There...