Past Events

The question of which nilpotent Lie algebras admit complex structures is far from being understood. In recent decades, progress has primarily focused on providing algebraic obstructions to the existence of such structures, with classification results...

This session will highlight the research of Indigenous mathematicians and mathematics, showcasing the breadth and depth of their contributions across various mathematical disciplines. From theoretical research to practical applications and...

Gradient flows have emerged as a powerful framework for analyzing machine learning and statistical inference algorithms. Motivated by several applications in statistical inference, generative models, generalization, and robustness of learning...

Current LLM alignment techniques use pairwise human preferences at a sample level, and as such, they do not imply an alignment on the distributional level. We propose in this paper Alignment via Optimal Transport (AOT), a novel method for...

Abstract: Recently, Machine Learning (ML) approaches to data assimilation and modeling have been very successful in interpreting large amounts of data, such as human behavior prediction, marketing, etc. However, direct applications of machine...

A vibrant and classic area of research is that of relating the size of a set to the finite point configurations that it contains. Here, size may refer to cardinality, dimension, or measure. It is a consequence of the Lebesgue density theorem, for...

Mathematical models of human interactions are important and widely used in epidemiology and many other fields, but building and working with these models at scale is challenging. I will explain two software tools for doing this, both based on...

There has been extensive study of diagonalization of matrices. Diagonalization can be viewed as using a similarity transform to concentrate the magnitude of all entries within as small a subset of entries as possible. We motivate and present results...

Let ord p ( a ) be the order of a in ( Z / p Z ) ∗ . In 1927, Artin conjectured that the set of primes p for which an integer a ≠ − 1 , ◻ is a primitive root (i.e. ord p ( a ) = p − 1 ) has a positive asymptotic density among all primes. In 1967...

Lots of problems in combinatorics and analysis are connected to upper bounds for incidences: given a set of points and tubes, how much can they intersect? This talk is about lower bounds for incidences, a topic that has received much less attention...