Alan is the Head of Counselling at the University of Oxford. He will talk about the importance of managing expectations and not having rigid expectations, about challenging perfectionism, and about building emotional resilience through adaptability and compassion.
In July 2011, the observation of a massive phytoplankton bloom underneath a sea ice–covered region of the Chukchi Sea shifted the scientific consensus that regions of the Arctic Ocean covered by sea ice were inhospitable to photosynthetic life. Although the impact of widespread phytoplankton blooms under sea ice on Arctic Ocean ecology and carbon fixation is potentially marked, the prevalence of these events in the modern Arctic and in the recent past is, to date, unknown. We investigate the timing, frequency, and evolution of these events over the past 30 years. Although sea ice strongly attenuates solar radiation, it has thinned significantly over the past 30 years. The thinner summertime Arctic sea ice is increasingly covered in melt ponds, which permit more light penetration than bare or snow-covered ice. We develop a simple mathematical model to investigate these physical mechanisms. Our model results indicate that the recent thinning of Arctic sea ice is the main cause of a marked increase in the prevalence of light conditions conducive to sub-ice blooms. We find that as little as 20 years ago, the conditions required for sub-ice blooms may have been uncommon, but their frequency has increased to the point that nearly 30% of the ice-covered Arctic Ocean in July permits sub-ice blooms. Recent climate change may have markedly altered the ecology of the Arctic Ocean.
All data intelligence processes are designed for processing a finite amount of data within a time period. In practice, they all encounter
some difficulties, such as the lack of adequate techniques for extracting meaningful information from raw data; incomplete, incorrect
or noisy data; biases encoded in computer algorithms or biases of human analysts; lack of computational resources or human resources; urgency in
making a decision; and so on. While there is a great enthusiasm to develop automated data intelligence processes, it is also known that
many of such processes may suffer from the phenomenon of data processing inequality, which places a fundamental doubt on the credibility of these
processes. In this talk, the speaker will discuss the recent development of an information-theoretic measure (by Chen and Golan) for optimizing
the cost-benefit ratio of a data intelligence process, and will illustrate its applicability using examples of data analysis and
visualization processes including some in bioinformatics.
I will talk about a recent proof, joint with M. Gröchenig and D. Wyss, of a conjecture of Hausel and Thaddeus which predicts the equality of suitably defined Hodge numbers of moduli spaces of Higgs bundles with SL(n)- and PGL(n)-structure. The proof, inspired by an argument of Batyrev, proceeds by comparing the number of points of these moduli spaces over finite fields via p-adic integration. I will start with an introduction to Higgs bundles and their moduli spaces and then explain our argument.
Liquid crystals are classical examples of mesophases or materials that are intermediate in character between conventional solids and liquids. There are different classes of liquid crystals and we focus on the simplest and most widely used nematic liquid crystals. Nematic liquid crystals are simply put, anisotropic liquids with distinguished directions and are the working material of choice for the multi-billion dollar liquid crystal display industry. In this workshop, we briefly review the mathematical theories for nematic liquid crystals, the modelling framework and some recent work on modelling experiments on confined liquid crystalline systems conducted by the Aarts Group (Chemistry Oxford) and experiments on nematic microfluidics by Anupam Sengupta (ETH Zurich). This is joint work with Alexander Lewis, Peter Howell, Dirk Aarts, Ian Griffiths, Maria Crespo Moya and Angel Ramos.
We conclude with a brief overview of new experiments on smectic liquid crystals in the Aarts laboratory and questions related to the recycling of liquid crystal displays originating from informal discussions with Votechnik ( a company dealing with automated recycling technologies , http://votechnik.com/).
Networks of interacting oscillators give rise to collective dynamics such as localized frequency synchrony. In networks of neuronal oscillators, for example, the location of frequency synchrony could encode information. We discuss some recent persistence results for certain dynamically invariant sets called weak chimeras, which show localized frequency synchrony of oscillators. We then explore how the network structure and interaction allows for dynamic switching of the spatial location of frequency synchrony: these dynamics are induced by stable heteroclinic connections between weak chimeras. Part of this work is joined with Peter Ashwin (Exeter).
This concerns recent work with P. Corvaja in which we relate the Hilbert Property for an algebraic variety (a kind of axiom linked with Hilbert Irreducibility, relevant e.g. for the Inverse Galois Problem) with the fundamental group of the variety.
In particular, this leads to new examples (of surfaces) of failure of the Hilbert Property. We also prove the Hilbert Property for a non-rational surface (whereas all previous examples involved rational varieties).
We consider rough stochastic volatility models where the driving noise of volatility has fractional scaling, in the “rough” regime of Hurst pa- rameter H < 1/2. This regime recently attracted a lot of attention both from the statistical and option pricing point of view. With focus on the latter, we sharpen the large deviation results of Forde-Zhang (2017) in a way that allows us to zoom-in around the money while maintaining full analytical tractability. More precisely, this amounts to proving higher order moderate deviation es- timates, only recently introduced in the option pricing context. This in turn allows us to push the applicability range of known at-the-money skew approxi- mation formulae from CLT type log-moneyness deviations of order t1/2 (recent works of Alo`s, Le ́on & Vives and Fukasawa) to the wider moderate deviations regime.
This is work in collaboration with C. Bayer, P. Friz, A. Gulsashvili and B. Stemper
This concerns recent work with P. Corvaja in which we relate the Hilbert Property for an algebraic variety (a kind of axiom linked with Hilbert Irreducibility, relevant e.g. for the Inverse Galois Problem) with the fundamental group of the variety.
In particular, this leads to new examples (of surfaces) of failure of the Hilbert Property. We also prove the Hilbert Property for a non-rational surface (whereas all previous examples involved rational varieties).
Abstract: We study nonuniform sampling in shift-invariant spaces whose generator is a totally positive function. For a subclass of such generators the sampling theorems can be formulated in analogy to the theorems of Beurling and Landau for bandlimited functions. These results are optimal and validate the heuristic reasonings in the engineering literature. In contrast to the cardinal series, the reconstruction procedures for sampling in a shift-invariant space with a totally positive generator are local and thus accessible to numerical linear algebra.
A subtle connection between sampling in shift-invariant spaces and the theory of Gabor frames leads to new and optimal results for Gabor frames. We show that the set of phase-space shifts of $g$ (totally positive with a Gaussian part) with respect to a rectangular lattice forms a frame, if and only if the density of the lattice is strictly larger than 1. This solves an open problem going backto Daubechies in 1990 for the class of totally positive functions of Gaussian type.
I will discuss the specific long-time behaviour of kinetic solutions to stochastic conservation laws with non-linear multiplicative noises.
.. showing that a field K is isomorphic to Q if it has the same absolute Galois group and if it satisfies a very small additional condition (very similar to my talk 2 years ago).
Abstract: The Kontsevich graph weights are period integrals whose
values make Kontsevich's star-product associative for any Poisson
structure. We illustrate, by using software, to what extent these
weights are determined by their properties: the associativity
constraint for the star-product (for all Poisson structures), the
multiplicativity (decomposition into prime graphs), the cyclic
relations, and some relations due to skew-symmetry. Up to the order 4
in ℏ we express all the weights in terms of 10 parameters (6
parameters modulo gauge-equivalence), and we verify pictorially that
the star-product expansion is associative modulo ō(ℏ⁴) for every value
of the 10 parameters. This is joint work with Arthemy Kiselev.
In this talk, I’ll share the progress that we have made in the field of e-voting, including the proposal of a new paradigm of e-voting system called self-enforcing e-voting (SEEV). A SEEV system is End-to-End (E2E) verifiable, but it differs from all previous E2E systems in that it does not require tallying authorities. The removal of tallying authorities significantly simplifies the election management and makes the system much more practical than before. A prototype of a SEEV system based on the DRE-i protocol (Hao et al. USENIX JETS 2014) has been built and used regularly in Newcastle University for classroom voting and student prize competitions with very positive student feedback. Lessons from our experience of designing, analysing and deploying an e-voting system for real-world applications are also presented.
Let $A$ denote either the automorphism group of the free group of rank $n$ or the mapping class group of an orientable surface of genus $n$ with at most 1 boundary component, and let $G$ be either the subgroup of IA-automorphisms or the Torelli subgroup of $A$, respectively. I will discuss various finiteness properties of subgroups containing $G_N$, the $N$-th term of the lower central series of $G$, for sufficiently small $N$. In particular, I will explain why
(1) If $n \geq 4N-1$, then any subgroup of G containing $G_N$ (e.g. the $N$-th term of the Johnson filtration) is finitely generated
(2) If $n \geq 8N-3$, then any finite index subgroup of $A$ containing $G_N$ has finite abelianization.
The talk will be based on a joint work with Sue He and a joint work with Tom Church and Andrew Putman
Deficiency is a measure of how complicated the presentations of a particular group need to be; it is defined as the maximum of the number of generators minus the number of relators (over all finite presentations of the group). This talk will introduce the basics of deficiency, give a deft example of Swan which illustrates why our understanding of deficiency is deficient, and conclude with some new examples that defy this defeatism: finite $p$-groups can have any deficiency you could (reasonably) wish for.
The $r$-neighbour bootstrap process on a graph $G$ starts with an initial set of "infected" vertices and, at each step of the process, a healthy vertex becomes infected if it has at least $r$ infected neighbours (once a vertex becomes infected, it remains infected forever). If every vertex of $G$ becomes infected during the process, then we say that the initial set percolates.
In this talk I will discuss the proof of a conjecture of Balogh and Bollobás: for fixed $r$ and $d\to\infty$, the minimum cardinality of a percolating set in the $d$-dimensional hypercube is $\frac{1+o(1)}{r}\binom{d}{r-1}$. One of the key ideas behind the proof exploits a connection between bootstrap percolation and weak saturation. This is joint work with Jonathan Noel.
Let G be a split reductive group over a finite extension k of Q_p. Reeder and Yu have given a new construction of supercuspidal representations of G(k) using geometric invariant theory. Their construction is uniform for all p but requires as input stable vectors in certain representations coming from Moy-Prasad filtrations. In joint work, Jessica Fintzen and I have classified the representations of this kind which contain stable vectors; as a corollary, the construction of Reeder-Yu gives new representations when p is small. In my talk, I will give an overview of this work, as well as explicit examples for the case when G = G_2. For these examples, I will explicitly describe the locus of all stable vectors, as well as the Langlands parameters which correspond under the local Langlands correspondence to the representations of G(k).
The past few years have seen a surge of interest in nonconvex reformulations of convex optimizations using nonlinear reparameterizations of the optimization variables. Compared with the convex formulations, the nonconvex ones typically involve many fewer variables, allowing them to scale to scenarios with millions of variables. However, one pays the price of solving nonconvex optimizations to global optimality, which is generally believed to be impossible. In this talk, I will characterize the nonconvex geometries of several low-rank matrix optimizations. In particular, I will argue that under reasonable assumptions, each critical point of the nonconvex problems either corresponds to the global optimum of the original convex optimizations, or is a strict saddle point where the Hessian matrix has a negative eigenvalue. Such a geometric structure ensures that many local search algorithms can converge to the global optimum with random initializations. Our analysis is based on studying how the convex geometries are transformed under nonlinear parameterizations.
I will give an overview of the complexes used in algebraic topology using the language of abstract complexes.
This is a lunch seminar, so feel free to bring your lunch along!
In this presentation, we give an overview of the numerical methods used in commercial oil and gas reservoir simulation. The models are described by flow through porous media and are solved using a series of nested numerical methods. Most of the computational effort resides in solving large linear systems resulting from Newton iterations. Therefore, we will go in greater detail about the iterative linear solvers and preconditioning techniques.
Note: This talk will cover similar topics to the InFoMM group meeting talks on Friday 28th April, but I will discuss more mathematical details for this JAMS talk.