Past Events

Any translation surface can be presented as a collection of polygons in the plane with sides identified. By acting linearly on the polygons, we obtain an action of GL(2,R) on moduli spaces of translation surfaces. Recent work of Eskin, Mirzakhani...

We describe a thin family of Dirichlet L-functions which have an irregular and perhaps unexpected behavior in their value distribution. This behavior has an arithmetic explanation and corresponds to the nonvanishing of a certain Gauss type sum. We...

Nati Linial raised the following basic problem in 2006: given a k-dimensional simplicial complex S, how many facets can a k-complex on n vertices have if it contains no topological copy of S? This is a beautiful and natural question, but results in...

Abstract

Abstract : Khovanov homology, though relatively young, is difficult to survey in an hour. This talk will nevertheless attempt to do so, by focussing on the problem of characterizing thin links—those links with simplest-possible Khovanov homology...

Any translation surface can be presented as a collection of polygons in the plane with sides identified. By acting linearly on the polygons, we obtain an action of GL(2,R) on moduli spaces of translation surfaces. Recent work of Eskin, Mirzakhani...

I will give an overview of a few places where combinatorial structures have an interesting role to play in quantum field theory and which I have been involved in to varying degrees, from the Connes-Kreimer Hopf algebra and other renormalization Hopf...

For a given $\epsilon > 0$, we say that a graph $G$ is $\epsilon$-flexibly $k$-choosable if the following holds: for any assignment $L$ of lists of size $k$ on $V(G)$, if a preferred color is requested at any set $R$ of vertices, then at least $...

Due to unforseen circumstances, this talk has been cancelled and will be rescheduled for a future date. We apologize for the inconvenience. Speaker Abstract: Diffusion methods help understand and denoise data sets; when there is additional structure...

The Erdos-Hajnal conjecture states that for every graph H there exists c > 0 such that every n-vertex graph G either contains H as an induced subgraph, or has a clique or stable set of size at least n^c. I will talk about a proof of this conjecture...