# Vorträge 2022

### Max von Kleist (FU-Berlin Antrittsvorlesung): Mathematics for public health

Public health is concerned with measures that improve the general health and prevent infections. In my talk, I will give an overview and outlook of our current work and explain how data science in conjunction with mathematical modeling and simulation can be utilized to guide public health decisions. In particular, I will present approaches that utilize primary and secondary data of SARS-CoV-2 to permanently monitor and assess the pandemic. Moreover, I will give examples where these approaches supported the choice of containment and testing strategies in 2020/21. I will then give some insight into our ongoing work in the field of HIV-1 prevention, the mathematical methods developed along the way, and illustrate how this work is used to quantify risk reduction, to develop guidelines, as well as to a posteriori assess the impact of interventions on the HIV pandemic.

Ort: Seminarraum 019 Arnimallee 3 14195 Berlin

### Marita Thomas (FU-Berlin Antrittsvorlesung): Modeling and Analysis of Bulk-Interface Processes

Heterogeneous materials can be seen as bulk-interface systems. They consist of distinct bulk components with different material properties meeting at thin interfacial layers forming lower-dimensional substructures of the system. In many applications the properties of interfaces strongly impact the functionality of the whole system and, in turn, interfaces are strongly affected by processes taking place in the bulk material. Interfaces thus follow their own evolution laws in interaction with bulk processes. In this talk I discuss a general thermodynamical modeling framework for bulk-interface processes and, in particular, apply it to problems related to heat conduction and fracture in elastic composites. Here, a challenge in the modeling and in the analysis lies in the change of the material geometry with the progressing fracture and in the constraint that in many materials crack growth is a unidirectional process, since the crack cannot heal. Models suited to handle these challenges and thus suited to describe dynamic fracture processes in elastic solids with the aid of non-smooth constraints will be introduced. Recent results on their mathematical analysis will be presented.

Ort: Seminarraum 019 Arnimallee 3 14195 Berlin

### Claudia Schillings (FU-Berlin Antrittsvorlesung): Quantification of uncertainty for inverse and optimization problems

Approaches to decision making and learning mainly rely on optimization techniques to achieve “best” values for parameters and decision variables. In most practical settings, however, the optimization takes place in the presence of uncertainty about model correctness, data relevance, and numerous other factors that influence the resulting solutions. For complex processes modeled by nonlinear ordinary and partial differential equations, the incorporation of these uncertainties typically results in high or even infinite dimensional problems in terms of the uncertain parameters as well as the optimization variables. We will discuss methods which can be shown to be robust with respect to the number of parameters and are therefore suitable for this setting.

Ort: Seminarraum 019 Arnimallee 3 14195 Berlin

### Milena Hering (Edingburgh): Embedding of Algebraic Varieties and Toric Vector bundles

Algebraic varieties are geometric objects that can be described as the zero locus of polynomial equations. While the relationship between geometry and algebra is fundamental to algebraic geometry, it still remains quite mysterious. I will explain some aspects that are known about it, as well as some open questions. And how toric vector bundles enter the equation.

Ort: Seminarraum 019 Arnimallee 3 14195 Berlin

### Arend Bayer (Edingburgh): Derived Categories, Wall-crossing and Birational Geometry

Birational geometry studies maps between algebraic varieties defined by rational functions. Recently, derived categories, stability conditions and wall-crossing have led to an entirely new approach to fundamental open questions in birational geometry. I will survey these developments, with an emphasis on Hyperkaehler varieties and cubic fourfolds.

Ort: Seminarraum 019 Arnimallee 3 14195 Berlin

### Ana Djurdjevac (FU-Berlin Antrittsvorlesung): Randomness and PDEs: Analysis, Numerics and Applications

We will first consider interacting particle systems that provide powerful models that are useful in many application areas such as sociology (agents), molecular dynamics (proteins) etc. The first model that we will define is a non-linear stochastic PDE that provides a faithful representation of the evolution of the empirical density of a given particle system. This model has a direct applications in the opinion dynamics that will be discussed. Furthermore, we will explain difficulties in numerical approximations of these problems. Instead of considering many particles, next we will consider just one Brownian particle, but which is now evolving on a random domain. Using the rough path analysis, we will investigate different scaling regimes of this system. As a natural question in this setting is how to present a Gaussian random fields on a sphere. One way to do this is using the so-called spherical harmonics. We will discuss the advantages of this approach and challenges in its generalizations to an arbitrary manifold.

Ort: Seminarraum 019 Arnimallee 3 14195 Berlin

### Imre Bárány (Rényi Institute, Budapest): Cells in the box and a hyperplane

It is well known that a line can intersect at most 2 n −1 cells of the n × n chessboard. What happens in higher dimensions: how many cells of the d -dimensional [0, n ]^ d box can a hyperplane intersect? We answer this question asymptotically. We also prove the integer analogue of the following fact. If K,L are convex bodies in R ^d and K ⊂ L , then the surface area K is smaller than that of L . This is joint work with Péter Frankl.

Ort: Chemistry building Arnimallee 22 14195 Berlin Hörsaal A

### János Pach (Rényi Institute, Budapest): Facets of Simplicity

We discuss some notoriously hard combinatorial problems for large classes of graphs and hypergraphs arising in geometric, algebraic, and practical applications. These structures are of bounded complexity: they can be embedded in a bounded-dimensional space, or have small VC-dimension, or a short algebraic description. What are the advantages of low complexity? I will suggest a few possible answers to this question, and illustrate them with classical examples.

Ort: Chemistry building Arnimallee 22 14195 Berlin Hörsaal A