Past Events

Networks are everywhere in biology - from molecules that interact within a cell to neurons that communicate across the brain. Understanding how signals flow through these networks is key to uncovering how biological systems function - and how they...

In this talk, I will describe the life of a researcher working in the games industry. Along the way, I’ll introduce some of the research we do at CD PROJEKT RED and the kinds of technical challenges we deal with. I’ll also talk about how I found...

Pick your favorite manifold M and a positive integer r : how many r rank (topological) complex vector bundles are there over M up to isomorphism? While the question is accessible via K-theory in the stable range, unstably such bundles become much...

The Haglund--Haiman--Loehr theorem (2005) provides a combinatorial formula for the modified Macdonald polynomials, highlighting the surprising connections between modified Macdonald polynomials and combinatorial statistics such as the major index and...

We will introduce Random Spanning Trees in Random Environment (RSTRE), a disordered system on spanning trees that interpolates between the Uniform Spanning Tree (UST) and Minimum Spanning Tree (MST) measures. Our primary goal is to study how local...

In this talk, I will describe the mathematics behind proving lower bounds on quantum circuit depth using light-cone arguments. These arguments have been used to prove lower bounds on the complexities of physically relevant ground states. No quantum...

A classical problem in signal recovery is to determine whether a finite signal can be recovered from its Fourier transform with missing values. This problem has been studied by many authors starting with the seminal papers by Matolsci and Szuks in...

Given a finite transitive group G ≤ Sym(Ω), a set F ⊂ G is intersecting if for any g, h ∈ G, there exists ω ∈ Ω such that ω g = ω h . The intersection den- sity ρ(G) is the maximum ratio of |F| |Gω| , where F runs through all intersecting sets of G...

A guiding question in arithmetic statistics is: Given a degree $n$ and a Galois group $G$ in $S_n$, how does the count of number fields of degree $n$ whose normal closure has Galois group $G$ grow as their discriminants tend to infinity? In this talk...

This talk presents the Proximal Galerkin (PG) method, a high-order numerical method for solving variational problems with inequality constraints. PG combines two foundational ideas from applied mathematics: Galerkin discretizations of partial...