Næsta málstofa verður þriðjudaginn 25. apríl kl 13:20 í Naustinu, húsi Endurmenntunar. Fyrirlesari er Gabor Elek, Lancaster University. Titill fyrirlestrarins er Very fast graph algorithms. Ágrip: Interesting graph parameters are very hard to compute, that is, the known computation algorithms run in exponential times. Unfortunately, we don’t have that much time…. However, for certain important …
Meistaraprófsfyrirlestur Arnbjörg Soffía Árnadóttir Titill: Grúpuverkanir á óendanleg stefnd net og hlutbrautafallið Staðsetning: Naustið, Endurmenntun. Tímasetning: Fimmtudagur 6. október 2016, klukkan 16:00. Ágrip: Við notum grúpuverkanir til þess að skoða óendanleg stefnd net. Við byrjum á því að skilgreina grúpumótun sem við köllum hlutbrautafallið. Við notum svo þessa mótun til þess að skoða ýmsa eiginleika óendanlegra …
Málstofa í stærðfræði Fyrirlesari: Anthony Bonato Titill: Conjectures on Cops and Robbers Games on Graphs Staðsetning: TG-227 (Tæknigarður, 2. hæð) Tími: Fimmtudagur 30. júní kl. 13:20. Ágrip: The game of Cops and Robbers gives rise to a rich set of conjectures, mainly associated with the cop number of a graph. Arguably the most important such …
Málstofa í stærðfræði Fyrirlesari: François David Titill: Planar maps, circle patterns and 2D gravity Staðsetning: V-157, VRII. Tími: Föstudagur 11. mars kl. 13:20. Ágrip: I present a model of random planar triangulations (planar maps) based on circle patterns and discuss its properties. It exemplifies the relations between discrete random geometries in the plane, conformally invariant …
Málstofa í stærðfræði Fyrirlesari: Páll Melsted Titill: Space Utilization of Cuckoo Hashtables Staðsetning: V-157, VRII. Tími: Föstudagur 23. október, klukkan 15:00-16:00. Ágrip: We study the space requirements for Cuckoo Hashing. This can be reduced to the following question in Random Graphs. We are given two disjoint sets L,R with |L|=n=alpha*m and |R|=m. We construct a …
Málstofa í stærðfræði Fyrirlesari: Matthias Hamann Titill: Accessible groups and graphs Staðsetning: V-157, VRII. Tími: Föstudagur 2. október, klukkan 15:00-16:00. Ágrip: The talk falls into two parts. First, we give an overview of the group theoretical concept of accessibility and the main results in this area. In the second part, we define the graph theoretical …
Málstofa í stærðfræði Fyrirlesari: Florian Lehner Titill: Cops, robbers, and infinite graphs Staðsetning: V-157, VRII. Tími: Föstudagur 11. september, klukkan 15:00-16:00. Ágrip: Pursuit-evasion based searching, also known as the game of cops and robbers is a game on a graph between two players, $C$ (the cop) and $R$ (the robber). The rules are as follows: …
Málstofa í stærðfræði Fyrirlesarar: Bjarni Jens Kristinsson, Háskóla Íslands, og Henning Úlfarsson, Háskólanum í Reykjavík Titill: Occurrence graphs of patterns in permutations Staðsetning: Naustið, Endurmenntun (hér) Tími: Fimmtudagur 4. júní, klukkan 15:00-16:00. Ágrip: This paper is based on a generalisation of the idea behind the proof of the Simultaneous Shading Lemma by Claesson et al. …
Málstofa í stærðfræði Speaker: Rögnvaldur Möller Title: Infinite cubic vertex-transitive graphs Staðsetning: Naustið, Endurmenntun (hér) Tími: Fimmtudagur 21. maí, klukkan 15:00-16:00. Ágrip: Tutte’s two papers from 1947 and 1959 on cubic graphs were the starting point of the in-depth study of the interplay between the structure of a group and the structure of a graph …
Málstofa í stærðfræði Speaker: Thomas Vallier, University of Iceland Title: Majority bootstrap percolation on . “ Staðsetning: Naustið, Endurmenntun (hér) Tími: Fimmtudagur 7. maí, klukkan 15:00-16:00. Ágrip: Majority bootstrap percolation is a process of spread of „activation“ on a given graph with a given number of initially active nodes chosen uniformly at random. At each …
