Search by speaker

Filter institution








Filter content






Tue, 21. Jan at 11:15
1.023 (BMS Room, ...
Isomonodromic deformations, quantization and exact WKB
Abstract. In this talk, I will review the theory of isomonodromic deformations of meromorphic connections on gl2 and the underlying symplectic structure. In particular, I will explain how to obtain explicit formulas for the Hamiltonian systems and the Lax pairs. Next, I will explain how one can formally reconstruct these results using the quantization of the classical spectral curve using topological recursion. Finally, I will explain the current challenges and results to upgrade this formal reconstruction to an analytic one focusing on the genus zero case where one can use Borel resummation of WKB solutions. The talk is supposed not to require any knowledge in integrable systems, topological recursion of Borel resummation.
Tue, 21. Jan at 13:15
Room 3.006, Rudow...
Regular Galois Realizations of Groups of Lie Type
Abstract. We survey the inverse Galois problem and state some new and old result on Galois realizations of groups of Lie type over the rational function field. Most of these can be obtained by a suitable combination of tensor products, convolutions on the affine line, and l-adic Fourier transformations.
Wed, 22. Jan at 10:00
HVP 11 a, R.313
PCA for point processes
Wed, 22. Jan at 13:00
ZIB, Room 2006 (S...
Inference of Differential Privacy properties of julia code
Abstract. Differential privacy is a concept that can be used to express the extent to which algorithms like database queries, statistics and machine learning procedures, preserve a certain notion of privacy of an input dataset. Prominent applications of the technique include the US census and user data aggregation procedures of multiple large tech companies. The correct implementation of such algorithms requires a substantial amount of care, which motivated the development of type systems tailored to verify the differential privacy properties of programs. We implemented a type checker for one such type system and integrated it with the julia programming language to enable not only verification but automatic inference of privacy parameters for a reasonable subset of julia code.
Wed, 22. Jan at 14:00
WIAS, Erhard-Schm...
Gradient flows on metric graphs with reservoirs
Abstract
Wed, 22. Jan at 15:30
WIAS, Erhard-Schm...
Wed, 22. Jan at 16:15
Arnimallee 3
Subsquares of Latin squares
Abstract. A Latin square of order \(n\) is an \(n \times n\) matrix of \(n\) symbols, each of which occurs exactly once in each row and column. A subsquare of a Latin square is a submatrix which is itself a Latin square. Any Latin square of order \(n\) has \(n^2\) subsquares of order \(1\) and a single subsquare of order \(n\). Any other subsquare is called proper. In this talk we discuss a number of problems regarding subsquares. Given integers \(n\) and \(m\), what is the maximum number of subsquares of order \(m\) in a Latin square of order \(n\)? What is the expected number of subsquares of order \(m\) in a uniformly random Latin square of order \(n\)? For what orders do there exist Latin squares without any proper subsquares?
Wed, 22. Jan at 16:30
EN 058
Topological Data Analysis: Algebra and Computation
Abstract. Topological Data Analysis (TDA) is an area that seeks to use methods from algebraic topology to develop new methods for data analysis. Arguably, persistent homology (PH) is the most prominent tool of TDA, which is a multi-scale approach estimating the homology of topological spaces from finite samples. From the PH of such a sample, one can then read off certain descriptors that contain information about the original space's topology. Computing these descriptors touches upon standard problems in computational algebra. In this talk, we will see some basic notions of PH, explore some of the algebraic properties of this structure, and touch upon some computational aspects crucial to the feasibility of PH in practice.
Thu, 23. Jan at 14:00
Weighted tropical Fermat-Weber points
Abstract. Let $v_1,\ldots,v_m$ be points in a metric space $X$ with distance $d$, and let $w_1,\ldots,w_m$ be positive real weights. The weighted Fermat-Weber points are those points $x$ which minimize $\sum w_i d(v_i, x)$. When $X$ is the tropical projective torus, and $d$ is the asymmetric tropical distance, Comaneci and Joswig proved that the set of unweighted Fermat-Weber points agrees with the "central" covector cell of the tropical convex hull of $v_1,\ldots,v_m$. In a recent paper, Maize Curiel and I extend this result to the weighted setting using the combinatorics of tropical hyperplane arrangements and polyhedral geometry. Furthermore, we show that for any fixed data points $\bfv_1, \ldots, \bfv_m$, and any covector cell of the tropical convex hull of the data, there is a choice of weights that makes that cell the Fermat-Weber set. In the context of phylogenetics, the (weighted) Fermat-Weber points furnish a method for computing consensus trees.
Fri, 24. Jan
Fri, 24. Jan
Beiträge zum Zählen von Bäumen auf Punktmengen
Fri, 24. Jan at 14:15
Urania
Coordinates are messy in general (relativity)
Tue, 28. Jan at 11:15
1.023 (BMS Room, ...
Rozansky-Witten models as extended defect TQFTs
Abstract. Very few examples of extended topological quantum field theories are known explicitly. In this talk I will discuss a very explicit construction of the extended TQFTs associated to Rozanksy-Witten models with affine target spaces. I will furthermore explain how to incorporate defects into the extended TQFTs. This can be used for instance to derive the Hilbert spaces of affine Rozansky-Witten models associated to surfaces with arbitrary insertions of defect networks.
Tue, 28. Jan at 13:15
Room 3.006, Rudow...
Fukaya categories of conical symplectic resolutions
Abstract. Conical symplectic resolutions are a rather loosely defined class of hyperkähler varieties arising from canonical constructions in representation theory. Important examples include hypertoric varieties, Nakajima quiver varieties and Hitchin spaces. Assuming as little background as possible in symplectic geometry, I will introduce a categorical invariant called the Fukaya category, which is defined using methods of global analysis. When specialized to conical symplectic resolutions, the Fukaya category turns out to be intimately related to a category of longstanding interest in geometric representation theory, called Category O. This talk will report on joint work with (subsets of) Benjamin Gammage, Justin Hilburn, Christopher Kuo, David Nadler and Vivek Shende.
Wed, 29. Jan at 11:30
online
Coherent Transport of Semiconductor Spin-Qubits: Modeling, Simulation and Optimal Control
Abstract
Wed, 29. Jan at 16:00
Wed, 29. Jan at 16:00
Thu, 30. Jan at 14:00
Thu, 30. Jan at 17:15
TU Berlin, Instit...
Robust Portfolio Selection Under Recovery Average Value at Risk
Abstract. We study mean-risk optimal portfolio problems where risk is measured by Recovery Average Value at Risk, a prominent example in the class of recovery risk measures. We establish existence results in the situation where the joint distribution of portfolio assets is known as well as in the situation where it is uncertain and only assumed to belong to a set of mixtures of benchmark distributions (mixture uncertainty) or to a cloud around a benchmark distribution (box uncertainty). The comparison with the classical Average Value at Risk shows that portfolio selection under its recovery version allows financial institutions to better control the recovery of liabilities while still allowing for tractable computations. The talk is based on joint work with Cosimo Munari, Justin PlĂĽckebaum and Lutz Wilhelmy.
Tue, 04. Feb at 11:15
1.023 (BMS Room, ...
Bi-Hamiltonian geometry of WDVV equations: general results
Abstract. It is known (work by Ferapontov and Mokhov) that a system of N-dimensional WDVV equations can be written as a pair of N-2 commuting quasilinear systems (first-order WDVV systems). In recent years, particular examples of such systems were shown to possess two compatible Hamiltonian operators, of the first and third order. It was also shown that all $3$-dimensional first-order WDVV systems possess such bi-Hamiltonian formalism. We prove that, for arbitrary N, if one first-order WDVV system has the above bi-Hamiltonian formalism, than all other commuting systems do. The proof needs some interesting results on the structure of the WDVV equations that will be discussed as well. (Joint work with S. Opanasenko).
Tue, 04. Feb at 13:15
Room 3.006, Rudow...
Wed, 05. Feb at 13:00
ZIB, Room 2006 (S...
Demystifying Pseudo-Boolean Conflict Analysis through a MIP Lens
Abstract. For almost two decades, mixed integer programming (MIP) solvers have used graph-based conflict analysis to learn from local infeasibilities during branch-and-bound search. In this talk, we discuss improvements for MIP conflict analysis by instead using reasoning based on cuts, inspired by the development of conflict-driven solvers for pseudo-Boolean optimization. Phrased in MIP terminology, this type of conflict analysis can be understood as a sequence of linear combinations, integer roundings, and cut generation. We leverage this MIP perspective to design a new conflict analysis algorithm based on mixed integer rounding cuts, which theoretically dominates the state-of-the-art method in pseudo-Boolean optimization using Chvátal-Gomory cuts. Furthermore, we discuss how to extend this cut-based conflict analysis from pure binary programs to mixed binary programs and-in limited form-to general MIP with also integer-valued variables. Our experimental results indicate that the new algorithm improves the default performance of SCIP in terms of running time, number of nodes in the search tree, and the number of instances solved.
Wed, 05. Feb at 15:15
WIAS, Erhard-Schm...
Time-periodic solutions for fluid-solid interactions
Abstract
Thu, 06. Feb at 14:00
Tue, 11. Feb at 11:15
1.023 (BMS Room, ...
Counting in Calabi-Yau categories
Abstract. I will discuss a replacement of the notion of homotopy cardinality in the setting of even-dimensional Calabi--Yau categories and their relative generalizations. This includes cases where the usual definition does not apply, such as Z/2-graded dg categories. As a first application, this allows us to define a version of Hall algebras for odd-dimensional Calabi-Yau categories. I will explain its relation to some previously known constructions of Hall algebras. If time permits, I will also discuss another application in the context of invariants of smooth and graded Legendrian links, where we prove a conjecture of Ng-Rutherford-Shende-Sivek relating ruling polynomials with augmentation categories. The talk is based on joint work with Fabian Haiden, arxiv:2409.10154.
Wed, 12. Feb at 11:30
online
Hybrid Models for Large Scale Infection Spread Simulations
Abstract
Wed, 12. Feb at 15:15
HVP 5-7, R. 411
Breakdown of the mean-field description of interacting systems: Phase transitions, metastability and coarsening
Abstract
Wed, 12. Feb at 16:00
Wed, 12. Feb at 16:30
EN 058
Complex analogues of the Tverberg-Vrećica conjecture and central transversal theorems
Abstract. The Tverberg-Vrećica conjecture is a broad generalization of Tverberg's classical theorem. One of its consequences, the central transversal theorem, extends both the centerpoint theorem and the ham sandwich theorem. In this talk, we will consider complex analogues of these results, where the corresponding transversals are complex affine spaces. The proofs of the complex Tverberg-Vrećica conjecture and its optimal colorful version rely on the non-vanishing of an equivariant Euler class. Furthermore, we obtain new Borsuk--Ulam-type theorems on complex Stiefel manifolds, which are interesting on their own. These theorems yield complex analogues of recent extensions of the ham sandwich theorem for mass assignments and provide a direct proof of the complex central transversal theorem. This talk is based on a joint work with Pablo Soberón.
Thu, 13. Feb at 14:00
Wed, 19. Feb at 13:00
ZIB, Room 2006 (S...
Neural Networks for Unsupervised Discovery of Plane Colorings
Abstract. We present a framework that transforms geometric and combinatorial problems into optimization tasks by designing loss functions that vanish precisely when the desired coloring properties are achieved. We employ neural networks trained through gradient descent to minimize these loss functions, allowing for efficient exploration of the solution space. We demonstrate the effectiveness of the method on variants of the Hadwiger-Nelson problem, which asks for plane colorings that avoid monochromatic unit-distance pairs and sketch how the approach can be applied to other problems.
Mon, 10. Mar at 13:30
WIAS 405-406
First Optimize, Then Discretize for Scientific Machine Learning
Abstract. This talk provides an infinite-dimensional viewpoint on optimization problems encountered in scientific machine learning and discusses the paradigm first optimize, then discretize for their solution. This amounts to first choosing an appropriate infinite-dimensional algorithm which is subsequently discretized in the tangent space of the neural network ansatz. To illustrate this point, we show that recently proposed state-of-the-art algorithms for scientific machine learning applications can be derived within this framework. Finally, we discuss the crucial aspect of scalability of the resulting algorithms.
Wed, 12. Mar at 13:00
ZIB, Room 2006 (S...
Wed, 26. Mar at 13:00
ZIB, Room 2006 (S...
Wed, 16. Apr at 16:30
EN 058