We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.

Durham University

Research & business

Research lectures, seminars and events

The events listed in this area are research seminars, workshops and lectures hosted by Durham University departments and research institutes. If you are not a member of the University, but  wish to enquire about attending one of the events please contact the organiser or host department.


December 2019
November 2019 January 2020
1 2 3 4 5 6 7
8 9 10 11 12 13 14
15 16 17 18 19 20 21
22 23 24 25 26 27 28
29 30 31

Events for 10 December 2019

Netan Dogra: Wieferich statistics, p-adic integrals and rational points on curves.

1:00pm, CM219

A Wieferich prime is a prime number p such that 2^(p-1) is congruent to 1 modulo p^2. These numbers originally arose in the context of Fermat's last theorem. At present very little is known about them, although there are some conjectures. One can analogously define Wieferich primes for 3, or 5, or for a point on an abelian variety. In this talk I will explain what Wieferich primes for abelian varieties have to do with p-adic integrals and rational points on curves, and will also describe some (unconditional) results on the heights of rational points on higher genus curves.

Contact, for more information about this event.

Robert Segal: Myth for the Twenty-First century: Winnicott applied to myth

1:00pm, Seminar Room C (D/TH107), Dept. of Theology & Religion, Abbey House, DH1 3RS, Durham

Contact, for more information about this event.

Petra Berenbrink: Optimal Time and Space Leader Election in Population Protocols

1:00pm, E245

Population protocols are a model of distributed computing, where n agents with limited computational power and memory interact randomly, in order to jointly perform a global task. A fundamental problem in this setting is that of leader election, where all agents start from the same state, and they seek to reach and maintain a global state where exactly one agent is in a dedicated leader state. We establish that if agents have Omega(\log\log n) states, the expected time complexity of leader election is Theta(n \log n). Unlike existing protocols, ours does not decrease the set of candidate leaders monotonically. Our protocol has both optimal time and space complexity. Joint work with George Giakkoupis and Peter Kling

Contact for more information about this event.

Dr Anna Rowlands: Pius XII's Christmas Messages

5:30pm, Ushaw

Contact for more information about this event.