Past Events

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 groundbreaking paper in 1948 "a mathematical theory of communication", Shannon provided a mathematical foundation for the concept of information and subsequently established the fundamental constraints on storing and transmitting information...

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

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

In this talk, we will discuss an estimate for a discrete mean value of the Riemann zeta function and its derivatives multiplied by Dirichlet polynomials. Assuming the Riemann Hypothesis, we obtain a lower bound for the 2kth moment of all the...

In the previous talk, we got comfortable with the category of Artin local rings. In this second part, we will move on to functors of Artin rings, deformation functors, and some examples. Time permitting, we will discuss Schlessinger's theorem, giving...

Every group admits a unitary representation on a Hilbert space. In other words, every group can be realized concretely as symmetries on a Hilbert space. From these representations we can construct objects known as C*-algebras. This invites the use of...

The word complexity function p(n) of a subshift X measures the number of n-letter words appearing in sequences in X, and X is said to have linear complexity if p(n)/n is bounded. It's been known since work of Ferenczi that linear word complexity...