Past Events

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

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

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

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

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