We study the local testabilty of sparse linear codes. This
problem is intimately connected to the problem of tolerant
linearity testing of Boolean functions under nonuniform
distributions. We give linearity tests for several natural
and...
The $\lambda$-invariant is an invariant of an imaginary
quadratic field that measures the growth of class numbers in
cyclotomic towers over the field. It also measures the number of
zeroes of an associated $p$-adic L-function. In this talk, I
will...
The complexity of simple stochastic games (SSGs) has been open
since they were defined by Condon in 1992. Such a game is played by
two players, Min and Max, on a graph consisting of max nodes, min
nodes, and average nodes. The goal of Max is to...
