BEGIN:VCALENDAR
METHOD:PUBLISH
PRODID:Microsoft Exchange Server 2010
VERSION:2.0
X-WR-CALNAME:Pure Maths Colloquium
BEGIN:VTIMEZONE
TZID:GMT Standard Time
BEGIN:STANDARD
DTSTART:16010101T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
RRULE:FREQ=YEARLY;INTERVAL=1;BYDAY=-1SU;BYMONTH=10
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:16010101T010000
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;INTERVAL=1;BYDAY=-1SU;BYMONTH=3
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DESCRIPTION:Substitution rules are widely known for generating aperiodic Eu
 clidean tilings\, sequences of partitions\, and combinatorial words. In th
 e talk\, I will describe these objects and introduce a construction of hyp
 erbolic tilings that offers a unifying framework for studying such structu
 res. This approach extends earlier constructions considered by\, among oth
 ers\, Penrose\, Kakutani\, and Kamae\, and vividly illustrated by Escher. 
 A key ingredient in the analysis is path counting in incommensurable direc
 ted weighted graphs\, which underpins various statistical and dynamical pr
 operties\, including a prime orbit theorem for the associated geodesic flo
 w. If time allows\, I will also discuss recent results on the rich and int
 ricate patterns of resonances of the associated dynamical zeta function. N
 o prior knowledge is assumed.\n
UID:040000008200E00074C5B7101A82E00800000000272B3D6CBE14DC01000000000000000
 010000000583DD8AE043BCC4CBD136CC4FCBF19D3
SUMMARY:Yotam Smilansky (University of Manchester): Incommensurable substit
 utions and their tilings
DTSTART;TZID=GMT Standard Time:20250918T160000
DTEND;TZID=GMT Standard Time:20250918T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Maths Lecture Theatre A
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Quasisymmetric maps are homeomorphisms between metric spaces th
 at\, roughly speaking\, distort relative distances in a controlled\, scale
 -invariant way. These mappings play an important role in geometric functio
 n theory\, where classifying spaces up to quasisymmetric equivalence is a 
 central\, and in general very difficult\, problem. Quasisymmetries also ar
 ise naturally in other areas of mathematics\, such as geometric group theo
 ry\, where they appear as boundary extensions of quasi-isometries on hyper
 bolic groups.\n\nMy aim in this talk is to motivate the study of quasisymm
 etric maps and give an overview of the current state of the theory of conf
 ormal dimensions\, which are some of the most versatile quasisymmetric inv
 ariants. I will mainly focus on two of the most important variants of conf
 ormal dimension\, the conformal Hausdorff and Assouad dimensions\, and dis
 cuss techniques for bounding them from above and below. Many examples will
  be given and some fundamental open problems will be discussed as well.\n\
 n
UID:040000008200E00074C5B7101A82E008000000007C6309C68917DC01000000000000000
 010000000005EE66B37F059489E42004A93F503B5
SUMMARY:Roope Anttila (University of St Andrews): Conformal dimension and q
 uasisymmetric geometry
DTSTART;TZID=GMT Standard Time:20250925T160000
DTEND;TZID=GMT Standard Time:20250925T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Maths Lecture Theatre D
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:A (bar-joint) framework is a geometric structure composed of st
 iff bars\, linked together by freely-rotational joints. Such a structure i
 s said to be rigid if\, loosely speaking\, it cannot be deformed. Geometri
 c rigidity is a theory which uses tools from various mathematical areas to
  determine whether a structure is rigid or not. There are mathematical var
 iations to the definition of framework and rigidity\, as well as variation
 s of the questions which interest mathematicians.\nAssuming ‘genericity
 ’ rigidity can be treated as a property of the underlying graph of a giv
 en framework. Notably\, the Gereinger-Laman theorem combinatorially charac
 terises rigid graphs in dimension 2. When introducing symmetry\, genericit
 y is lost. As a consequence\, frameworks behave in unexpected ways. Since 
 symmetric frameworks can be useful for a variety of applications\, there h
 as been significant interest in such structures.\nIn this talk\, we will g
 o through some definitions of rigidity\, and see how symmetry affects the 
 rigidity properties of frameworks. We will introduce some of the important
  questions in the topic of symmetric rigidity\, and go through some of the
  answers.\n\n
UID:040000008200E00074C5B7101A82E00800000000EF5450EC8917DC01000000000000000
 01000000081C009E22E745D41A3BC19AE9D880494
SUMMARY:Alison La Porta (University of St Andrews): Rigidity for symmetric 
 frameworks
DTSTART;TZID=GMT Standard Time:20251002T160000
DTEND;TZID=GMT Standard Time:20251002T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Lecture Theatre D
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Model theory deals with first-order properties of mathematical 
 structures.  Roughly speaking\, this means properties that can be describe
 d by equations where we quantify over the elements of our structure (as op
 posed to\, say\, quantifying over the subsets).  It turns out that model t
 heory has a surprising amount to say about algebraic objects such as group
 s and rings.  I will discuss applications to some topics from group theory
  and Lie theory\, including representations of nilpotent groups and modula
 r Lie algebras\, geometric invariant theory and linear algebraic groups.  
 I won’t assume any prior knowledge of model theory.  Some of what I will
  talk about is joint work with Raf Cluckers\, Ehud Hrushovski\, Silvain Ri
 deau\, David Stewart\, Akaki Tikaradze and Lewis Topley (in various combin
 ations).\n
UID:040000008200E00074C5B7101A82E008000000006EEA140F5B0EDC01000000000000000
 010000000EB9F1E11C04B3E4CB44634A3956EE96F
SUMMARY:Ben Martin (University of Aberdeen): Some applications of model the
 ory to algebra
DTSTART;TZID=GMT Standard Time:20251009T160000
DTEND;TZID=GMT Standard Time:20251009T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Lecture Theatre D
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Despite the fact that both algebraically closed fields and rati
 onal functions in several variables can be introduced in a first undergrad
 uate algebra class\, the algebraic closure of $K(t_1\,...\,t_n)$ is surpri
 singly poorly understood.  In this talk I will discuss the state of the ar
 t\, including a new algebraically closed field containing $K(t_1\,...\,t_n
 )$ introduced recently in joint work with Gandini\, Hering\, Mohammadi\, R
 ajchgot\, Wheeler and Yu.  Our motivation\, as I will explain\, was to gen
 eralise a toric Bertini theorem of Fuchs\, Mantova\, and Zannier to positi
 ve characteristic.  One application of this is a Bertini theorem for tropi
 cal varieties.\n\n
UID:040000008200E00074C5B7101A82E00800000000B8B69D365B0EDC01000000000000000
 0100000001344B3881D8BA043A98A542F9CB58CF0
SUMMARY:Diane Maclagan (University of Warwick): Solving equations with poly
 nomial coefficients (with applications to toric and tropical geometry)
DTSTART;TZID=GMT Standard Time:20251016T160000
DTEND;TZID=GMT Standard Time:20251016T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Lecture Theatre D
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:I’ll survey some known results on diffeomorphism group of 3-m
 anifolds\, where there is a nice interplay between geometric group theory 
 and algebraic topology. There are various ways of decomposing a general 3-
 manifold into simpler pieces\, and I will recall these\, and discuss known
  consequences for the diffeomorphism groups. In the final minutes I’ll o
 utline some of my joint work with Corey Bregman and Jan Steinebrunner\, on
  the classifying space of the diffeomorphism group. I’ll talk more about
  this work at the Geometry seminar on 31 October.\n\n\n
UID:040000008200E00074C5B7101A82E00800000000BFC9294D5B0EDC01000000000000000
 0100000006D6C399B68B9A347B340651A3C5C3678
SUMMARY:Rachael Boyd (University of Glasgow): Symmetries of 3-manifolds
DTSTART;TZID=GMT Standard Time:20251030T160000
DTEND;TZID=GMT Standard Time:20251030T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Lecture Theatre D
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:People make mistakes. It has been more than a century since the
  first lists of maximal subgroups of various simple groups appear in print
 . Over the years many significant advancements have been made\, and we hav
 e a very good picture of the subgroup structure of simple groups. This has
  not always been straightforward though\, with a number of gaps and issues
  in the literature.\n\nI will chart the progress of this subject\, culmina
 ting in others' and my recent results\, and use it as a case study of the 
 concerns that should hold in the pure mathematics community about errors a
 nd how they are dealt with in the literature. The implications for GAIs wi
 ll also be considered.\n\n
UID:040000008200E00074C5B7101A82E00800000000F134916C5B0EDC01000000000000000
 010000000417C4802411A36418D1705B5F2AEE4ED
SUMMARY:David Craven (University of Birmingham): When Maths Goes Wrong: Sub
 groups of simple groups
DTSTART;TZID=GMT Standard Time:20251106T160000
DTEND;TZID=GMT Standard Time:20251106T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Lecture Theatre D
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:How do we tell the history of mathematics and why? In this talk
 \, I'll examine the way Felix Klein told the history of mathematics – in
  particular the history of negative numbers – in the first volume of his
  influential Elementary Mathematics from a Higher Standpoint (1908). This 
 much-read and much-loved book\, based on a lecture course\, aimed at bring
 ing research mathematics and school mathematics closer together\, partly b
 y drawing on the history of mathematics\; translated into English in 1932\
 , it had a significant impact on the teaching of mathematics in the 20th c
 entury. First\, I'll review 19th-century conceptions of what  negative (an
 d complex) numbers actually are\; in particular\, I'll discuss the emergen
 ce of ‘formal’ conceptions of them\, with particular reference to the 
 work of Hermann Hankel\, an important source of Klein's. I'll then turn to
  Klein's understanding and presentation of the history of mathematics\, es
 pecially of negative numbers and the calculus. I'll show that his historic
 al remarks were shaped both by his ideas on the ‘proper’ foundation of
  negative numbers and the calculus\, and by his specific pedagogical aims.
  More broadly\, I'll argue that Klein's case helps us understand the origi
 ns of some questionable clichés that remain prevalent in general historie
 s of mathematics\, such as the idea that the emergence of negative numbers
  in India came about through unrigorous formal manipulations.\n
UID:040000008200E00074C5B7101A82E00800000000F51ABAAB8917DC01000000000000000
 01000000021936ED54E3A104FBC6F8295D5E93DB8
SUMMARY:David Waszek (École Normale Supérieure): Felix Klein on the histo
 ry of negative numbers
DTSTART;TZID=GMT Standard Time:20251113T160000
DTEND;TZID=GMT Standard Time:20251113T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Lecture Theatre D
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:In this talk I shall present some recent joint work with Carl-F
 redrik Nyberg Brodda (KIAS\, Seoul)\, in which we study several natural de
 cision problems in braid groups and Artin groups. The subsemigroup members
 hip problem for a group asks whether one can decide whether a given elemen
 t of the group can be written as a product of some other finite set of ele
 ments of the group. In 2013\, Potapov studied this problem for the braid g
 roup $B_n$ showing in particular that the problem is decidable when $n \\l
 eq 3$ and undecidable when $n \\geq 5$. He left as an open problem the cas
 e of the four-strand braid group $B_4$. I will explain how we resolved thi
 s question for the braid group $B_4$ and how this then led us to prove a m
 ore general result that classifies the Artin groups with decidable subsemi
 group membership problem. I shall also discuss several other related resul
 ts\, and open questions\, about other algorithmic problems for braid and A
 rtin groups including the rational subset membership problem\, semigroup i
 ntersection problem\, and the identity problem.\n\n
UID:040000008200E00074C5B7101A82E00800000000A572CE1B2711DC01000000000000000
 010000000D099F74EED0B724899DD19A4798A8CBE
SUMMARY:Robert Gray (University of East Anglia): Membership problems in bra
 id groups and Artin groups
DTSTART;TZID=GMT Standard Time:20251120T160000
DTEND;TZID=GMT Standard Time:20251120T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Lecture Theatre D
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:I will talk about the mixing time which is the time it takes fo
 r a random walk to reach equilibrium. My focus will be on the cutoff pheno
 menon observed when the transition to equilibrium happens abruptly in time
 . I will survey the developments in the last 30 years and present a recent
  universality result for graphs with a random matching that was obtained i
 n collaboration with J. Hermon and A. Sly.\n\n
UID:040000008200E00074C5B7101A82E008000000002881F0AAFC22DC01000000000000000
 0100000006E0F3A6384F7054E86D8034AD5F62554
SUMMARY:Perla Sousi (University of Cambridge): The cutoff phenomenon for ra
 ndom walks
DTSTART;TZID=GMT Standard Time:20251127T160000
DTEND;TZID=GMT Standard Time:20251127T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Lecture Theatre D
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:A Latin square of order n is an n x n grid filled with n symbol
 s such that each symbol appears exactly once in each row and column. A (fu
 ll) transversal in a Latin square of order n is a collection of n cells su
 ch that each row\, column and symbol appears exactly once in the collectio
 n. Latin squares were introduced by Euler in the 1700s and he was interest
 ed in the question of when a Latin square decomposes fully into transversa
 ls. We'll discuss some of the history of this problem\, including some rec
 ent work decomposing random Latin squares into transversals. This is joint
  work with Richard Montgomery.\n
UID:040000008200E00074C5B7101A82E0080000000019B44BED3344DC01000000000000000
 0100000001CFB59AD8C489044B6B826FF81261B84
SUMMARY:Candida Bowtell (University of Birmingham): Decomposing Latin squar
 es into transversals
DTSTART;TZID=GMT Standard Time:20260129T160000
DTEND;TZID=GMT Standard Time:20260129T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Maths Lecture Theatre C
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:We will discuss the celebrated Torelli's theorem\, which states
  that a smooth (connected\, projective) curve can be reconstructed from it
 s Jacobian variety.  We will interpret this statement as injectivity of a 
 morphism \, the Torelli morphism\, from the moduli space of curves to the 
 moduli space of abelian varieties. Motivated by this\, in the last part of
  the talk we will discuss how this reconstruction works (and to which exte
 nt it fails) for stable curves (based on a result by Caporaso-Viviani and 
 a recent work in progress with Alex Abreu and Marco Pacini).\n
UID:040000008200E00074C5B7101A82E008000000005EF0C4203444DC01000000000000000
 0100000001915B86E1F5CF64D9B125DF9696346D0
SUMMARY:Nicola Pagani (University of Bologna): Torelli's theorem for smooth
  and stable curves
DTSTART;TZID=GMT Standard Time:20260205T160000
DTEND;TZID=GMT Standard Time:20260205T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Maths Lecture Theatre C
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:In this talk I will introduce the moduli space of stable curves
  and explain how to obtain interesting algebraic structures from it by dra
 wing pictures. Time permitting\, I will show where one can encounter these
  algebraic structures in the wild.\n
UID:040000008200E00074C5B7101A82E008000000006FC000F1C77FDC01000000000000000
 010000000C857D547E1B9244D878F011369005993
SUMMARY:Kai Hugtenburg (University of St Andrews): Field Theories and Frobe
 nius algebras
DTSTART;TZID=GMT Standard Time:20260212T160000
DTEND;TZID=GMT Standard Time:20260212T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Maths Lecture Theatre C
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:In the eighties Gromov introduced the notion of (Gromov-)hyperb
 olicity\, which is meant to capture the large-scale geometry of negatively
  curved Riemannian manifolds.  Since then\, this notion has been playing a
  central role in geometric group theory\, and it has countless application
 s. I will discuss a generalisation\, called hierarchical hyperbolicity\, t
 hat encompasses a lot more groups\, including mapping class groups of surf
 aces for instance. In particular\, I will explain what a hierarchically hy
 perbolic space looks like and present some applications.\n\n\n
UID:040000008200E00074C5B7101A82E00800000000FED72998184CDC01000000000000000
 010000000C44B34138387AC4CA96C081C74A2EE83
SUMMARY:Alessandro Sisto (Heriot-Watt University): An invitation to hierarc
 hical hyperbolicity
DTSTART;TZID=GMT Standard Time:20260219T160000
DTEND;TZID=GMT Standard Time:20260219T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Maths Lecture Theatre C
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Stable laws are a generalization  of the central limit theorem 
  for time-series of observables on dynamical systems. They  arise when a  
 scaling  n^{1/a}\, a \\in (0\,2) which is  larger than \\sqrt{n}  is neces
 sary  to give convergence in distribution of the Birkhoff sums.\nThe usual
  sqrt{n} scaling of Brownian motion corresponds to a=2. Stable laws arise 
 from two main mechanisms: the dynamical\nsystem is slowly mixing\;   or  t
 he observable  has  infinite variance. We give results on  the interplay o
 f  both mechanisms in two simple dynamical models\, intermittent\nmaps and
  polynomially mixing billiards.\nThis is a lecture given as part of Matt N
 icol's Leverhulme visiting professorship.\n\n
UID:040000008200E00074C5B7101A82E00800000000D2DDAC09C97FDC01000000000000000
 01000000099553B5AAD293E4586788E119D3FB141
SUMMARY:Matt Nicol (University of Houston): Stable laws for dynamical syste
 ms
DTSTART;TZID=GMT Standard Time:20260226T160000
DTEND;TZID=GMT Standard Time:20260226T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Maths Lecture Theatre C
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:An automaton (semi)group is a (semi)group generated by a finite
 -state\, letter-to-letter transducer. This way of generating (semi)groups 
 originates in group theory where the thus obtained groups show a rich beha
 vior and provide a source for groups with peculiar properties\, which make
 s them interesting as counterexamples to group-theoretic conjectures (with
  Grigorchuk’s group probably being the most prominent example as a group
  of intermediate growth). This rich behavior contrasts the finiteness of t
 he automaton and raises the general question of how the algebraic structur
 e of the generated (semi)group\nrelates to the structure of the generating
  automaton.\nOne way to approach this question is an algorithmic one: whic
 h of the properties of the generated (semi)group can be decided from a giv
 en automaton? With some (sometimes surprising) exceptions\, most sensible 
 properties turn out to be undecidable – even in the group case. The proo
 fs\, however\, are typically ad-hoc and far from trivial. In the talk\, we
  will look at the one to show that freeness cannot be decided in the monoi
 d (or semigroup) case. This is done via a (many-one co-)reduction from Pos
 t’s Correspondence Problem.\n\nThis is a joint result with D. D’Angeli
  and E. Rodaro.\n
UID:040000008200E00074C5B7101A82E00800000000C4E55379184CDC01000000000000000
 0100000005BF07C80C1517B4CB54EB8D616F90A71
SUMMARY:Jan Philipp Wächter (University of Manchester): The Freeness Probl
 em for Automaton Semigroups and Monoids
DTSTART;TZID=GMT Standard Time:20260312T160000
DTEND;TZID=GMT Standard Time:20260312T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Maths Lecture Theatre C
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:At the end of the 1980s\, globally coupled maps (GCMs) emerged 
 as high-dimensional models for complex systems. These models feature simpl
 e equations where several variables are coupled symmetrically all-to-all\,
  and display a rich variety of behaviors\, including synchronization\, pha
 se ordering\, and turbulence. Rigorous mathematical studies of the dynamic
 s of GCMs have primarily focused on their mean-field limit—that is\, the
  behavior of the system’s average state as the number of maps approaches
  infinity. This limit is governed by a nonlinear operator known as the sel
 f-consistent transfer operator\, which dictates the evolution of the mean 
 field. In this talk\, I will provide a brief overview of the origin of the
  study of self-consistent transfer operators and discuss some recent progr
 ess in the field focusing on coupled chaotic maps.\n\n
UID:040000008200E00074C5B7101A82E00800000000B49FC82EC87FDC01000000000000000
 010000000D09CEAC1E0E53F4E8788E5B754540A47
SUMMARY:Matteo Tanzi (King's College London): Coupled Chaotic Maps and Self
 -Consistent Transfer Operators
DTSTART;TZID=GMT Standard Time:20260319T160000
DTEND;TZID=GMT Standard Time:20260319T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Maths Lecture Theatre C
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:One of the central themes in the representation theory of finit
 e groups is to understand the relationship between the characters of a fin
 ite group G and those of its local subgroups. In particular\, Sylow branch
 ing coefficients describe how an irreducible character of G decomposes upo
 n restriction to a Sylow subgroup P of G\, and have been shown to characte
 rise group-theoretic properties such as the normality of P in G. After int
 roducing some of the broader context\, we will focus on the case of symmet
 ric groups.\n\n\n
UID:040000008200E00074C5B7101A82E008000000004D9D7A4D7E81DC01000000000000000
 010000000F07D15AFB78BA949820F4899F61C434E
SUMMARY:Stacey Law (University of Birmingham): Sylow restriction in the rep
 resentation theory of finite groups
DTSTART;TZID=GMT Standard Time:20260326T160000
DTEND;TZID=GMT Standard Time:20260326T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Maths Lecture Theatre C
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:In 1758\, Leonhard Euler made the following wonderful observati
 on: if you count the vertices\, edges\, and faces of a polyhedron with alt
 ernating signs\, you always get 2. Since then\, topologists have been fait
 hfully counting things with plus and minus signs to obtain new invariants.
 \nIn this talk\, we’ll discuss how homology is an algebraic upgrade of 
 “counting with signs\,” and how symplectic geometry can re-encode that
  data as intersections between curves on surfaces.\nFinally\, we’ll run 
 the story in reverse to derive the existence of periodic orbits in Hamilto
 nian dynamics using the machinery (Floer theory) we developed along the wa
 y.\n
UID:040000008200E00074C5B7101A82E008000000007C7F0847C87FDC01000000000000000
 0100000003C038F0E4B53DD4E9EDB470FF0B3BAA3
SUMMARY:Jeff Hicks (University of St Andrews): Counting like a Symplectic G
 eometer
DTSTART;TZID=GMT Standard Time:20260402T160000
DTEND;TZID=GMT Standard Time:20260402T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Maths Lecture Theatre B
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:We will start by describing basic large deviation results in th
 e setting of coin tossing. We will then show how this can be put in a dyna
 mical setting of the  shift space with a finite alphabet and suitable inva
 riant measures. We will then show how things can be different with a shift
  space with a countable alphabet. We will then describe how results can be
  obtained on this setting and how a concept of pressure at infinity plays 
 a role. The new results in the talk describe joint work with Godofremo Iom
 mi and Anibal Velozo.\n\n
UID:040000008200E00074C5B7101A82E008000000007EA4425CC87FDC01000000000000000
 010000000ED22B98A45E74948BF96676160E86706
SUMMARY:Thomas Jordan (University of Bristol): Large deviations and countab
 le Markov systems
DTSTART;TZID=GMT Standard Time:20260416T160000
DTEND;TZID=GMT Standard Time:20260416T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Maths Lecture Theatre C
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Given a geometric object (i.e. a Riemannian manifold\, group ac
 tion\, etc) it is usually possible to associate to it a function that reco
 rds natural `lengths' that appear in the geometry. For example\, the lengt
 h spectrum of a Riemannian manifold records the lengths of the closed geod
 esics (length minimising paths that form a loop) on the manifold. We are t
 hen led to ask whether this length function determines the geometry. That 
 is\, do two geometries with the same length function have to be the `same
 ’? In this talk we will discuss this question and related problems\; we
 ’ll see how to use techniques from various areas of maths to compare and
  understand length functions.\n\n
UID:040000008200E00074C5B7101A82E0080000000026049868C87FDC01000000000000000
 01000000034831C415A65FB4F8A6D89F181D9B175
SUMMARY:Steve Cantrell (University of St Andrews): Understanding geometries
  through length functions
DTSTART;TZID=GMT Standard Time:20260423T160000
DTEND;TZID=GMT Standard Time:20260423T170000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20260612T213415Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:Maths Lecture Theatre C
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
END:VCALENDAR