Past Events

I will discuss how to formulate and prove a localization theorem for the virtual fundamental class of a moduli space with a relative perfect obstruction theory over a singular base. In the motivating example of the moduli space of stable log maps, I...

The summatory Mobius function M ( x ) is an important arithmetic function in number theory that contains information regarding primes and square-free numbers, and has strong links to the Riemann zeta function. Its growth rate is a difficult subject...

This is the first of two talks in Algebraic K-theory. I will introduce the lower K-groups (0, 1 and 2) through the study of projective modules and their automorphisms, give a few examples and properties. The exact sequences that arise from the lower...

A good way to understand the structure of a finite group is through its representations. The family of representations of a group on a fixed field has several properties: it is closed by finite direct sums, by tensor products, it contains the dual...

Communication is essential to all relationships, and the teaching and learning of mathematics is no exception. In this talk, I will share reflections and experiences that highlight how communication shapes my relationships with students, colleagues...

Pattern formation is a fundamental element of many processes in developmental biology. One example is the self-organization of microtubules (MTs) along the inner surface (cortex) of the plant cell membrane. MTs are dynamic polymers found within many...

A broad class of computational tasks can be phrased as the problem of determining whether two cooperating players, Alice and Bob, can convince a referee that a given statement involving relations between variables is true. Classic examples include...

In the late 70s, in a series of three seminal papers, Keane and Smorodinsky proved a finitary version of the Ornstein isomorphism theorem, first for Bernoulli schemes and then for Markov shifts. For Markov chains over a countable state space, the...

Integer lattices play a central role in mathematics and computer science, with applications ranging from number theory and coding theory to combinatorial optimization. Over the past three decades, they have also become a cornerstone of modern...

In this talk, I will talk about applications of the entropy method and a tool that we call the mixture bound. To demonstrate how the mixture bound can be applied, I will show how one can prove Lovász’s version of the Kruskal–Katona theorem. I will...