Previous Conferences & Workshops

In this talk, we present a new method to solve algorithmic and combinatorial problems by (1) reducing them to bounding the maximum, over x in {-1, 1}^n, of homogeneous degree-q multilinear polynomials, and then (2) bounding the maximum value...

Let X be a smooth rigid-analytic space over C_p. In contrast to algebraic geometry, it turns out that there are many pro-etale Q_p local systems on X that do not admit any Z_p-lattice. Furthermore, cohomology of these local systems often fail to be...

In the late 1800s, in the course of his study of classical problems of number theory, the young Hermann Minkowski discovered the importance of a new kind of geometric object that we now call a convex set. He soon developed a rich theory for...

The satisfiability problem for Constraint Satisfaction Problems (CSPs) asks whether an instance of a CSP has a fully satisfying assignment, i.e., an assignment that satisfies all constraints. This problem is known to be in class P or is NP-complete...

Equivariant cohomology was introduced in the 1960s by Borel, and has been studied by many mathematicians since that time.  The talks will be an introduction to some of this work.  We will focus on torus-equivariant cohomology (as well as Borel-Moore...

The reverse Khovanskii-Teissier inequality is a three term inequality for nef divisors which first appeared in the context of Kähler geometry. It provides an upper bound on a product of two divisors in terms of products with the third, hence its...

Equivariant cohomology was introduced in the 1960s by Borel, and has been studied by many mathematicians since that time.  The talks will be an introduction to some of this work.  We will focus on torus-equivariant cohomology (as well as Borel-Moore...

Extremal eigenvalues of graphs are of particular interest in theoretical computer science and combinatorics. Specifically, the spectral gap—the difference between the largest and second-largest eigenvalues—measures the expansion properties of a...