Fri, 22 Nov 2019

14:00 - 15:00
L1

Mathematics: the past, present and future - “Infecting by Numbers”

Prof. Christl Donnelly
Abstract

Outbreaks and epidemics from Ebola to influenza and measles are often in the news. Statistical analysis and modelling are frequently used to understand the transmission dynamics of epidemics as well as to inform and evaluate control measures, with real-time analysis being the most challenging but potentially most impactful. Examples will be drawn from diseases affecting both humans and animals.

Fri, 15 Nov 2019

14:00 - 15:00
L1

What's it like to do a DPhil/research?

Abstract

This week's Fridays@2 will be a panel discussion focusing on what it is like to pursue a research degree. The panel will share their thoughts and experiences in a question-and-answer session, discussing some of the practicalities of being a postgraduate student, and where a research degree might lead afterwards. Participants include:

Jono Chetwynd-Diggle (Smith Institute)

Victoria Patel (PDE CDT, Mathematical Institute)

Robin Thompson (Christ Church)

Rosemary Walmsley (DPhil student Health Economics Research Centre, Oxford) 

Fri, 08 Nov 2019

14:00 - 15:00
L1

Banish imposter feelings (and trust you belong!)

Maureen Freed and Ben Walker
Abstract

How can it be that so many clever, competent and capable people can feel that they are just one step away from being exposed as a complete fraud? Despite evidence that they are performing well they can still have that lurking fear that at any moment someone is going to tap them on the shoulder and say "We need to have a chat". If you've ever felt like this, or you feel like this right now, then this Friday@2 session might be of interest to you. We'll explore what "Imposter Feelings" are, why we get them and steps you can start to take to help yourself and others. This event is likely to be of interest to undergraduates and MSc students at all stages. 

Fri, 01 Nov 2019

14:00 - 15:00
L1

Where does collaborating end and plagiarising begin?

Dr Chris Hollings
Abstract

Despite the stereotype of the lone genius working by themselves, most professional mathematicians collaborate with others.  But when you're learning maths as a student, is it OK to work with other people, or is that cheating?  And if you're not used to collaborating with others, then you might feel shy about discussing your ideas when you're not confident about them.  In this session, we'll explore ways in which you can get the most out of collaborations with your fellow students, whilst avoiding inadvertently passing off other people's work as your own.  This session will be suitable for undergraduate and MSc students at any stage of their degree who would like to increase their confidence in collaboration.  Please bring a pen or pencil!

Fri, 25 Oct 2019

14:00 - 15:00
L1

What does a good maths solution look like?

Dr Vicky Neale
Abstract

In this interactive workshop, we'll discuss what mathematicians are looking for in written solutions.  How can you set out your ideas clearly, and what are the standard mathematical conventions?  Please bring a pen or pencil! 

This session is likely to be most relevant for first-year undergraduates, but all are welcome.

Fri, 18 Oct 2019

14:00 - 15:00
L1

Making the most of the intercollegiate classes

Dr Vicky Neale, Dr Richard Earl, Dr Neil Laws and George Cooper
Abstract

What should you expect in intercollegiate classes?  What can you do to get the most out of them?  In this session, experienced class tutors will share their thoughts, and a current student will offer tips and advice based on their experience.  

All undergraduate and masters students welcome, especially Part B and MSc students attending intercollegiate classes. (Students who attended the Part C/OMMS induction event will find significant overlap between the advice offered there and this session!)

Tue, 03 Dec 2019

14:00 - 15:00
L6

Characterisation of quasirandom permutations by a pattern sum

Yanitsa Pehova
(University of Warwick)
Further Information

We say that a sequence $\{\Pi_i\}$ of permutations is quasirandom if, for each $k\geq 2$ and each $\sigma\in S_k$, the probability that a uniformly chosen $k$-set of entries of $\Pi_i$ induces $\sigma$ tends to $1/k!$ as $i$ tends to infinity. It is known that a much weaker condition already forces $\{\Pi_i\}$ to be quasirandom; namely, if the above property holds for all $\sigma\in S_4$. We further weaken this condition by exhibiting sets $S\subseteq S_4$, such that if a randomly chosen $k$-set of entries of $\Pi_i$ induces an element of $S$ with probability tending to $|S|/24$, then $\{\Pi_i\}$ is quasirandom. Moreover, we are able to completely characterise the sets $S$ with this property. In particular, there are exactly ten such sets, the smallest of which has cardinality eight. 
This is joint work with Timothy Chan, Daniel Kráľ, Jon Noel, Maryam Sharifzadeh and Jan Volec.

Tue, 12 Nov 2019

14:00 - 15:00
L6

Partition universality of G(n,p) for degenerate graphs

Julia Boettcher
(London School of Economics)
Further Information

The r-​colour size-​Ramsey number of a graph G is the minimum number of edges of a graph H such that any r-​colouring of the edges of H has a monochromatic G-​copy. Random graphs play an important role in the study of size-​Ramsey numbers. Using random graphs, we establish a new bound on the size-​Ramsey number of D-​degenerate graphs with bounded maximum degree.

In the talk I will summarise what is known about size-​Ramsey numbers, explain the connection to random graphs and their so-​called partition universality, and outline which methods we use in our proof.

Based on joint work with Peter Allen.  
 

Tue, 05 Nov 2019

14:00 - 15:00
L6

Combinatorial discrepancy and a problem of J.E. Littlewood

Julian Sahasrabudhe
(University of Cambridge)
Further Information

Given a collection of subsets of a set X, the basic problem in combinatorial discrepancy theory is to find an assignment of 1,-1 to the elements of X so that the sums over each of the given sets is as small as possible. I will discuss how the sort of combinatorial reasoning used to think about problems in combinatorial discrepancy can be used to solve an old conjecture of J.E. Littlewood on the existence of ``flat Littlewood polynomials''.

This talk is based on joint work with Paul Balister, Bela Bollobas, Rob Morris and Marius Tiba.
 

Tue, 29 Oct 2019

14:00 - 15:00
L6

Covering random graphs by monochromatic subgraphs, and related results

Daniel Korandi
(University of Oxford)
Further Information

How many monochromatic paths, cycles or general trees does one need to cover all vertices of a given r-edge-colored graph G? Such questions go back to the 1960's and have been studied intensively in the past 50 years. In this talk, I will discuss what we know when G is the random graph G(n,p). The problem turns out to be related to the following question of Erdős, Hajnal and Tuza: What is the largest possible cover number of an r-uniform hypergraph where any k edges have a cover of size l.

The results I mention give new bounds for these problems, and answer some questions by Bal and DeBiasio, and others. The talk is based on collaborations with Bucić, Mousset, Nenadov, Škorić and Sudakov.

Subscribe to