APPLIED ALGEBRA AND ANALYSIS ONLINE SEMINAR


Applied Algebra and Analysis Online Seminar (AAA) aims at bringing together researchers that develop algebraic and analytic tools to tackle problems coming from different areas of science and engineering.

Date: monthly 16:00-17:00 (CEST) at https://webconf.tu-bs.de/dir-grt-gft.

Summer Semester 2024

Date Title Speaker
12.04 Systematic approaches to the analysis and design of optimization algorithms Adrien Taylor (INRIA, Paris)
03.05 (at 14:00) Spectral Phases of the Erdős–Rényi graph Johannes Alt (Bonn University)
14.06 (at 14:00) Algebraic machine learning and the problem of finding singularities Markus Pflaum (University of Colorado)
TBD TBA Cordian Riener (UiT The Artic University)

AAA is a joint initiative of research groups from Technische Universität Braunschweig and Universität Osnabrück.
It is organized by Timo de Wolff, Boulos El Hilany, Stefan Kunis, Dirk Lorenz and Tim Römer.

Get into the mailing list

If you would like to be informed about the upcoming seminars, write us an Email

Past Talks

Date Title Speaker
21.10 An algorithm for counting realizations of minimally rigid graphs using intersection theory Boulos El Hilany (TU Braunschweig)
28.10 Lipschitz continuity of sparse super resolution and its trigonometric approximation Mathias Hockmann (Universität Osnabrück)
4.11 Faster Wasserstein distance estimation with the Sinkhorn divergence Lénaïc Chizat (EPFL)
11.11 Distributed Learning in High Dimension Nicole Mücke (TU Braunschweig)
18.11 Sensitivity of low-rank matrix approximation and recovery Paul Breiding (MPI MiS)
25.11 Faster quantum and classical SDP approximations for quadratic binary optimization Richard Küng (Universität Linz)
2.12 New condition-based bounds for the number of real zeros Josué Tonelli-Cueto (Inria Paris and IMJ-PRG)
10.12 AAA in-person meeting (canceled) @ TU Braunschweig
16.12 From chromatic polynomials of graphs to maximum likelihood degree, by intersection theory Mateusz Michalek (Universität Konstanz)
13.1 Unlimited Sampling from Theory to Practice Felix Krahmer (TU München)
20.1 Updating and downdating of orthogonal rational functions Marc Van Barel (KU Leuven)
27.1 Algebra and topology for biological systems Heather Harrington (University of Oxford)
3.2 Homotopy continuation for kinematic synthesis and variational inference Jonathan Hauenstein (University of Notre Dame)
10.2 Half-Trek Criterion for Identifiability of Latent Variable Models Mathias Drton (TU München)


Date Title Speaker
16.04 Wasserstein distance to an algebraic variety Lorenzo Venturello (KTH)
23.04 Toric Eigenvalue Methods for Solving Sparse Polynomial Systems Matías Bender (TU Berlin)
30.04 Families of faces for convex semi-algebraic sets Daniel Plaumann (TU Dortmund)
07.05 Geometry of sampling Sandra Di Rocco (KTH)
14.05 Measuring the sensibility of numerical problems,
including your favourite one 		Carlos Beltrán (Universidad de Cantabria)
21.05 Invariant determinantal representations and numerical ranges Cynthia Vinzant (North Carolina State University)
28.05 A normal form method for numerical tensor rank decomposition Simon Telen (MPI MiS)
04.06 Modeling and image reconstruction in the context of magnetic particle imaging Tobias Kluth (Universität Bremen)
11.06 Applications of Group Symmetry Emily King (Colorado State University)
18.06 Likelihood geometry of correlation models Piotr Zwiernik (Universitat Pompeu Fabra)
25.06 Stabilizing Invertible Neural Networks Using Mixture Models Sebastian Neumayer (TU Berlin)
02.07 Disguised toric dynamical systems Miruna-Ştefana Sorea (SISSA)
16.07 Curve recovery from moments and applications Paul Catala (Universität Osnabrück)
23.07 Exploiting Sparsity for Large-Scale Polynomial Optimization Jie Wang (LAAS-CNRS)


Date Title Speaker
30.10 Exact Solutions in Log-Concave Maximum Likelihood Estimation Alexandros Grosdos (TU Munich)
6.11 The geometric measure of level sets of random polynomials Federico Dalmao Artigas (Universidad de la República)
13.11 Douglas-Rachford and Sudoku Puzzle: Finite Termination and Local Linear Convergence Jingwei Liang (University of Cambridge)
20.11 Reciprocal ML-degree of Brownian Motion Tree Models Aida Maraj (MPI MiS)
27.11 Gradient methods for sparse low-rank matrix recovery André Uschmajew (MPI MiS)
4.12 Nodes on Spectrahedra Taylor Brysiewicz (MPI MiS)
11.12 Analysis of Stochastic Gradient Descent in Continuous Time Jonas Latz (University of Cambridge)
15.01 Jordan algebras of symmetric matrices Arthur Bik (MPI MiS)
22.01 Normaliz – a tool for discrete convex geometry Winfried Bruns (Universität Osnabrück)
5.02 Finite symplectic automorphism groups of supersingular K3 surfaces Matthias Schütt (Leibniz Universität Hannover)
12.02 Maximum Likelihood Estimation from a Tropical and a Bernstein-Sato Perspective Anna-Laura Sattelberger (MPI MiS)


Date Title Speaker
15.05 The Jacobian of metabolic networks Nicola Vassena (FU Berlin)
22.05 Counting isolated points outside the image of a polynomial map Boulos El Hilany (RICAM)
28.05 (!This talk in on Thursday!) Learning with graph neural networks Niklas Breustedt (TU Braunschweig)
12.06 Learning algebraic decompositions using Prony structures Ulrich von der Ohe (University of Genova)
19.06 Toric Geometry and discrete statistical models with rational MLE Eliana Duarte (OVGU Magdeburg)
26.06 A central limit theorem for the two-sided descent statistic on Coxeter groups Frank Roettger (MPI MiS)
03.07 Partial recovery in the graph alignment problem Georgina Hall (INSEAD)
10.07 Structure Learning for Cyclic Linear Causal Models Carlos Améndola (TU Munich)
17.07 Prony-type polynomials Anna Veselovska (TU Braunschweig)
24.07 Approximate counting via polynomial capacity Jonathan Leake (TU Berlin)