Previous Conferences & Workshops

In this talk I will first motivate lifting theorems where lower bounds on communication complexity for composed functions are obtained by a general simulation theorem, essentially showing that no protocol can do any better than the obvious "query"...

Filling a curve with an oriented surface can sometimes be "cheaper by the dozen". For example, L. C. Young constructed a smooth curve drawn on a projective plane in $\mathbb R^n$ which is only about 1.5 times as hard to fill twice as it is to fill...

Diagonalization is incredibly important in every field of mathematics. I am a representation theorist, so I will start by motivating the uses of diagonalization in representation theory. Then comes a brief introduction to categorical representation...

It is known that any opened necklace with beads of n types can be partitioned by at most (k-1)n cuts into intervals that can be distributed into k collections, each containing the same number of beads of each type (up to 1). The proof is topological...

This talk reports on joint work with Maria Bertozzi, Tara Holm, Emily Maw, Grace Mwakyoma, Ana Rita Pires, and Morgan Weiler on a WiSCon project to investigate the embedding capacity function of the one-point blow up of $\mathbb CP^2$. We found...