Previous Conferences & Workshops

Expressing combinatorial invariants of matroids as intersection numbers on algebraic varieties has become a popular tool in algebraic combinatorics. Several conjectured inequalities among combinatorial data can be traced back to positivity results...

In 2008, looking to bound the face vectors of tropical linear spaces, Speyer introduced the g-invariant of a matroid, defined in terms of exterior powers of tautological bundles on Grassmannians. He proved its coefficients nonnegative for matroids...

A common heuristic in Diophantine approximation asserts that different arithmetic expansions (such as digit and continued-fraction expansions) should be independent of one another. In some cases, these elementary heuristics have led to surprisingly...

Suppose f is a function with Fourier transform supported on the unit sphere in $R^d$. Elias Stein conjectured in the 1960s that the $L^p$ norm of f is bounded by the $L^p$ norm of its Fourier transform, for any $p> 2d/(d-1)$.  We propose to study...

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...