Previous Conferences & Workshops

I will continue with demonstrations of the power of partial drivatives in Arithmetic Complexity and beyond. No background from the previous talk will be needed.

Avoider-Enforcer games are a misere version of somewhat more popular Maker-Breaker games. An Avoider-Enforcer game is played by two players, called Avoider and Enforcer, on a hypergraph H=(V,E) (typically the vertices of H are the edges of the...

Drinfeld has initiated two geometric approaches to global Langlands conjectures over function fields: one by constructing automorphic sheaves and another one by realizing representations in cohomology of the moduli spaces of F-sheaves (also known as...

I plan to survey a number of results, some very old and some very new, mainly proving lower bounds on arithmetic circuits. Common to all is the (often surprising, at least till you get used to it) demonstration of the power of partial derivatives.

Hardness amplification is a major line of research that mainly seeks to transform a given lower bound (e.g. a function that has correlation at most 99% with small circuits) into a strongly average-case one (i.e. a function that has negligible...

For the Rankin-Selberg L-function L(s, , ), there are central value formulas or derivative formulas depending on its root number. Using theta-lifting, Waldspurger showed an explicit formula relating the central value to certain period integral. We...