Previous Conferences & Workshops

Let $n > 1$. Given two maps of an $n$-dimensional sphere into Euclidean $2n$-space with disjoint images, there is a $\mathbb Z/2$ valued linking number given by the homotopy class of the corresponding Gauss map. We prove, under some restrictions on...

We prove that there exists a constant $\epsilon > 0$ such that, assuming the Exponential Time Hypothesis for PPAD, computing an $\epsilon$-approximate Nash equilibrium in a two-player ($n \times n$) game requires quasi-polynomial time, $n^{\log^{1-o...

The law of quadratic reciprocity and the celebrated connection between modular forms and elliptic curves over $\mathbb Q$ are both examples of reciprocity laws. Constructing new reciprocity laws is one of the goals of the Langlands program, which is...

For a constant $\epsilon$, we prove a $\mathrm{poly}(N)$ lower bound on the communication complexity of $\epsilon$-Nash equilibrium in two-player $N \times N$ games. For $n$-player binary-action games we prove an $\exp(n)$ lower bound for the...

Following Katz-Nishinou, we will compute the number of lines on a quintic threefold in $\mathbb P^4$ by degenerating the quintic to the union of coordinate hyperplanes. This motivates degeneration formulae in Gromov-Witten theory that I will give...