University of Oxford

Johann Sebastian Bach was the most mathematical of composers. Oxford Mathematician and Cambridge organ scholar James Sparks will explain just how mathematical and City of London Sinfonia will elaborate with a special performance of the Goldberg Variations. 

---

James Sparks - Bach and the Cosmos (30 minutes)

City of London Sinfonia - J S Bach arr. Sitkovetsky, Goldberg Variations (70 minutes)

Alexandra Wood - Director/Violin

--

Please email @email to register

Watch live:
https://www.facebook.com/OxfordMathematics
https://www.livestream.com/oxuni/Bach-Cosmos

The Oxford Mathematics Public Lectures are generously supported by XTX Markets

Thompson's group F is a group of homeomorphisms of the unit interval which exhibits a strange mix of properties; on the one hand it has some self-similarity type properties one might expect of a really big group, but on the other hand it is finitely presented. I will give a proof of finite generation by expressing elements as pairs of binary trees.

With topics ranging from prime numbers to the lottery, from lemmings to bending balls like Beckham, Professor Marcus du Sautoy will provide an entertaining and, perhaps, unexpected approach to explain how mathematics can be used to predict the future. 

We are delighted to announce our first Oxford Mathematics Midlands Public Lecture to take place at Solihull School on 9th January 2019. 

Please email @email to register

Watch live:
https://facebook.com/OxfordMathematics
https://livestream.com/oxuni/du-Sautoy

We are very grateful to Solihull School for hosting this lecture.

The Oxford Mathematics Public Lectures are generously supported by XTX Markets.

tba

Over the past decade, the randomized singular value decomposition (RSVD)
algorithm has proven to be an efficient, reliable alternative to classical
algorithms for computing low-rank approximations in a number of applications.
However, in cases where no information is available on the singular value
decay of the data matrix or the data matrix is known to be close to full-rank,
the RSVD is ineffective. In recent years, there has been great interest in
randomized algorithms for computing full factorizations that excel in this
regime.  In this talk, we will give a brief overview of some key ideas in
randomized numerical linear algebra and introduce a new randomized algorithm for
computing a full, rank-revealing URV factorization.

Several scholars of evolutionary biology have suggested that functional redundancy (also known as "biological degener-
acy") is important for robustness of biological networks. Structural redundancy indicates the existence of structurally
similar subsystems that can perform the same function. Functional redundancy indicates the existence of structurally
di erent subsystems that can perform the same function. For networks with Ornstein--Uhlenbeck dynamics, Tononi et al.
[Proc. Natl. Acad. Sci. U.S.A. 96, 3257{3262 (1999)] proposed measures of structural and functional redundancy that are
based on mutual information between subnetworks. For a network of n vertices, an exact computation of these quantities
requires O(n!) time. We derive expansions for these measures that one can compute in O(n3) time. We use the expan-
sions to compare the contributions of di erent types of motifs to a network's functional redundancy.

TBA