BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Peter Kropholler (University of Southampton)
DTSTART:20200603T100000Z
DTEND:20200603T110000Z
DTSTAMP:20260422T225755Z
UID:CANTA/1
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CANTA/1/">Am
 enable groups and Noetherian group rings</a>\nby Peter Kropholler (Univers
 ity of Southampton) as part of Royal Holloway CANTA-Launch\n\n\nAbstract\n
 In joint work with Karl Lorensen and Dawid Kielak\, we study an old questi
 on of Reinhold Baer\nwhich dates back to around 1960.\nwhich are the group
 s such that the integral group ring is Noetherian. We shall see\nthat as w
 ell satisfying the maximal condition on subgroups (which Baer knew)\, they
 \nalso must be amenable. This then connects the question to some interesti
 ng\nBurnside groups constructed by Ivanov and Olshanskii.\n \nI love this 
 topic because it touches on two important and apparently very\ndifferent t
 hings in 20th century mathematics: the Banach-Tarski paradox and\nthe root
 s of non-commutative algebraic geometry.\n
LOCATION:https://researchseminars.org/talk/CANTA/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Leo Ducas (CWI Amsterdam)
DTSTART:20200603T150000Z
DTEND:20200603T160000Z
DTSTAMP:20260422T225755Z
UID:CANTA/2
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CANTA/2/">An
  Algorithmic Reduction Theory for Binary Codes</a>\nby Leo Ducas (CWI Amst
 erdam) as part of Royal Holloway CANTA-Launch\n\n\nAbstract\nJoint work (i
 n Progress) with\nThomas Debris-Alazard and Wessel van Woerden\n\nLattice 
 reduction is the task of finding a basis of short and somewhat orthogonal 
 vectors of a given lattice. In 1985 Lenstra\, Lenstra and Lovasz proposed 
 a polynomial time algorithm for this task\, with an application to factori
 ng rational polynomials. Since then\, the LLL algorithm has found countles
 s application in algorithmic number theory and in cryptanalysis.\n\nThere 
 are many analogies to be drawn between Euclidean lattices and linear codes
  over finite fields. In this work\, we propose to extend the range of thes
 e analogies by considering the task of reducing the basis of a binary code
 . In fact\, all it takes is to choose the adequate notion mimicking Euclid
 ean orthogonality (namely orthopodality)\, after which\, all the required 
 notions\, arguments\, and algorithms unfold before us\, in quasi-perfect a
 nalogy with lattices.\n
LOCATION:https://researchseminars.org/talk/CANTA/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Lillian Pierce (Duke University)
DTSTART:20200611T150000Z
DTEND:20200611T160000Z
DTSTAMP:20260422T225755Z
UID:CANTA/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CANTA/3/">On
  some open questions in number theory: from the perspective of moments</a>
 \nby Lillian Pierce (Duke University) as part of Royal Holloway CANTA-Laun
 ch\n\n\nAbstract\nMany questions in number theory can be phrased loosely i
 n the following terms: “how often can this function take large values?
 ” We will talk about some open questions in number theory where we want 
 to show that the answer is “never.” In particular\, we will discuss so
 me interesting situations where we can upgrade information that a function
  “rarely takes large values” to information that it “never takes lar
 ge values.” This perspective allows us to see some new connections betwe
 en open conjectures in number theory.\n
LOCATION:https://researchseminars.org/talk/CANTA/3/
END:VEVENT
END:VCALENDAR