Previous Conferences & Workshops

The polar body is a fundamental concept in functional and convex analysis, representing a special convex set associated with any convex subset of Euclidean space. One can think of the polar operation as, roughly speaking, the "inverse" of convex...

Abstract: Chow quotients of projective varieties by affine torus actions provide alternative constructions of interesting geometric objects. For example, the moduli space of stable genus 0 curves with $n$ marked points arises as the Chow quotient of...

Abstract: We will discuss invariants of lattice polytopes and their subdivisions arising from Ehrhart and Hodge theory and introduce their matroid theoretic analogues which are enriched versions of the characteristic and Tutte polynomials.

Abstract: I will discuss some regular subdivisions of the permutahedron, one for each Coxeter element in the symmetric group. These subdivisions are "Bruhat interval" subdivisions, meaning that each face is the convex hull of the permutations in a...

We discuss what a "typical" short curve on a random large genus hyperbolic surface looks like. In particular, for each $L$, there are finitely many curves of length at most $L$. We find length scales at which such a curve chosen at random is highly...

Abstract: The general rule for the interactions between tropical geometry and moduli spaces of course is the following: everything you may wish is going to work like a charm in genus zero, and break down horribly in higher genus. This is the case...

Abstract: In his 2018 paper "Some Schubert shenanigans" Richard Stanley asked for the asymptotic behavior of the maximal principle specialization of a Schubert polynomial. Motivated by this, still open, question we explore the generalization to...

Abstract: We present new objects called quilts of alternating sign matrices with respect to two given posets. Quilts generalize several commonly used concepts in mathematics. For example, the rank function on submatrices of a matrix gives rise to a...

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 attained by these...