Past Events

Matroids are combinatorial objects that abstract the notion of independence. Given any matroid, Feichtner and Yuzvinsky defined a graded commutative ring called the Chow ring, inspired by algebraic geometry. To each matroid, we can define a linear...

We establish the fourth moments of the real and imaginary parts of the Riemann zeta-function, as well as the fourth power mean value of Hardy's Z-function at the Gram points. We also study two weak versions of Gram's law. We show that those weak Gram...

Matroids are combinatorial objects that abstract the notion of independence. The motivating examples are matroids arising from vector configurations. An important tool for studying matroids is the associated Chow ring. A recent result of Adiprasito...

We study a simple SIS epidemic model accounting for human behaviour. Individuals can decide at each instant of time whether or not they adopt prophylactic (hereafter protection) measures such as mask wearing or social distancing. These measures...

Anosov flows are a standard model for strongly chaotic behavior in dynamical systems. A classical example is the geodesic flow on a compact negatively curved Riemannian manifold. The chaotic behavior of an Anosov flow manifests in decay of...

Szemerédi's regularity lemma and its variants are some of the most powerful tools in combinatorics. For example, Szemerédi used an early version in the proof of his celebrated theorem on long arithmetic progressions in dense sets of integers. It has...

A well-known conjecture in physical literature states that high frequency waves propagating over long distances through turbulence eventually become complex Gaussian distributed. The intensity of such wave fields then follows an exponential law...

For a number field K, the P\'olya group of K, denoted by Po(K), is the subgroup of the ideal class group of K generated by the classes of the products of maximal ideals of K with the same norm. In this talk, after reviewing some results concerning Po...

The practical performance of an optimization method depends on details such as using good step sizes. Strategies for setting step sizes are generally limited to hyperparameter tuning (for a fixed step size), step size schedules and line searches. For...

Finding and enumerating Boolean intervals in $W(\mathfrak{S}_n)$, the weak order of symmetric group $\mathfrak{S}_n$, can feel like trying to find needles in a haystack. However, through surprising connection to the outcome map of parking functions...