Talk
An efficient algorithm for tensor learning
- Leonard Schmitz (TU Berlin)
Upcoming Events of this Seminar
- Tuesday, 17.03.26 Partial fraction decompositions on hyperplane arrangements Claire de Korte
- Tuesday, 17.03.26 Wachspress' Conjecture and the Geometry of Polycons Bounded by Three Conics Clemens Brüser
- Tuesday, 24.03.26 An efficient algorithm for tensor learning Leonard Schmitz
- Tuesday, 24.03.26 Linear operators preserving volume polynomials Lukas Grund
- Tuesday, 31.03.26 Lee-Yang phenomena in edge-coloured graph counting Maximilian Wiesmann
- Tuesday, 07.04.26 Nash equilibria and A-discriminants Katherine Tung
- Tuesday, 07.04.26 New directions in algebraic statistics Serkan Hoşten
- Tuesday, 14.04.26 The probabilistic approach and the BKK Theorem Léo Mathis
- Tuesday, 14.04.26 The problem of real vs complex in distance optimization Emil Horobet
- Tuesday, 21.04.26 h-Polynomials of Graph Ideals via the Independence Polynomial Selvi Kara
- Tuesday, 21.04.26 Flexibility and Higher-order Rigidity of (certain) Geometric Constraint Systems Matthias Himmelmann
- Tuesday, 05.05.26 Periods and their motivic Galois theory Clément Dupont
- Tuesday, 05.05.26 From hyperplanes to cosmological correlators Anaëlle Pfister