Join Oxford University Lifesaving Club at the Rosenblatt Pool, Iffley Road Sports Centre, for LIFESAVING CUPPERS on Sunday 8th February, 4-6 pm. Compete for your college or for the department.
The Academy for the Mathematical Sciences has announced its first cohort of fellows, 100 in total from across academia and teaching, science communication and business. Twelve of those fellows are from Oxford, spread across four departments, reflecting the reach and importance of mathematics.
17:00
Rhythmicity and Coordination: The Importance of Circadian and Seasonal Biology - Russell Foster
Biology is not constant but highly rhythmic. This includes the fast rhythms of action potentials in the nervous system and the pulsatile release of hormones. At a longer time-scale are the daily (circadian) rhythms and annual rhythms observed across much of the biological world. This talk will consider the mechanisms and importance of circadian rhythms to human health and the role of seasonal timing in reproduction and other phenomena in birds, mammals and humans. In biology, like the rest of science, timing is everything.
Russell Foster is Professor of Circadian Neuroscience and the Head of the Nuffield Laboratory of Ophthalmology in Oxford. He has featured widely in print and broadcast media on the subject of sleep and circadian rhythms and is the author of several popular books on the subject.
Please email external-relations@ maths.ox.ac.uk to register to attend in person.
The lecture will be broadcast on the Oxford Mathematics YouTube Channel on Thursday 5 March at 5-6 pm and any time after (no need to register for the online version).
The Oxford Mathematics Public Lectures are generously supported by XTX Markets.
Rainbow subgraphs of star-coloured graphs
Abstract
An edge-colouring of a graph $G$ can fail to be rainbow for two reasons: either it contains a monochromatic cherry (a pair of incident edges), or a monochromatic matching of size two. A colouring is a proper colouring if it forbids the first structure, and a star-colouring if it forbids the second structure. I will talk about the problem of determining the maximum number of colours in a star-colouring of a large complete graph which does not contain a rainbow copy of a given graph $H$. This problem is a special case of one studied by Axenovich and Iverson on generalised Ramsey numbers.
Joint work with Allan Lo, Klas Markström, Dhruv Mubayi, Maya Stein and Lea Weber.