I'll be talking about my masters' research in Quantum Gravity in a way that is accessible to mathematicians.

In a recent breakthrough, Peter Keevash proved the Existence conjecture for combinatorial designs, which has its roots in the 19th century. In joint work with Daniela Kühn, Allan Lo and Deryk Osthus, we gave a new proof of this result, based on the method of iterative absorption. In fact, `regularity boosting’ allows us to extend our main decomposition result beyond the quasirandom setting and thus to generalise the results of Keevash. In particular, we obtain a resilience version and a minimum degree version. In this talk, we will present our new results within a brief outline of the history of the Existence conjecture and provide an overview of the proof.

In this talk I will present some answers to the question when every specialisation from a \kappa-saturated extension of 
a Zariski structure is \kappa-universal? I will show that for algebraically closed fields, all specialisations from a \kappa-
saturated extension is \kappa-universal. More importantly, I will consider this question for finite and infinite covers of
Zariski structures. In these cases I will present a counterexample to show that there are covers of Zariski structures 
which have specialisations from a \kappa-saturated extension that are not \kappa-universal. I will present some natural 
conditions on the fibres under which all specialisations from a \kappa-saturated extension of a cover is \kappa-universal. 
I will explain how this work points towards a prospective Ladder Theorem for Specialisations and explain difficulties and 
further works that needs to be considered.
 

Data science: The secret to unlocking operational performance within the UK’s largest retail supply chain

Chris Reddick was instrumental in setting up the InFoMM CDT. After helping secure the EPSRC funding he chaired the Industrial Engagement Committee and supported the CDT in all its Industrial relations. The success of the CDT, as evidenced by the current size of the industrial partnership and the vibrant programme we have developed, is in no small part due to Chris' charm, vision, and tenacity.

The Thue-Morse sequence is perhaps the simplest example of an automatic sequence. Various pseudorandomness properties of this sequence have long been studied. During the talk, I will discuss a new result in this direction, asserting that the Gowers uniformity norms of the Thue-Morse sequence are small in a quantitative sense. Similar results hold for the Rudin-Shapiro sequence, as well as for a much wider class of automatic sequences which will be introduced during the talk.

The talk is partially based on joint work with Jakub Byszewski.