Previous Conferences & Workshops

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

We consider the problem of constructing pseudorandom generators for read-once circuits. We give an explicit construction of a pseudorandom generator for the class of read-once constant depth circuits with unbounded fan-in AND, OR, NOT and...

Shannon's notion of entropy measures the amount of "randomness" in a process. However, to an algorithm with bounded resources, the amount of randomness can appear to be very different from the Shannon entropy. Indeed, various measures of...

I will report on some recent work on multiple zeta values. I will sketch the definition of motivic multiple zeta values, which can be viewed as a prototype of a Galois theory for certain transcendental numbers, and then explain how they were used to...