BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Introduction to homological mirror symmetry and the Fukaya categor
y
DTSTART;VALUE=DATE-TIME:20200306T094500Z
DTEND;VALUE=DATE-TIME:20200306T103000Z
DTSTAMP;VALUE=DATE-TIME:20221207T144000Z
UID:indico-contribution-1131@indico.uu.se
DESCRIPTION:Speakers: Johan Asplund (Uppsala University)\n\nHomological mi
rror symmetry is a deep mathematical conjecture\nproposed by Maxim Kontsev
ich at the 1994 ICM in Zürich\, and it is about\na certain relationship b
etween the two mathematical areas of symplectic\ngeometry and algebraic ge
ometry. More precisely\, the conjecture states\nthat there is a derived eq
uivalence between the so-called Fukaya\ncategory in symplectic geometry\,
and the category of coherent sheaves\nwhich is well-studied in the field o
f algebraic geometry. The conjecture\nis an attempt at understanding mirro
r symmetry in string theory which is\nwell-known by physicists.\n\nIn this
talk I will first go through history and origins of the\nconjecture. Afte
r that\, an introduction to symplectic geometry will be\ngiven and the goa
l will be to give the audience a feeling of what the\nFukaya category is.\
n\nhttps://indico.uu.se/event/699/contributions/1131/
LOCATION:4001 (Ångströmslaboratoriet)
URL:https://indico.uu.se/event/699/contributions/1131/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ramified covers and root stacks
DTSTART;VALUE=DATE-TIME:20200306T084500Z
DTEND;VALUE=DATE-TIME:20200306T093000Z
DTSTAMP;VALUE=DATE-TIME:20221207T144000Z
UID:indico-contribution-1129@indico.uu.se
DESCRIPTION:Speakers: Eric Ahlqvist (KTH)\n\nA ramified cover X of a surfa
ce S gives rise to ramification data in the following sense: the locus in
S over which X is ramified will look like a union of curves and to each cu
rve we associate the corresponding ramification index. Conversely\, given
a finite number of curves in S intersecting only transversely\, and a pos
itive integer for each curve\, we may ask when such data comes from a rami
fied cover. We will explain how to give a criteria for when this is the ca
se\, using root stacks.\n\nhttps://indico.uu.se/event/699/contributions/11
29/
LOCATION:4001 (Ångströmslaboratoriet)
URL:https://indico.uu.se/event/699/contributions/1129/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Strategic ability\, information and memory
DTSTART;VALUE=DATE-TIME:20200306T120000Z
DTEND;VALUE=DATE-TIME:20200306T124500Z
DTSTAMP;VALUE=DATE-TIME:20221207T144000Z
UID:indico-contribution-1132@indico.uu.se
DESCRIPTION:Speakers: Daniel Ahlsén (Stockholm University)\n\nA typical g
ame theoretic question is this: given some set of information and availabl
e memory\, what conditions can an agent force? This talk will tackle the c
onverse: given a class of conditions\, what information and memory does an
agent need to force the conditions? Specifically\, I present the logic AT
L* for reasoning about strategic ability in a multi-agent settings\, and s
how that for certain fragments of ATL*\, one can restrict the information
available to agents without limiting their strategic abilities.\n\nhttps:/
/indico.uu.se/event/699/contributions/1132/
LOCATION:4001 (Ångströmslaboratoriet)
URL:https://indico.uu.se/event/699/contributions/1132/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Importance sampling and weak convergence in population genetics
DTSTART;VALUE=DATE-TIME:20200306T130000Z
DTEND;VALUE=DATE-TIME:20200306T134500Z
DTSTAMP;VALUE=DATE-TIME:20221207T144000Z
UID:indico-contribution-1130@indico.uu.se
DESCRIPTION:Speakers: Martina Favero (KTH)\n\nImportance sampling algorith
ms are used in population genetics to estimate small probabilities of gene
configurations. In order to prove the efficiency of these algorithms\,
it is necessary to determine the asymptotic behaviour of the sampling pro
babilities. As a first step in this direction\, we show weak convergence f
or a sequence of coalescent processes and the corresponding mutation proc
esses\, as the sample size goes to infinity. Time is scaled and convergenc
e of semigroups is proved. The limiting process consists of a deterministi
c part and of conditionally independent Poisson processes with varying int
ensity. This is a work in progress with H.Hult (KTH).\n\nhttps://indico
.uu.se/event/699/contributions/1130/
LOCATION:4001 (Ångströmslaboratoriet)
URL:https://indico.uu.se/event/699/contributions/1130/
END:VEVENT
BEGIN:VEVENT
SUMMARY:The Gaussian free field: local sets and their dimensions
DTSTART;VALUE=DATE-TIME:20200306T141500Z
DTEND;VALUE=DATE-TIME:20200306T150000Z
DTSTAMP;VALUE=DATE-TIME:20221207T144000Z
UID:indico-contribution-1133@indico.uu.se
DESCRIPTION:Speakers: Lukas Kristiansson Schoug (KTH)\n\nThe two-dimension
al Gaussian free field is the canonical model for a random surface and is
important in many different areas of mathematics and physics. It is the tw
o-dimensional time analog of Brownian motion and enjoys many similar prope
rties\, such as a certain domain Markov property and local sets\, i.e.\, h
igher-dimensional versions of stopping times. In this talk\, we introduce
these notions\, with the Brownian motion in mind\, and discuss the propert
ies of these random sets as well as briefly describe how to compute the di
mensions of a certain class of local sets. The talk is based on joint work
with Avelio Sepúlveda and Fredrik Viklund.\n\nhttps://indico.uu.se/event
/699/contributions/1133/
LOCATION:4001 (Ångströmslaboratoriet)
URL:https://indico.uu.se/event/699/contributions/1133/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Percolation
DTSTART;VALUE=DATE-TIME:20200306T151500Z
DTEND;VALUE=DATE-TIME:20200306T160000Z
DTSTAMP;VALUE=DATE-TIME:20221207T144000Z
UID:indico-contribution-1134@indico.uu.se
DESCRIPTION:Speakers: Johanna Strömberg (Uppsala University)\n\nPercolati
on studies the behaviour of clusters in random graphs. It has applications
to modeling phenomena as diverse as magnetism\, spread of infectious dise
ases\, and the adaption of new technologies in society. This talk will gi
ve a brief overview of the theory of percolation\, starting from the celeb
rated Harris-Kesten theorem on percolation in the square lattice in two di
mensions. We will in particular consider tools used to study percolation
in random geometric graphs and the configuration model. Finally\, we will
consider what new questions arise when we drop the independence requiremen
t from the standard percolation process.\n\nhttps://indico.uu.se/event/699
/contributions/1134/
LOCATION:4001 (Ångströmslaboratoriet)
URL:https://indico.uu.se/event/699/contributions/1134/
END:VEVENT
END:VCALENDAR