Fyrirlesari: Tarmo Uustalu, Háskólinn í Reykjavík Titill: Skew categorical logic Staðsetning: Oddi O-106, 14. mars, 11:40. Ágrip: This is a talk on categorical logic as pioneered by Joachim Lambek in the late 1960s. We are interested in weak logics of a particular kind – logics defined by categories with some type of skew structure. I […]
Málstofa: Tarmo Uustalu Read More »
7. mars, kl. 11:40, í Oddi O-106. Fyrirlesari: Sigrún Helga Lund, Háskóli Íslands Titill: Utilizing Plasma Proteomics for Biomarker Discovery: Methodological Approaches and Novel Insights. Ágrip: Integrating high-throughput proteomic data with clinical and genetic information is a powerful approach to identify novel biomarkers and drug targets. Here, we outline the methodology and present examples of
Málstofa: Sigrún Helga Lund Read More »
22. febrúar, kl. 11:40, í Oddi O-106. Fyrirlesari: Sigurður Freyr Hafstein, Háskóli Íslands Titill: Contraction Metrics and their numerical computation, Part 2 Ágrip: Similar to Lyapunov functions, Contraction Metrics can be used to characterize the long term behavior of dynamical systems. We will discuss what they are, their relation to Lyapunov functions, and how they
Málstofa: Sigurður Freyr Hafstein Read More »
8. february, kl. 11:40, í Oddi O-106 Fyrirlesari: Anders Claesson, Háskóli Íslands. Titill: Permutations with few inversions Ágrip: We consider permutations of [n] with at most n inversions; this is what we mean by permutation with few inversions. In particular, we present a curious generating function for permutations of [n] with exactly n inversion. Furthermore,
Málstofa: Anders Claesson Read More »
Fyrirlesari: Matthias Hamann (University of Warwick). Titill: Hyperbolic monoids and digraphs Oddi O-101, fimmtudaginn 25. janúar, kl. 11:40 Ágrip: The notion of hyperbolicity for metric spaces, graphs and groups is a topic that got a lot of attention since Gromov’s seminal paper. While there have been several attempts to obtain a similar notion for monoids,
Málstofa: Matthias Hamann Read More »
Fyrirlesari: Bjarnheiður Kristinsdóttir (Háskóli Íslands). Titill: Introducing <colette/>, a Computational Thinking Learning Environment for Teachers in Europe. 8. desember 2023, kl. 11:40 í tg-227 í Tæknigarði. Ágrip: During the past 3 years, I took part in the European research and development project <colette/>, which stands for „Computational Thinking Learning Environment for Teachers in Europe“. The project was
Málstofa: Bjarnheiður Kristinsdóttir Read More »
Fyrirlesari: Benedikt Steinar Magnússon (Háskóli Íslands) Titill: Liouville’s theorem: variant for graded polynomial rings Staðsetning: 1 desember 2023, kl. 11:40 í stofu 152 í VR-II Ágrip: Liouville’s theorem is a fundamental theorem in complex analysis which states that every bounded entire function must be constant. A corollary of it shows that an entire function which
Málstofa: Benedikt Magnússon Read More »
Fyrirlesari: Evangelos Tsolakidis (Háskóli Íslands) Titill: A Gentle Approach to Random Matrices Staðsetning: 24 nóvember 2023, kl. 11:40 í stofu 152 í VR-II Ágrip: Bob and Rob are two trees living in full awe somewhere deep in rural Scandinavia. They are acquainted with Odin’s two best friends, Huginn and Muninn, that overlook Midgard from the
Málstofa: Evangelos Tsolakidis Read More »
Fyrirlesari: Szabolcs Horvát (Háskólinn í Reykjavík) Titill: Characterizing spatial networks through β-skeletons 17. nóvember 17, kl. 11:40 í stofu 152 in VR-2 Ágrip: Network science has developed many methods for the characterization of networks, most being designed for generic sparse graphs. However, the nodes of many real-world networks exist in physical space, with only nearby
Málstofa: Szabolcs Horvát Read More »
3. nóvember, kl. 11:40 Stofa 152 í VR-2 Fyrirlesari: Adam Timar Titill: On Uniform Spanning Forests Ágrip: How can we generate a random labyrinth efficiently, and how can we describe its properties, such as the expected distance between two points in the labyrinth? This question can be made precise and answered through the study of
Málstofa: Adam Timar Read More »
