Previous Conferences & Workshops

Many problems in classical topology can be formulated as decision problems, with yes/no answer and an algorithm as a solution. While such problems often appear to be intuitively hard, we still know little about lower bounds on their algorithmic...

A basic technique in algebra, when describing a difficult-to-approach category like Tilt, is to choose a projective generator and study its endomorphism ring. The modern twist on this technique is to choose the projective generator with great...

A polynomial with nonnegative coefficients is strongly log-concave if it and all of its derivatives are log-concave as functions on the positive orthant. This rich class of polynomials includes many interesting examples, such as homogeneous real...

Establishing inequalities among graph densities is a central pursuit in extremal graph theory. One way to certify the nonnegativity of a graph density expression is to write it as a sum of squares or as a rational sum of squares. In this talk, we...