Search by speaker

Filter institution








Filter content






Wed, 22. Apr at 10:00
Weierstrass-Insti...
Regularity of the score and convergence rates of generative diffusion models
Abstract. We show that diffusion-based generative models adapt to the smoothness of the target distribution: the score function inherits the target’s regularity. Leveraging this adaptivity, we obtain a concise proof that diffusion models achieve minimax-optimal rates for density estimation
Wed, 22. Apr at 13:15
Room: 3.007 John ...
Picard bundles and degree of irrationality of jacobians
Abstract. The degree of irrationality of a projective variety is the smallest degree of a dominant rational map to projective space of the same dimension. I explain a vector-bundle approach via kernel bundles, implying that a globally generated bundle with positive top Chern class gives an immediate upper bound. I then study twists of Picard bundles and obtain that the degree of irrationality of any genus \(g\) Jacobian is at most \(2^g\). This is based on joint work with Andrés Rojas.
Wed, 22. Apr at 16:15
A3, SR024
Chromatic thresholds for linear equations and recurrence
Abstract. Motivated by classical problems in extremal graph theory, we study a chromatic analogue of Roth-type questions for linear equations over \(\mathbb F_p\). Given a homogeneous equation \(\mathcal L:\sum_{i=1}^k c_i x_i=0\) with \(k\ge 3\), we study \(\mathcal L\)-solution-free sets \(A\subseteq \mathbb F_p\) through the chromatic number of the Cayley graph \(\mathsf{Cay}(\mathbb F_p,A)\). We introduce the \emph{chromatic threshold} \(\delta_\chi(\mathcal L)\), the minimum density that guarantees bounded chromatic number of \(\mathsf{Cay}(\mathbb F_p,A)\) among all \(\mathcal L\)-solution-free sets \(A\), and determine exactly when \(\delta_\chi(\mathcal L)=0\). Strikingly, this happens if and only if \(\mathcal L\) contains a zero-sum subcollection of at least three coefficients.<br><br><br>A key ingredient is a quantitative chromatic lower bound for Cayley graphs on \(\mathbb Z_p^n\) generated by Hamming balls around the all-ones vector. This is achieved by introducing a new Kneser-type graph that admits a natural embedding into \(\mathbb Z_p^n\), together with an equivariant Borsuk--Ulam type argument. As a consequence, we resolve a question of Griesmer. We also relate our classification to the hierarchy of measurable, topological, and Bohr recurrence.
Thu, 23. Apr at 12:00
MA 875
From Erdős’s Triangle Question to Clique Cover Problems
Abstract. This talk is about connected graphs in which every edge lies in one or more copies of a clique, with a focus on extremal and algorithmic questions. Motivated by Erdős’s question on connected graphs where every edge belongs to a triangle, we survey our recent results on the minimum number of edges in such graphs, characterize extremal constructions. We then turn to completion problems, where the goal is to add as few non-edges as possible so that every edge is covered by a clique, highlighting hardness results, exact algorithms for trees and chordal graphs, and approximation results for broader classes.
Fri, 24. Apr
How to measure quantum fields? Implementing a causal measurement scheme
Abstract. While measurement processes in standard quantum mechanics are well understood, the extension of these ideas to quantum field theory (QFT) remains a key challenge. In particular, ensuring that measurements respect fundamental principles such as relativistic causality is crucial. A persistent issue concerning measurements in QFT is, though, that the usual axioms for QFT alone are insufficient to prevent superluminal signaling. In this talk, I will discuss a recent proposal by Fewster and Verch for a local, covariant and causal measurement framework in algebraic QFT. In particular, I will discuss completeness of the framework and motivate its underlying assumptions focussing on the concrete setting of a free scalar field and Gaussian measurements. We conclude that the Fewster-Verch approach is suitable to model typical measurements in QFT. The talk is based on joint work with Miguel Navascués (Lett Math Phys 115, 115 (2025), https://doi.org/10.1007/s11005-025-02001-3).
Mon, 27. Apr at 10:00
SR 115, Arnimallee 3
Discrete Anderson Hamiltonians with correlated Gaussian potentials
Tue, 28. Apr at 11:15
1.023 (BMS Room, ...
Analysis of the mathematical content of recently discovered letters from Dedekind to Cantor
Abstract. The correspondence between Georg Cantor and Richard Dedekind plays a pivotal role in the understanding of the emergence of set theory. It is in this exchange that the foundational concepts and key results have been developed. Until recently, only Cantor's letters in Dedekind's Nachlass were available for research. However, in the past months Dedekind's side of the correspondence has been discovered. In this seminar the main mathematical results of Dedekind's letters will be analyzed. Particular attention will be paid to the letters from November 30 and December 26, both 1873. This analysis will then open the room for a discussion concerning the authorship of Cantor's seminal 1874 paper that kicked off set theory, as the letters reveal that a part of the paper were, in fact, results obtained by Dedekind.
Tue, 28. Apr at 14:30
TU Berlin, MA Bui...
Wed, 29. Apr
Wed, 29. Apr at 10:00
Weierstrass-Insti...
Extremes of Structural Causal Models
Abstract. The behaviour of extreme observations is well-understood for time series or spatial data, but little is known if the data generating process is a structural causal model (SCM). We study the behavior of extremes in this model class, both for the observational distribution and under extremal interventions. We show that under suitable regularity conditions on the structure functions, the extremal behavior is described by a multivariate Pareto distribution, which can be represented as a new SCM on an extremal graph. Importantly, the latter is a sub-graph of the graph in the original SCM, which means that causal links can disappear in the tails. We further introduce a directed version of extremal graphical models and show that an extremal SCM satisfies the corresponding Markov properties. Based on a new test of extremal conditional independence, we propose two algorithms for learning the extremal causal structure from data. The first is an extremal version of the PC-algorithm, and the second is a pruning algorithm that removes edges from the original graph to consistently recover the extremal graph. The methods are illustrated on river data with known causal ground truth.
Wed, 29. Apr at 10:30
ZIB, Room 0001 (S...
Towards AI That Is Smart, Sparse, and Social
Abstract. Deep learning continues to achieve impressive breakthroughs across disciplines but relies on increasingly large neural network models that are trained on massive data sets. Their development inflicts costs that are only affordable by a few labs and prevent global participation in the creation of related technologies. But does it really have to be like this? We will identify some of the major challenges of deep learning at small scales and present solution strategies pertaining to the design of sparse training algorithms and problem specific neural network design in the context of agentic networks, which hold the promise to overcome a fundamental trade-off between model specialization and trainability.
Wed, 29. Apr at 11:30
Weierstrass Lectu...
Non-Standard Fluctuations of the edge density in the edge-triangle Model
Abstract. Exponential Random Graph Models extend the classical (dense) Erdős–Rényi random graph by incorporating higher-order structural features through a Hamiltonian formalism inspired by statistical mechanics. Among these, the edge-triangle model is a basic but non trivial example, where the competition between edge and triangle terms leads to a rich phase structure. In this talk we will give an overview of known limit theorems and concentration results for subgraph densities, with particular emphasis on an open problem: a non-standard CLT for the edge density. The conjecture will be supported by a mean-field analysis, which allows for explicit computations and suggests a different fluctuation scaling, while also providing some insight into related open questions. This talk is based on joint works with A. Bianchi, F. Collet, and G. Passuello.
Wed, 29. Apr at 13:00
ZIB, Room 4027 (R...
Do third derivatives accelerate unconstrained continuous optimization?
Abstract. Methods for unconstrained continuous optimization can be classified by the strength of the oracle for the objective function they require. First-order methods only require access to function values and gradients, second-order methods additionally require access to Hessians. Higher-order methods correspondingly require access to derivatives of order 1 to p for some p ≥ 3 and are called tensors methods. Intuitively, access to additional derivative information should speed up convergence to an approximate minimizer. We will cover the different perspectives from which this becomes true. First, convergence speed can be quantified from the perspective of global iteration complexity, for which the literature asserts that methods minimizing a regularized Taylor expansions, and in particular the adaptive ARp method, are optimal. Second, we will discuss local convergence results, showing how ARp can converge superlinearly even if the Hessian is singular at the minimizer. Third, numerical experiments on a range of test functions show that (after introducing certain heuristics) the third-order AR3 method needs fewer iterations and oracle calls than the second-order AR2 method.
Wed, 29. Apr at 13:15
Room: 3.007 John ...
Wed, 29. Apr at 14:15
WIAS, Erhard-Schm...
Time-asymptotic self-similarity of the damped Euler equations in parabolic scaling variables
Abstract
Wed, 29. Apr at 15:15
Rudower Chaussee ...
Decoding (or not!) geometry from spectra
Abstract
Wed, 29. Apr at 16:15
A3, SR024
Substructures in random Latin squares
Abstract. In this talk, we will discuss the probability of substructures occurring in random Latin squares. A consequence of our main result is that for a partial Latin square \(P\) of order \(n\) with \(o(n)\) non-empty rows and columns (as \(n \to \infty\)) and \(k\) total non-empty cells and a random Latin square \(\mathbf{L}\) of order \(n\), the probability that \(\mathbf{L}\) contains \(P\) lies between \(((1/22-o(1))/n)^k\) and \(((22+o(1))/n)^k\). We apply this result to subsquares in random Latin squares to obtain the first proof of the fact that the expected number of subsquares of order \(3\) in a random Latin square of order \(n\) is non-vanishing as \(n \to \infty\). We are also able to provide the best known asymptotics for the expected number of subsquares of any order \(m\) in a random Latin square of order \(n\) for any \(m\) satisfying \(4 \leq m \leq \alpha n\) with \(\alpha < 1/3\).
Wed, 29. Apr at 16:30
EN 058
Mon, 04. May at 10:00
SR 115, Arnimallee 3
Stochastic control for singular diffusions: viscosity solutions & BSDEs
Tue, 05. May at 11:15
1.023 (BMS Room, ...
Operadic structure of spatial Markov processes
Abstract. The study of Markov chains intertwins probability theory and classical linear algebra, as a consequence of the 1D Markov property. When considering two-dimensional models of statistical mechanics, a spontaneous reflex is often to split the 2D geometry into a 1+1 geometry through the transfer matrix and reuse 1D result. In the present talk, we will consider the 2D Markov property of such models on its own and see how it invites to replace classical linear algebra by a more general operadic structure. In particular, we will focus on how new practical computations and equations emerge from this new formalism. We illustrate them on discrete-lattice Gaussian models.
Tue, 05. May at 14:00
Weierstrass Insti...
A machine learning based approximation of semi-concave functions with applications to optimal control
Abstract. Semiconcave functions are of vital importance for many variational problems, including optimal feedback control, game theory, and optimal transport. To investigate this class of functions we leverage the fact that semiconcave functions can be represented as the infimum of a countable family of C^2 functions. This infimum is expressed in a form that allows approximation by finitely many functions, which, combined with smoothing operations, remains semiconcave. Moreover, the gradients of the elements in the expansion of the approximating functions form a probability distribution, a property of particular interest for the value function in optimal control. We conclude by proposing a benchmark problem for a nonlinear optimal control problem, depending on a parameter which allows to vary the value function between being C^1 regular and semiconcave. This is joint work with D. Vasquez-Varas, Univ. Santiago, Chile
Wed, 06. May at 10:00
Weierstrass-Insti...
Estimation of a smooth functional for inverse problems
Abstract. Since the seminal paper by Ibragimov and Khasmisnkii (1980) it is well known that the plug-in approach is sub-optimal in estimating a nonlinear functional like the squared norm of the signal. A kind of bias correction is necessary to achieve root-n optimality. Series of recent papers by Koltchinskii with coauthors revisited this problem from modern prospective with a high or even dimensional parameter space and a complex structure of the functional to be estimated. This talk discusses the problem of estimation of a smooth functional in the inverse problem setup given by an objective function L(θ). A different view is offered. Namely, the functional φ(θ) is included in the parameter list as the target value, while the parameter θ is treated as a nuisance parameter. The structural relation x = φ(θ) is replaced by the structural penalty (λ|x − φ(θ))2. The resulting estimator is obtained as a third-order correction (xˆ, θˆ) of the full-dimensional penalized MLE (x̃, θ̃) = arg inf(x,θ) L(θ) + λ|x − φ(θ)|2/2. The approach enables us to obtain an accurate expansion with an explicit leading term and self-consistent remainder and provides sharp risk bounds for this estimator. In particular, we present sufficient conditions for root-n consistency of the procedure.
Wed, 06. May at 16:00
Wed, 06. May at 18:00
FU Berlin, Instit...
Die Unendlichkeit berechnen — von Euler zu Feynman
Abstract. Wie lassen sich unendliche Größen sinnvoll behandeln? Bereits Euler und Riemann beschäftigten sich mit divergenten Objekten wie den Reihen 1 + 2 + 3 + … und 1 + 1/2 + 1/3 + …, wobei letztere in engem Zusammenhang mit dem divergenten Integral über 1/x steht. In welchem Sinne können solchen divergenten Ausdrücken dennoch wohldefinierte Werte zugeordnet werden?<br>Ausgehend von divergenten Reihen und Integralen in einer Veränderlichen, die durch geeignete Regularisierungsverfahren analysiert werden können, wird anschließend der Übergang zu divergenten Reihen und Integralen in mehreren Veränderlichen untersucht. Dies führt zu Multizetafunktionen in der Zahlentheorie sowie zu Feynman-Integralen in der Quantenfeldtheorie. Im Zentrum stehen dabei Renormierungstechniken, die es ermöglichen, mit einer Anhäufung von Divergenzen konsistent zu arbeiten.<br>Dies führt zu einer grundlegenden Frage, ob diese Verfahren lediglich technische Werkzeuge zur Kontrolle von Divergenzen darstellen oder ob sie auf ein tieferliegendes strukturelles Prinzip mathematischer und physikalischer Theorien hinweisen.
Thu, 07. May at 16:30
TU Berlin, MA 043
Quantification of limit theorem for Hawkes processes
Abstract. Hawkes processes are a popular model for self-exciting phenomena, from<br>earthquakes to finance. In this talk, I will first present them in a simple way, using a<br>Poisson imbedding construction. I will then review what is known about their long-time<br>behavior, through limit theorems for both linear and non-linear cases.<br>The focus will be on three regimes that appear when the process has a long memory and<br>the branching ratio gets close to or above one: the Nearly Unstable, the Weakly Critical,<br>and the Supercritical Nearly Unstable Hawkes processes. These regimes have been<br>studied qualitatively, but quantitative convergence results have been missing. I will<br>explain how we obtain explicit convergence rates, relying on a coupling with a Brownian<br>sheet, Fourier analysis, and a careful approximation of the absolute value function.
Thu, 07. May at 17:30
TU Berlin, MA 043
Fri, 08. May at 14:15
TU (MA001)
A tale of three unknotting conjectures
Abstract
Mon, 11. May at 10:00
SR 115, Arnimallee 3
Semimartingales forced onto a manifold by a large drift
Tue, 12. May at 11:15
1.023 (BMS Room, ...
The off-shell one and two-loop box recovered from intersection theory
Abstract. We advertise intersection theory for generalised hypergeometric functions as a means of evaluating Mellin-Barnes representations. As an example, we study two-parameter representations of the off-shell one- and two-loop box graphs in exactly four-dimensional configuration space. Closing the integration contours for the MB parameters we transform these into double sums. Polygamma functions in the MB representation of the double box and the occurrence of higher poles are taken into account by parametric differentiation. Summing over any one of the counters results into a p+1Fp that we replace by its Euler integral representation. The process can be repeated a second time and results in a two- or four-parameter Euler integral, respectively. We use intersection theory to derive Pfaffian systems of equations on related sets of master integrals and solve for the box and double box integrals reproducing the known expressions. Finally, we use a trick to re-derive the double box from a two-parameter Euler integral. This second computation requires only very little computing resources.
Wed, 13. May at 10:00
Weierstrass-Insti...
Multiple change point detection in functional data with applications to biomechanical fatigue data
Abstract. Injuries to the lower extremity joints are often debilitating, particularly for professional athletes. Understanding the onset of stressful conditions on these joints is therefore important in order to ensure prevention of injuries as well as individualised training for enhanced athletic performance. We study the biomechanical joint angles from the hip, knee and ankle for runners who are experiencing fatigue. The data is cyclic in nature and densely collected by body worn sensors, which makes it ideal to work with in the functional data analysis (FDA) framework. We develop a new method for multiple change point detection for functional data, which improves the state of the art with respect to at least two novel aspects. First, the curves are compared with respect to their maximum absolute deviation, which leads to a better interpretation of local changes in the functional data compared to classical L^2-approaches. Secondly, as slight aberrations are to be often expected in a human movement data, our method will not detect arbitrarily small changes but hunts for relevant changes, where maximum absolute deviation between the curves exceeds a specified threshold, say Δ > 0. We recover multiple changes in a long functional time series of biomechanical knee angle data, which are larger than the desired threshold Δ, allowing us to identify changes purely due to fatigue. In this work, we analyse data from both controlled indoor as well as from an uncontrolled outdoor (marathon) setting.
Wed, 13. May at 11:30
Weierstrass Lectu...
Two phase transitions for catalytic branching Markov chains
Abstract. Consider a continuous-time branching Markov chain (Z_t, t ≥ 0) on a locally finite graph G rooted at o. Each particle moves according to an irreducible Markov process ξ and branches at a rate that depends on their location: the branching rate is λ_0 ≥ 0 at the root and λ ≥ 0 elsewhere. The offspring distribution is supercritical with mean m > 1, has no extinction and finite second moment. We characterize the recurrence/transience phase transition for this catalytic branching Markov chain. Furthermore, under suitable assumptions we prove a second phase transition concerning the asymptotic behaviour of the relative empirical density, (Z_t(G))^{-1} Z_t, where Z_t is the empirical measure of the particles and Z_t(G) is the total population size. If (m−1)(λ_0−λ) > γ_esc, where γ_esc is the escape probability that ξ never returns to the root, then (Z_t(G))^{-1} Z_t converges almost surely to a deterministic probability measure. If (m−1)(λ_0−λ) ∈ (0, γ_esc], then (Z_t(G))^{-1} Z_t converges almost surely to zero. When the graph is the integer lattice G = ℤ^d and ξ is the simple random walk, our results confirm several conjectures of Mailler and Schapira [Ann. Appl. Probab. 2026], which studied this model via a different approach. Based on a joint work in progress with Xinxin Chen (Beijing Normal University), Nina Gantert (Technical University of Munich) and Haojie Hou (Beijing Institute of Technology).
Wed, 13. May at 14:15
WIAS, Erhard-Schm...
Fri, 15. May
Fri, 15. May
Mon, 18. May at 16:15
A3, SR120
Pentagons in triple systems
Abstract. We consider the question of determining the number of pentagons in a linear triple system and show some connections to number theory, graph theory, theoretical computer science, and geometry. This is joint work with Jozsef Solymosi.
Wed, 20. May
Wed, 20. May at 10:00
Weierstrass-Insti...
Wed, 20. May at 11:30
Weierstrass Lectu...
Wed, 20. May at 14:15
WIAS, Erhard-Schm...
Wed, 20. May at 16:00
Wed, 20. May at 16:00
Wed, 20. May at 16:30
EN 058
Thu, 21. May at 16:30
TU Berlin, MA 043
Thu, 21. May at 17:30
TU Berlin, MA 043
Fri, 22. May at 14:00
Auditorium Maximu...
Representing Number Theoretic Symmetries with Linear Algebra
Abstract. A common theme studied in number theory are congruences between integers modulo prime numbers or modulo powers of prime numbers. A way to encode all those congruences at once is provided by a field that is called the field of p-adic numbers. Out of this field one can build interesting groups, called p-adic groups, which are number theoretic analogues of Lie groups, have a similar rich structure, and play a central role in the Langlands program, for example. A key question that mathematicians ask is how one can represent these complicated-looking p-adic groups using more common complex matrix groups, in other words, using more traditional linear algebra. In this talk, I will introduce p-adic numbers and p-adic groups and then provide an overview of what we know about the representations of these groups including recent developments. This means I will explain how close we are to answering the key question above. I might also sketch applications to other questions in mathematics.
Fri, 22. May at 14:00
Auditorium Maximu...
Numbers, Quantum Computers, and the Question of Responsibility
Abstract. The lecture traces an arc from the history of a seemingly harmless mathematical problem to highly relevant societal questions. The starting point is the factoring problem. Through early mechanical calculating aids and the first successes of electronic computers, it shows how long and persistently this problem has accompanied mathematics—and why it ultimately became a foundation of modern cryptography. These mathematical ideas are no longer abstract today. They secure the internet, our communications, and our privacy. At the same time, we are witnessing that digital platforms and social networks pose significant risks to the mental health of children and adolescents. This gives rise to a societal responsibility: age limits must be enforceable without resorting to pervasive surveillance or large-scale data collection. The lecture shows that cryptographic methods can solve precisely this problem. Finally, the perspective turns to the future: quantum computers threaten the cryptographic procedures in use today. The lecture explains which attacks are realistic, that post-quantum methods are available as alternatives—and why it is a matter of responsibility to manage this transition in good time.
Fri, 22. May at 14:15
U Potsdam
Representing Number Theoretic Symmetries with Linear Algebra
Abstract
Tue, 26. May at 11:15
1.023 (BMS Room, ...
Wed, 27. May at 10:00
Weierstrass-Insti...
Wed, 27. May at 10:00
Weierstrass-Insti...
Wed, 27. May at 11:30
Weierstrass Lectu...
Wed, 27. May at 14:15
WIAS, Erhard-Schm...
Fri, 29. May at 14:15
Langenbeck-Vircho...
Kovalevskaya Colloquium
Fri, 29. May at 14:30
Hamburg
Abstract
Fri, 29. May at 16:00
Hamburg
Abstract
Tue, 02. Jun at 11:15
1.023 (BMS Room, ...
Limit shapes and harmonic tricks
Abstract. The talk will be on the tangent plane method — a novel method for analysys of limit shapes of the dimer model. It will consist of three parts. In the first part, we will briefly introduce the dimer model and the necessary concepts including the associated variational problem. The second part will focus on the underlying geometry using harmonic parametrization. In the third part, we will consider two specific examples of limit shape parametrized by a modular parameter: the Aztec diamond with a hole, and a hexagon with a hexagonal hole. The talk is based on arXiv/2603.21255
Wed, 03. Jun at 16:00
Thu, 04. Jun at 16:30
TU Berlin, MA 043
Thu, 04. Jun at 17:30
TU Berlin, MA 043
Tue, 09. Jun at 11:15
1.023 (BMS Room, ...
Wed, 10. Jun at 10:00
Weierstrass-Insti...
Tue, 16. Jun at 11:15
1.023 (BMS Room, ...
Wed, 17. Jun at 10:00
Weierstrass-Insti...
Wed, 17. Jun at 16:00
Tue, 23. Jun at 11:15
1.023 (BMS Room, ...
Wed, 24. Jun at 10:00
Weierstrass-Insti...
Fri, 26. Jun at 14:15
TU (MA001)
Wed, 01. Jul at 16:00
Wed, 01. Jul at 16:30
EN 058
Tue, 07. Jul at 11:15
1.023 (BMS Room, ...
Wed, 08. Jul at 10:00
HVP 11 a, R.313
Wed, 08. Jul at 16:30
EN 058
Fri, 10. Jul at 14:15
FU (T9)
Tue, 14. Jul at 11:15
1.023 (BMS Room, ...
Tue, 14. Jul at 14:15
WIAS, Erhard-Schm...
Tue, 14. Jul at 14:15
WIAS, Erhard-Schm...
Wed, 15. Jul at 14:15
WIAS, Erhard-Schm...
Wed, 15. Jul at 16:00
Thu, 16. Jul at 16:30
TU Berlin, MA 043
Thu, 16. Jul at 17:30
TU Berlin, MA 043
Wed, 29. Jul at 14:15
WIAS, Erhard-Schm...
Thu, 17. Dec at 16:30
EN 058
Drawing algebraic curves in OSCAR
Abstract. I will talk about how to visualize real plane algebraic curves given as the zero set of a polynomial in two variables using Oscar.jl. I will highlight performance and exactness issues using real world examples.