Author name: Valentina Giangreco

[:is]Math colloquium Fyrirlesari: Anna Helga Jónsdóttir og Benedikt Steinar Magnússon, Háskóli Íslands Titill 1: Student evaluations of teaching at the University of Iceland – analysis of data from 2013 – 2017 Ágrip 1: Student evaluations of teaching (ísl. kennslukönnun) is administrated at the end of each and every course at the University of Iceland with

[:is]Málstofa í stærðfræði Fyrirlesari: Finnur Lárusson, Adelaide University Titill: Chaotic holomorphic automorphisms of Stein manifolds with the volume density property Staðsetning: VR-II, V-158Tími: þriðjudagur 9. júlí kl. 11.00 Ágrip: I will report on joint work with Leandro Arosio.  Let $X$ be a Stein manifold of dimension $n\geq 2$ satisfying the volume density property with respect to an exact

[:is]Málstofa í stærðfræði Fyrirlesari: Guðmundur Magnússon, HI Titill: Multi Dispatcher Systems and interacting policies Staðsetning: VR-II, V-258Tími: þriðjudagur 18. júní kl. 11.00 Ágrip: This project explores the performance of parallel server system. The focus of the project is a system using multiple heuristic policies to route jobs to a server. To achieve this there is

[:is]Málstofa í stærðfræði Fyrirlesari: Sylvain Arguillère, CNRS – Institut Camille Jordan – MMCS Titill: Shape analysis through flows of diffeomorphisms Staðsetning: VR-II, V-258Tími: fimmtudagur 13. júní kl. 11.00 Ágrip: The goal of shape analysis is to compare shapes in a way that takes into account their geometric properties. The end goal is to give an

[:is]Málstofa í stærðfræði Fyrirlesari: Wolfgang Woess, TU Graz Titill: THE LANGUAGE OF SELF-AVOIDING WALKS Staðsetning: VR-II, V-155Tími: þriðjudagur 4. júní kl. 11.00 Ágrip: Let X = (VX, EX) be an infinite, locally finite, connected graph withoutloops or multiple edges. We consider the edges to be oriented, and EX is equipped withan involution which inverts the

[:is]Málstofa í stærðfræði Fyrirlesari: Primoz Potocnik, University of Ljubljana Titill: Symmetries of finite graphs – a personal overview Staðsetning: VR-II, V-158Tími: þriðjudagur 28. maí kl. 11.00 Ágrip: Whether a graph is more or less symmetric is typically measured in terms of its automorphism group consisting of all permutation of its vertices which preserves the adjacency

[:is]Málstofa í stærðfræði Fyrirlesari: Giulio Cerbai, University of Florence Titill: Sorting Permutations Using Pattern-Avoiding Stacks Staðsetning: Tg-227 Tími: Fimmtudagur 9. maí kl. 11.40 Ágrip: The problem of sorting a permutation using a stack was proposed by Knuth in the 1960s. As it is well known, sortable permutations can be characterized in terms of pattern avoidance