Past Events

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

As in previous years, we will be running three preparation sessions to help you keep your math skills sharp and get you ready for the competition. The first preparation session will take place on Saturday, December 14th from 10am-12pm in Earth...

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

Students of grades 5 to 7 are invited to challenge and develop their thinking and creativity skills at the Math Circle Workshops. This is an enrichment program for students organized by the faculty members of the Department of Mathematics at the...

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

For a finite connected graph, the following objects have the same cardinality: the set of spanning trees, the Jacobian group, the set of equivalence classes of orientations up to cycle-cocycle reversal, the set of break divisors, the set of reduced...