Previous Conferences & Workshops

Abstract: We characterize the topology of the space of Lorentzian polynomials with a given support in terms of the local Dressian. We prove that this space can be compactified to a closed Euclidean ball whose dimension is the rank of the Tutte group...

I will discuss the Hanna Neumann conjecture of the 1950's and some tools in graph theory that I used to solve it.  The tools include sheaf theory on graphs, Galois theory for graphs, and the preservation of "local properties" under base change (for...

Abstract: This talk asks which tropicalisations of subvarieties of the torus know the cohomology of the original variety. A motivating example are linear embeddings of complements of hyperplane arrangements. 

We can prove that the tropicalisation...

Gamow introduced the liquid drop model in 1928 as a model for the nucleus. I will discuss some recent work (with Ian Ruohoniemi) concerning roundness of minimizers. 

Local Langlands correspondence (LLC) is a conjectural finite-to-one map from representations of a p-adic reductive group G to the set of L-parameters for G. Recently there have been two major advances in this area: Kaletha's characterization of the...

Extremal black holes are special solutions of Einstein’s equations which have absolute zero temperature in the thermodynamic analogy of black hole mechanics. In this talk, I will present a proof that extremal black holes arise on the critical...

Abstract: The foundation of a matroid is an algebraic invariant that controls representations over any partial field, hyperfield, or more generally, any pasture. We show that, under certain conditions, the foundation of a generalized parallel...

Abstract: After a gentle introduction to matroids, I will present parts of a new OSCAR software module for matroids through several examples. I will focus on computing the moduli space of a matroid which is the space of all arrangements of...

Computational problems exhibit a diverse range of behaviors in terms of how quickly and effectively they can be solved.  What underlying mathematical structure (or lack thereof) in a computational problem leads to an efficient algorithm for solving...