University of Cambridge > Talks.cam > The Archimedeans (CU Mathematical Society)

The Archimedeans (CU Mathematical Society)

Add to your list(s) Send you e-mail reminders Further detail
Subscribe using ical/vcal (Help)

The talks are provided by The Archimedeans (CU Mathematical Society). We arrange 6/7 Speaker Meetings per term, where distinguished academics from around the UK, and occasionally abroad, come to talk to us. All our talks are suitable for for first year undergraduates, so will be accessible to anybody with an interest in Mathematics.

Speaker Meetings usually occur on Friday evenings. There is a small charge to non-members. For more details see our website www.archim.org.uk .

Tell a friend about this list:

If you have a question about this list, please contact: Valentin Hübner. If you have a question about a specific talk, click on that talk to find its organiser.

6 upcoming talks and 90 talks in the archive.

Mathematics of Turbulent Flows: A Million Dollars Problem!

UserEdriss S. Titi (University of Cambridge).

HouseMR2, Centre for Mathematical Sciences.

ClockFriday 18 October 2019, 19:00-20:00

The classification of black holes

UserDr Harvey Reall ( DAMTP).

HouseMR2, Centre for Mathematical Sciences.

ClockFriday 25 October 2019, 19:00-20:00

Schrödinger and his Equation

UserSir David Clary FRS (University of Oxford).

HouseMR2, Centre for Mathematical Sciences.

ClockFriday 01 November 2019, 19:00-20:00

Handles and Homotopies

UserJake Rasmussen (Cambridge).

HouseMR2, Centre for Mathematical Sciences.

ClockFriday 08 November 2019, 19:00-20:00

The Limits of Symmetric Computation

UserAnuj Dawar (University of Cambridge).

HouseMR2, Centre for Mathematical Sciences.

ClockFriday 22 November 2019, 19:00-20:00

Some elements of algebraic geometry

UserCaucher Birkar (University of Cambridge).

HouseMR2, Centre for Mathematical Sciences.

ClockMonday 02 December 2019, 19:00-20:00

Please see above for contact details for this list.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity