Past Events

For integers k>=1 and n>=2k+1, the Kneser graph K(n,k) has as vertices all k-element subsets of an n-element ground set, and an edge between any two disjoint sets. It has been conjectured since the 1970s that all Kneser graphs admit a Hamilton cycle...

A central problem in quantum chemistry is the computation of the lowest eigenvalue of the electronic Hamiltonian - an unbounded, self-adjoint operator acting on a Hilbert space of antisymmetric functions. The main difficulty in the resolution of this...

Many biological populations reside in increasingly fragmented landscape, where habitat quality may change abruptly in space. A reaction-diffusion model for a single species population which propagates in a heterogeneous landscape in a one-dimensional...

The Weierstrass ℘-function plays a great role in the classic theory of complex elliptic curves. A related function, the Weierstrass zeta-function, is used by Guerzhoy to construct preimages under the ξ -operator of newforms of weight 2, corresponding...

From explaining the complex mechanisms underlying the light-harvesting chlorophyll molecule to understanding the origin of superconducting in novel 2D materials, an incredible range of scientific phenomena are governed by interacting systems of...

In the seminal 1948 paper "a mathematical theory of communication", Shannon introduced the concept of a classical source as a random variable and established its optimal compression rate, given by Shannon entropy. Nearly five decades later...

We present various results and conjectures regarding unlikely intersections of orbits for families of Drinfeld modules. Our questions are motivated by the groundbreaking result of Masser and Zannier (from 15 years ago) regarding torsion points in...

Artin groups are a family of groups that generalize braid groups, and are closely related to Coxeter groups. They are mysterious - a lot of basic questions about them remain unanswered. In this talk, I will focus on profinite properties of Artin...

Since suggested by Tur\'an in 1941, determining the Tur\'an density of hypergraphs has been a notoriously difficult problem at the center of extremal combinatorics. Subsequently, several natural variants of this problem have been suggested, most...

Tropicalization is a way to understand the asymptotic behavior of algebraic (or semi-algebraic) sets through polyhedral geometry. In this talk, I will talk about the tropicalization of the principal minors of positive semidefinite matrices. This...