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...
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...
In FT-mollification, one smooths a function while maintaining
good quantitative control on high-order derivatives. This is a
continuation of my talk from last week, and I will continue to
describe this approach and show how it can be used to show...
The braid group on n strands may be viewed as an infinite analog
of the symmetric group on n elements with additional topological
phenomena. It appears in several areas of mathematics, physics and
computer sciences, including knot theory...
