Previous Conferences & Workshops

I will talk about two natural notions of convergence for sequences of graphs of bounded degree and their connection to groups and group actions. The first is Benjamini-Schramm convergence, which is strongly related to parameter testing. The second...

We describe some results concerning the number of connected components of nodal lines of high frequency Maass forms on the modular surface. Based on heuristics connecting these to a critical percolation model, Bogomolny and Schmit have conjectured...

The polynomial Freiman-Ruzsa conjecture is one of the important open problems in additive combinatorics. In computer science, it already has several diverse applications: explicit constructions of two-source extractors; improved bounds for the log...

My goal in this talk is to survey some of the emerging applications of polynomial methods in both learning and in statistics. I will give two examples from my own work in which the solution to well-studied problems in learning and statistics can be...

In joint work with Paul Valiant, we consider the tasks of estimating a broad class of statistical properties, which includes support size, entropy, and various distance metrics between pairs of distributions. Our estimators are the first proposed...

We explain in this talk how Ramanujan graphs can be used to devise optimal cycle codes and review how other graph families related to a construction proposed by Margulis yield interesting families of quantum codes with logarithmic minimum distance...

The families of motives of the title arise from classical one-variable hypergeometric functions. This talk will focus on the calculation of their corresponding L-functions both in theory and in practice. These L-functions provide a fairly wide class...