Previous Conferences & Workshops

Abstract: This will be a broad talk about coherence of groups, and how it relates to conjectures about hyperbolic groups with planar boundaries. A group is coherent if every finitely generated subgroup is finitely presented. This is a property...

Are factors of sparse polynomials sparse? This is a really basic question and we are still quite far from understanding it in general. In this talk, I will discuss a recent result showing that this is in some sense true for multivariate polynomials...

Kazhdan–Lusztig (KL) polynomials for Coxeter groups were introduced in the 1970s, providing deep relationships among representation theory, geometry, and combinatorics. In 2016, Elias, Proudfoot, and Wakefield defined analogous polynomials in the...

In the early 1930's, the Ergodic theorems of von Neumann and Birkhoff put Boltzmann's Ergodic Hypothesis in mathematical terms, and the natural question was born: is ergodicity the "general case" among conservative dynamical systems? Oxtoby and Ulam...

Constraint satisfaction problems (CSPs) are a central topic of study in computer science. A fundamental question about CSPs is as follows. Given a CSP where each constraint has the form of some predicate P and almost all of the constraints can be...