Posts tagged: fléttufræði

Meistarafyrirlestrar á næstunni

Benedikt Magnússon, maí 29, 2020
28. maí14:00Tölfræði 
Statistics
Þórarinn JónmundssonLíkön og aðferðir til að meta lærdóm: greining árangur nemenda í stærðfræðigreininguModels and methods to evaluate learning: a case study of students enrolled in mathematical analysis
2. júní11:00Hagnýt Tölfræði
Applied Statistics
Þórey HeiðarsdóttirGreining með slembiþáttalíkani á þróun blóðþrýstings og gönguvegalengdar í tveggja ára langtímarannsóknUsing mixed models to analyse progression of blood pressure and walking distance in a two year longitudinal study 
2. júní14:00Hagnýt Tölfræði
Applied Statistics
Ólafur Jón JónssonGreining á niðurstöðum kennslukannana Háskóla Íslands 2013-17Analysis of results from student evaluation of teaching surveys in the University of Iceland 2013 – 2017
3. júní13:00Tölfræði
Statistics
Sindri Emmanúel AntonssonÁhættureiknar fyrir sykursýki aðlagaðir að íslensku þýðiAdapting diabetes risk scores to an Icelandic population
3. júní11:00Stærðfræði
Mathematics
Bergur SnorrasonRudin-Carleson theoremsRudin-Carleson setningar
3. júní13:00Stærðfræði
Mathematics
Hjörtur BjörnssonCovering Spaces for Domains in the Complex PlaneÞekjurúm fyrir svæði í tvinntalnasléttunni
3. júní13:30Stærðfræði
Mathematics
Hulda Hvönn KristinsdóttirThe art of counting – Textbook in enumerative combinatorics for upper secondary schoolsListin að telja – Kennslurit í talningar- og fléttufræði fyrir framhaldsskóla

Thomas Selig (27/6/18)

Sigurður Örn Stefánsson, júní 25, 2018

Málstofa í stærðfræði

Fyrirlesari: Thomas Selig, University of Strathclyde

Titill: EW-tableaux, permutations and recurrent configurations of the sandpile model on Ferrers graphs.

Staðsetning: VRII, V-147
Tími: Miðvikudagur 27. júní kl. 10:30

Ágrip:

The Abelian sandpile model (ASM) is a dynamic process on a graph. More specifically, it is a Markov chain on the set of configurations on that graph. Of particular interest are the recurrent configurations, i.e. those that appear infinitely often in the long-time running of the model. We study the ASM on Ferrers graphs, a class of bipartite graphs in one-to-one correspondence with Ferrers diagrams. We show that minimal recurrent configurations are in one-to-one correspondence with a set of certain 0/1 fillings of the Ferrers diagrams introduced by Ehrenborg and van Willigensburg. We refer to these fillings as EW-tableaux, and establish a bijection between the set of EW-tableaux of a given Ferrers diagram and a set of permutations whose descent bottoms are given by the shape of the Ferrers diagram. This induces a bijection between these permutations and minimal recurrent configurations of the ASM. We enrich this bijection to encode all recurrent configurations, via a decoration of the corresponding permutation. We also show that the set of recurrent configurations over all Ferrers graphs of a given size are in bijection with the set of alternating trees of that size.

Anders Claesson (05/02/16)

Sigurður Örn Stefánsson, febrúar 2, 2016

Málstofa í stærðfræði

Fyrirlesari: Anders Claesson
Titill: Interval orders via combinatorial species and ballot matrices

Staðsetning: V-157, VRII.
Tími: Föstudagur 5. febrúar kl. 13:20.

Ágrip:

We give a brief introduction to (some aspects of) combinatorial species.
Using this framework we introduce ballot matrices and present a subset
of them that is in bijection with labeled interval orders. Such ballot
matrices decompose naturally into a pair of permutations with related
properties, which leads to a new formula for the number of labeled
interval orders.

This talk is based on joint work with Stuart Hannah.

Bjarni Jens Kristinsson and Henning Úlfarsson (04/06/15)

Benedikt Magnússon, júní 1, 2015

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. (2014). We define the occurrence graph \(G_p(\pi)\) of a pattern \(p\) in a permutation \(\pi\) as the graph with the occurrences of \(p\) in \(\pi\) as vertices and edges between the vertices if the occurrences differ by exactly one element. We study the general properties of the occurrence graphs and some interesting extreme cases. The main theorem in this paper is that every hereditary property of graphs produces a permutation class.

Henning Úlfarsson (22/01/15)

Benedikt Magnússon, janúar 22, 2015

Málstofa í stærðfræði

Fyrirlesari: Henning Úlfarsson, Háskólinn í Reykjavík
Titill: Struct: An algorithm for guessing the structure and enumeration of permutation sets

Staðsetning: Naustið, Endurmenntun (hér)
Tími: Fimmtudagur 22. janúar, frá 15:00-16:00.

Höfundar:

Michael Albert, Anders Claesson, Bjarki Gudmundsson, Henning Ulfarsson

Ágrip:

Struct is an algorithm being developed by the authors to
guess the structure of a set of permutations. In some cases the structure
discovered is sufficient to infer the generating function of the set and
provides an enumeration of the permutations by length. A preliminary version of
the algorithm will be presented and applied to several sets of permutations.
This research is funded by the Icelandic Research Fund, Grant no.~141761-051