esc

Talks & Slides

14Talks
9Research
5Seminars

Timeline

2026

Research Talk Upcoming EN

Towards a Quantitative Operational Semantics

Friedrich-Alexander-Universität Erlangen-Nürnberg · 159 slides.

The theorem of Turi and Plotkin makes bisimilarity a congruence for GSOS laws over sets. Over quasi-pseudometric spaces, the same laws bound the distance of two programs in a context by a modulus of the distances of their parts. Hausdorff distances bring back bisimilarity and similarity, and for programs that flip coins the rules compute the moduli, exactly for the standard process algebra.

Research Talk EN

A Homology Theory for Programming Languages

Slides for the manuscript · 216 slides.

The programs of a language obey laws, and homology counts them. In seven chapters the talk follows a GSOS law to its models, differentiates the rules into a linearisation and draws on each model a small complex. Its first homology holds the laws modulo their consequences, and for forward rules the input words act on these laws by transfers.

Research Talk EN

Turi–Plotkin Homology

École normale supérieure de Lyon · 148 slides.

Rules in the GSOS format are natural transformations, and their models are bialgebras. The free bialgebras give a comonad G=FU, and its bar resolution turns every model into a chain complex. Degree zero collects the quantities that transitions preserve, and degree one finds laws that hold in a model but not in the free one.

Note EN

Turi–Plotkin Homology: Notes for the Talk

Notes for the talk at the École normale supérieure de Lyon · 35 pages.

Companion to the Lyon talk. The background runs from free abelian groups through GSOS rules, bialgebras, the bar construction and Smith normal form to comonad homology, with every definition and proof written out. The talk then follows slide by slide, each with its goal, a script, the details behind it and answers to likely questions.

Research Talk EN

Persistent Magnitude Homology for Quantitative Equational Theories

Slides for arXiv:2608.21479 · 37 slides.

A quantitative equational theory U gives every metric space A a free algebra TUA, and filtering it by length yields a persistent homology whose associated graded is magnitude homology. A long exact sequence joins the two and locates where bars begin and end, and the barcode in degree n moves by at most (n+1)δ under a perturbation of size δ.

Research Talk Invited EN

Universal Coefficient Theorem and Moore–Mayer–Vietoris Sequence for Homology of Ample Groupoids

South Atlantic Noncommutative Geometry Seminar · 110 slides.

Ample groupoids carry a homology of compactly supported Moore chains on their nerve. For discrete coefficients a universal coefficient theorem holds, and without discreteness it fails. Clopen saturated covers U1∪U2=G0 give a Moore–Mayer–Vietoris sequence, and together the two results compute the homology of a Diaconu–Renault groupoid with coefficients in Z/pZ.

Note EN

Human-Centered Mathematics

Note · 5 pages.

Mathematics is learned best as sense-making with good feedback, not as the storage of finished results. This short note brings together Pólya on how problems are solved, Thurston on mathematics as human understanding, and research in cognitive science on how such understanding grows, and it asks what follows for learning mathematics.

Seminar DE

Konstruktion des Jones-Polynoms aus Uq(sl2)

Seminar Knoten und Schleifen · 20 pages.

Link diagrams become morphisms of a category of tangles, and invariance under the Reidemeister moves becomes a matter of relations between its generators. Representations of the quantum group Uq(sl2) form a ribbon category, and the functor from tangles into it, applied to the two-dimensional representation, yields the Jones polynomial.

2025

Seminar DE

Leray–Serre-Spektralsequenz

Seminar zur Spektraltheorie · 23 pages.

A spectral sequence is a stack of pages Ep,qr with differentials dr:Ep,qr→Ep−r,q+r−1r, each page the homology of the one before. For a fibration, the Leray–Serre spectral sequence runs from the homology of the base with coefficients in that of the fibre to the homology of the total space, and it computes the homology of CP∞.

2024

Seminar DE

Beschränkte Fredholmoperatoren und deren Fredholmindex auf separablen Hilberträumen

Seminar zur Funktionalanalysis · 16 pages.

A bounded operator on a separable Hilbert space is Fredholm if its kernel and cokernel are finite-dimensional, and its index is indT=dim⁡ker⁡T−dim⁡cokerT. The index is invariant under compact perturbations, Fredholm operators are exactly the operators that become invertible in the Calkin algebra, and Toeplitz operators provide the examples.

2022

Seminar DE

Natürliche Transformationen, Äquivalenzen von Kategorien, darstellbare Funktoren und das Lemma von Yoneda

Seminar Talk · 6 pages.

Natural transformations compare functors, and with them one can say when two categories are equivalent: exactly when a functor between them is full, faithful and essentially surjective. Representable functors are those isomorphic to some C(c,−), and the Yoneda lemma Nat(C(c,−),F)≅F(c) shows that an object is determined by the maps out of it.

2021

Research Talk EN

Homological Analysis of Sensor Signals from Power Plants

ML4ITS, ECML PKDD 2021 · 48 slides.

Each sensor signal of a power plant is to be assigned its place in the reference designation system of the plant. Sliding windows turn a signal into a point cloud, which winds around a torus when the signal is quasi-periodic, and its Betti curves in degrees 0 and 1 feed a network of convolutions and LSTMs alongside the raw signal.

2020

Research Talk EN

Introduction to Persistent Homology

Chair of Computer Science 6 · 44 slides.

Point clouds become simplicial complexes once a scale is chosen, and the Čech and Vietoris–Rips filtrations let that scale grow. Simplicial homology over a field then turns each filtration into a persistence module, whose barcode records when connected components, loops and voids appear and when they disappear again.

Research Talk EN

Stop Interpolation Topologically

IWCIA 2020, Novi Sad · 57 slides.

Voronoi interpolation densifies a sample by natural neighbours, and every new point may change the topology of the data. Persistent homology is computed after each step, and as soon as the bottleneck and Wasserstein distances to the original diagram exceed a threshold, the interpolation stops. The experiments use handwritten signatures from the MOBISIG database.

Seminar EN

Homological Perspective on Data

Chair of Computer Science 6 · 55 slides.

Homology counts connected components, loops and voids, and it does not change under continuous deformation. The talk builds it from the ground up: topological spaces and continuous maps, simplicial complexes as their combinatorial models, and chains, cycles and boundaries, whose quotient is homology, with point clouds as the data in view.