Past Events

Abstract: The number of independent sets in the hypercube {0,1}^d was estimated precisely by Korshunov and Sapozhenko in the 1980s and recently refined by Jenssen and Perkins. In this talk we will discuss new results on the number of independent sets...

Abstract: Given square matrices A_1, ..., A_d we can consider random products and the associated (top) Lyapunov exponent. We will consider two applications where the Lyapunov exponent plays an interesting role: firstly to barycentric subdivisions of...

The number of homomorphisms from a graph H to a graph G, denoted by hom(H;G), is the number of maps from V(H) to V(G) that yield a graph homomorphism, i.e., that map every edge of H to an edge of G. Given a fixed collection of finite simple graphs {H...

Mammalian orthoreovirus (reovirus) is naturally an enteric virus that spreads among most mammals without causing disease. Reovirus also can infect and kill cancer cells while leaving normal cells unharmed, and is now in phase III clinical trials as a...

Please see the kickoff announcement for a full schedule and details of each talk.

Abstract: In this talk I will introduce several geometric data sets related to the distance function either on Riemannian or Finsler manifolds with boundary. I consider differences of these data sets, and for each of them I will provide geometric...

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...

The distance matrix of a connected graph $G$ is an $n \times n$ matrix $D(G) = [d_{ij}]$, where $d_ij$ is the distance between the vertices $v_i$ and $v_j$ . The distance spectrum of $G$ is ${\lambda_1, . . . , \lambda_n}$, where $\lambda_i$ are the...