![]() |
![]() |
TanglesAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Felix Joos. We investigate so-called tangles. This notion locates high-connected parts in graphs. This talk is part of the Reading Group in Combinatorics and Probability series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsMetallurgy & Materials – Tech Entrepreneurship Seminar Series Physics and Astronomy Colloquia PIPS - Postgraduate Informal Physics SeminarsOther talksOuterspacial 2-complexes Roots of random functions Principal Component Analysis of Quantum Materials Data: a Study in Augmented Intelligence Variational Bayesian inference for point processes - a latent variable approach Prediction of Toric Code Topological Order from Rydberg Blockade |