Past Events

The Simplex method for solving linear programs (LPs) is one of the most widely used LP solvers due to the fact that it runs very quickly in practice. However, despite its practical efficiency and decades of study, it remains unknown whether or not it...

We will give an exposition on the recent progress in the study of unimodal sequences, beginning with the work of Isaac Newton and then to the contemporary papers of June Huh. We will also relate this topic to the Riemann hypothesis. In the process...

Let K be a convex body made of material of uniform density less than 1 submerged into water of density 1. How to find the directions of equilibrium of $K$? How many directions of equilibrium does a triangular prism have? (A direction n orthogonal to...

Following a vaccine inoculation or disease exposure an immune response develops in time, where the description of its time evolution poses an interesting problem in dynamical systems. The principal goal of theoretical immunology is to construct...

In this talk, we will share a comparison of how well different search engines find relevant articles, focusing on nautical crimes. The project involved collecting and cleaning data, looking at how many articles each engine retrieved, when those...

In this talk we study interacting fermions on a discrete finite lattice subject to a homogeneous magnetic field at positive temperature. One prime example of such systems is the Hofstadter-Hubbard model. We show that the magnetization is equal to the...

Let Mat n × n ( C ) be the affine space of n × n complex matrices with coordinate ring C [ x n × n ] . We define graded quotients of C [ x n × n ] where each quotient ring carries a group action. These quotient rings are obtained by applying the...

Recently, Sherry et al. (2024) reconsidered the pioneering work of Dahlquist and Jeltsch (1979) on circle-contractivity for the study of neural networks. This theory can be used to analyse and improve the robustness of architectures that are devised...

For many optimization problems, we lack time-efficient algorithms; in many cases this is true even for "average-case" inputs from simple data models. To what extent can tools for complexity theory be adapted to this average-case setting? In this talk...

TBA