Past Events

We will talk about Drinfeld modules, and how they compare to elliptic curves for algorithms and computations. Drinfeld modules can be seen as function field analogues of elliptic curves. They were introduced in the 1970's by Vladimir Drinfeld, to...

The peaceable queens problem asks to determine the maximum number $a(n)$ such that there is a placement of $a(n)$ white queens and $a(n)$ black queens on an $n \times n$ chessboard so that no queen can capture any queen of the opposite color. We...

Wiles’ famous proof of Fermat’s Last Theorem pioneered the so-called modular method, in which modularity of elliptic curves is used to show that all integer solutions of Fermat’s equation are trivial. In this talk, we briefly sketch a variant of the...

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

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

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