## The Matching Problem in General Graphs is in Quasi-NC

We show that the perfect matching problem in general graphs is in Quasi-NC. That is, we give a deterministic parallel algorithm which runs in polylogarithmic time on quasi-polynomially many processors. The result is obtained by a derandomization of the Isolation Lemma for perfect matchings, which was introduced in the classic paper by Mulmuley, Vazirani and Vazirani to obtain a Randomized NC algorithm.

## Modular symbols and arithmetic

## Edward T. Cone Concert Series: Surface Image

## Transfer operators between relative trace formulas in rank one II

I will introduce a new paradigm for comparing relative trace formulas, in order to prove instances of (relative) functoriality and relations between periods of automorphic forms.

## Sieve methods: what are they, and what are they good for?

## A PSPACE construction of a hitting set for the closure of small algebraic circuits

We study the complexity of constructing a hitting set for the class of polynomials that can be infinitesimally approximated by polynomials that are computed by polynomial sized algebraic circuits, over the real or complex numbers. Specifically, we show that there is a PSPACE algorithm that given nsr in unary outputs a set of inputs from of size poly(nsr), with poly(nsr) bit complexity, that hits all $n$-variate polynomials of degree $r$ that are the limit of size $s$ algebraic circuits.

## Transfer operators between relative trace formulas in rank one

I will introduce a new paradigm for comparing relative trace formulas, in order to prove instances of (relative) functoriality and relations between periods of automorphic forms.