Past Events

This alternative math education event will present fun activities to explore math and computer science concepts to children (and adults!) using games and art! Lots of hands-on activities including: Sorting network An impossible balancing act...

We present generalizations and modifications of Eldan's Stochastic Localization process, extending it to incorporate non-Gaussian tilts, making it useful for a broader class of measures. As an application, we introduce new processes that enable the...

Talk titles and abstracts: Natasha Crepeau: Constructing stability conditions from triangulations of Lawrence polytopes Abstract: A stability condition of a graph G is a collection of generalized break divisors of size | ST ( G ) | . In this talk, we...

TBA

The totally positive flag variety of rank r, defined by Lusztig, can be described as the set of rank r flags of real linear subspaces which can be represented by a matrix whose minors are all positive. We show that, for flag varieties of consecutive...

I will start with a survey on sums of random multiplicative functions, focusing on distributional questions and almost sure upper bounds and $\Omega$-results. In this context, I will describe previous work with Jake Chinis on a central limit theorem...

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

The mixing time and spectral gap of a random walk on the symmetric group can sometimes be understood in terms of its low dimensional representations (e.g., Aldous' spectral gap conjecture). It turns out that under a mild degree condition involving...

The rational points of a hyperbolic curve over a number field map to the set of augmentations of the associated motivic algebra. An expectation, closely related to the Grothendieck section conjecture, is that the set of augmentations which are...

We introduce an inexact trust-region method for efficiently solving a class of problems in which the objective is the sum of a smooth, nonconvex function and nonsmooth, convex function. Such objectives are pervasive in the literature, with examples...