Past Events

Deuring-Heilbronnn phenomenon, quantitatively established by Linnik in 1944, describes how the existence of a Landau-Siegel zero, which is real and near s=1, affects the location of the rest of the zeros of the Dirichlet L-functions to the same...

$L_\infty$ algebras, i.e. Lie algebras up to homotopy coherent homotopy, appear in a variety of contexts, including string theory and deformation theory. Over the last several decades, the outlines of a Lie theory for such objects has appeared in...

In function approximation, it is standard to assume the availability of an orthonormal basis for computations, ensuring that numerical errors are negligible. However, this assumption is often unmet in practice. For instance, multivariate...

While the etale cohomology of Z/p-local systems on smooth p-adic rigid spaces is in general hard to control, it becomes more tractable when the spaces are proper. For example, in the proper case it is finite-dimensional and has recently been shown in...

A bijection f of a metric space is "distance-permuting" if the distance from f(x) to f(y) depends only on the distance from x to y. For example, it it is known that every distance-permuting bijection of the real line is the composition of an isometry...

Although biologists discover and classify thousands of new species each year, an estimated 95% of the more than 20 million multicellular species on Earth remain unnamed and unclassified. Our research aligns with the long-term goals of the Planetary...

Twenty-first century mathematics has seen the rise of the proof assistant, and mathematical practice has changed significantly with the rise of these new tools. One consequence of this change, for the philosopher of mathematics, is the wider adoption...

The discrete Schrödinger equation on a two-dimensional honeycomb lattice is a fundamental tight-binding approximation model that describes the propagation of electrons on graphene. By the Fourier transform on the honeycomb lattice, the free...

Primal-dual hybrid gradient (PDHG) is a first-order method for saddle-point problems and convex programming introduced by Chambolle and Pock. Recently, Applegate et al. analyzed the behavior of PDHG when applied to an infeasible or unbounded instance...

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