I will describe recent progress in describing 4-dimensional N = 8 supergravity using the framework of ambitwistor string theory.
A booklet about networks literacy developed by Mason Porter, Fellow of Somerville College and Professor of Nonlinear and Complex Systems in the University of Oxford's Mathematical Institute, in collaboration with colleagues from the USA, could help people understand all types of networks from social media to rabbit warrens. Mason was part of a team of over 30 network-science researchers, educators, teachers, and students who have written the booklet on networks literacy that schools can adapt to teach students the core concepts about networks.
For full details please visit:
http://blogs.bodleian.ox.ac.uk/adalovelace/files/2015/10/Ada-Lovelace-S…
This talk describes a graphics processing unit (GPU) implementation of the Filtered Lanczos Procedure for the solution of large, sparse, symmetric eigenvalue problems. The Filtered Lanczos Procedure uses a carefully chosen polynomial spectral transformation to accelerate the convergence of the Lanczos method when computing eigenvalues within a desired interval. This method has proven particularly effective when matrix-vector products can be performed efficiently in parallel. We illustrate, via example, that the Filtered Lanczos Procedure implemented on a GPU can greatly accelerate eigenvalue computations for certain classes of symmetric matrices common in electronic structure calculations and graph theory. Comparisons against previously published CPU results suggest a typical speedup of at least a factor of $10$.
Starting from Hilbert's 10th problem, I will explain how to characterise the set of integers by non-solubility of a set of polynomial equations and discuss related challenges. The methods needed are almost entirely elementary; ingredients from algebraic number theory will be explained as we go along. No knowledge of first-order logic is necessary.
