Past

Multiple zeta values are generalizations of the special values of Riemann's zeta function at positive integers. They satisfy a large number of algebraic relations some of which were already known to Euler. More recently, the interpretation of multiple zeta values as periods of mixed Tate motives has led to important new results. However, this interpretation seems insufficient to explain the occurrence of several phenomena related to modular forms.

The aim of this talk is to describe an analog of multiple zeta values for complex elliptic curves introduced by Enriquez. We will see that these define holomorphic functions on the upper half-plane which degenerate to multiple zeta values at cusps. If time permits, we will explain how some of the rather mysterious modular phenomena pertaining to multiple zeta values can be interpreted directly via the algebraic structure of their elliptic analogs.

We analyse the consequences of conservative portfolio compression, i.e., netting cycles in financial networks, on systemic risk.  We show that the recovery rate in case of default plays a significant role in determining whether portfolio compression is potentially beneficial.  If recovery rates of defaulting nodes are zero then compression weakly reduces systemic risk. We also provide a necessary condition under which compression strongly reduces systemic risk.  If recovery rates are positive we show that whether compression is potentially beneficial or harmful for individual institutions does not just depend on the network itself but on quantities outside the network as well. In particular we show that  portfolio compression can have negative effects both for institutions that are part of the compression cycle and for those that are not. Furthermore, we show that while a given conservative compression might be beneficial for some shocks it might be detrimental for others. In particular, the distribution of the shock over the network matters and not just its size.  

Accurate simulation of electromagnetic scattering by ice crystals in clouds is an important problem in atmospheric physics, with single scattering results feeding directly into the radiative transfer models used to predict long-term climate behaviour. The problem is challenging for numerical simulation methods because the ice crystals in a given cloud can be extremely varied in size and shape, sometimes exhibiting fractal-like geometrical characteristics and sometimes being many hundreds or thousands of wavelengths in diameter. In this talk I will focus on the latter "high-frequency" issue, describing a hybrid numerical-asymptotic boundary element method for the simplified problem of acoustic scattering by penetrable convex polygons, where high frequency asymptotic information is used to build a numerical approximation space capable of achieving fixed accuracy of approximation with frequency-independent computational cost. 

It is shown by Kashiwara and Schapira (1980s) that for every constructible sheaf on a smooth manifold, one can construct a closed conic Lagrangian subset of its cotangent bundle, called the microsupport of the sheaf. This eventually led to the equivalence of the category of constructible sheaves on a manifold and the Fukaya category of its cotangent bundle by the work of Nadler and Zaslow (2006), and Ganatra, Pardon, and Shende (2018) for partially wrapped Fukaya categories. One can try to generalise this and conjecture that Fukaya category of a Weinstein manifold can be given by constructible (microlocal) sheaves associated to its skeleton. In this talk, I will explain these concepts and confirm the conjecture for a family of Weinstein manifolds which are certain quotients of A_n-Milnor fibres. I will outline the computation of their wrapped Fukaya categories and microlocal sheaves on their skeleta, called pinwheels.

Just like optimization needs derivatives, shape optimization needs shape derivatives. Their definition and computation is a classical subject, at least concerning first order shape derivatives. Second derivatives have been studied as well, but some aspects of their theory still remains a bit mysterious for practitioners. As a result, most algorithms for shape optimization are first order methods.

To understand this situation better and in a general way, we consider first and second order shape sensitivities of integrals on smooth submanifolds using a variant of shape differentiation. Instead of computing the second derivative as the derivative of the first derivative, we choose a one-parameter family of perturbations  and compute first and second derivatives with respect to that parameter. The result is a  quadratic form in terms of a perturbation vector field that yields a second order quadratic model of the perturbed functional, which can be used as the basis of a second order shape optimization algorithm. We discuss the structure of this derivative, derive domain expressions and Hadamard forms in a general geometric framework, and give a detailed geometric interpretation of the arising terms.

Finally, we use our results to construct a second order SQP-algorithm for shape optimization that exhibits indeed local fast convergence.

In this talk I will illustrate how solutions of nonlinear nonlocal Fokker-Planck equations in a bounded domain with no-flux boundary conditions can be approximated by Cauchy problems with increasingly strong confining potentials defined outside such domain. Two different approaches are analysed, making crucial use of uniform estimates for energy and entropy functionals respectively. In both cases we prove that the problem in a bounded domain can be seen as a limit problem in the whole space involving a suitably chosen sequence of large confining potentials.
This is joint work with Maria Bruna and José Antonio Carrillo.
 

Traditionally, logic was thought of as `principles of right reason'. Early twentieth century philosophy of mathematics focused on the problem of a general foundation for all mathematics. In contrast, the last 70 years have seen model theory develop as the study and comparison of formal theories for studying specific areas of mathematics. While this shift began in work of Tarski, Robinson, Henkin, Vaught, and Morley, the decisive step came with Shelah's stability theory. After this paradigm shift there is a systematic search for a short set of syntactic conditions which divide first order theories into disjoint classes such that models of different theories in the same class have similar mathematical properties. This classification of theories makes more precise the idea of a `tame structure'. Thus, logic (specifically model theory) becomes a tool for organizing and doing mathematics with consequences for combinatorics, diophantine geometry, differential equations and other fields. I will present an account of the last 70 years in model theory that illustrates this shift. This reports material in my recent book published by Cambridge: Formalization without Foundationalism: Model Theory and the Philosophy of Mathematical Practice.

Euler sums and p-adic L-functions

Abstract:  It is a central question in the theory of infinite relational structures as to which structures carry analogues of Ramsey’s Theorem.  This question, of interest for several decades, has gained recent momentum as it was brought into focus by Kechris, Pestov, and Todorcevic, when they proved a deep correspondence between Ramsey theory and topological dynamics.  

In this talk, we provide background on the Ramsey theory of the Rado graph, solved by Sauer.  A longstanding open question was whether Henson graphs, the k-clique-free analogues of the Rado graph, have similar features.  We present the speaker’s recent work solving the Ramsey theory of the Henson graphs.  The techniques developed open new lines of investigation for other relational structures with forbidden configurations.  As a byproduct of these methods, we may obtain Ramsey properties for Borel colorings on copies of the Rado graph, with respect to a certain topology.

Abstract:  It is a central question in the theory of infinite relational structures as to which structures carry analogues of Ramsey’s Theorem.  This question, of interest for several decades, has gained recent momentum as it was brought into focus by Kechris, Pestov, and Todorcevic, when they proved a deep correspondence between Ramsey theory and topological dynamics.  

In this talk, we provide background on the Ramsey theory of the Rado graph, solved by Sauer.  A longstanding open question was whether Henson graphs, the k-clique-free analogues of the Rado graph, have similar features.  We present the speaker’s recent work solving the Ramsey theory of the Henson graphs.  The techniques developed open new lines of investigation for other relational structures with forbidden configurations.  As a byproduct of these methods, we may obtain Ramsey properties for Borel colorings on copies of the Rado graph, with respect to a certain topology.

Knot theory investigates the many ways of embedding a circle into the three-dimensional sphere. The study of these embeddings is not only important for understanding three-dimensional manifolds, but is also intimately related to many new and surprising phenomena appearing in dimension four. I will discuss how four-dimensional interpretations of some invariants can help us understand surfaces that bound a given link (embedding of several disjoint circles).

The Ring Learning With Errors problem (RLWE) comes in various forms. Vanilla RLWE is the decision dual-RLWE variant, consisting in distinguishing from uniform a distribution depending on a secret belonging to the dual OK^vee of the ring of integers OK of a specified number field K. In primal-RLWE, the secret instead belongs to OK. Both decision dual-RLWE and primal-RLWE enjoy search counterparts. Also widely used is (search/decision) Polynomial Learning With Errors (PLWE), which is not defined using a ring of integers OK of a number field K but a polynomial ring Z[x]/f for a monic irreducible f in Z[x]. We show that there exist reductions between all of these six problems that incur limited parameter losses. More precisely: we prove that the (decision/search) dual to primal reduction from Lyubashevsky et al. [EUROCRYPT 2010] and Peikert [SCN 2016] can be implemented with a small error rate growth for all rings (the resulting reduction is nonuniform polynomial time); we extend it to polynomial-time reductions between (decision/search) primal RLWE and PLWE that work for a family of polynomials f that is exponentially large as a function of deg f (the resulting reduction is also non-uniform polynomial time); and we exploit the recent technique from Peikert et al. [STOC 2017] to obtain a search to decision reduction for RLWE. The reductions incur error rate increases that depend on intrinsic quantities related to K and f.

Based on joint work with Miruna Roșca and Damien Stehlé.

With Gianluca Paolini (in preparation), we constructed, using a variant on the Hrushovski dimension function, for every k ≥ 3, 2^µ families of strongly minimal Steiner k systems. We study the mathematical properties of these counterexamples to Zilber’s trichotomy conjecture rather than thinking of them as merely exotic examples. In particular the long study of finite Steiner systems in reflected in results that depend on the block size k. A quasigroup is a structure with a binary operation such that for each equation xy = z the values of two of the variables determines a unique value for the third. The new Steiner 3-systems are bi-interpretable with strongly minimal Steiner quasigroups. For k > 3, we show the pure k-Steiner systems have ‘essentially unary definable closure’ and do not interpret a quasigroup. But we show that for q a prime power the Steiner q systems can be interpreted into specific sorts of quasigroups, block algebras. We extend the notion of an (a, b)-cycle graph arising in the study of finite and infinite Stein triple systems (e.g Cameron-Webb) by introducing what we call the (a, b)-path graph of a block algebra. We exhibit theories of strongly minimal block algebras where all (a, b)-paths are infinite and others in which all are finite only in the prime model. We show how to obtain combinatorial properties (e.g. 2-transitivity) by the either varying the basic collection of finite partial Steiner systems or modifying the µ function which ensures strong minimality

The Erdos-Hajnal Theorem asserts that non-universal graphs, that is, graphs that do not contain an induced copy of some fixed graph H, have homogeneous sets of size significantly larger than one can generally expect to find in a graph. We obtain two results of this flavor in the setting of r-uniform hypergraphs.

1. A theorem of R\"odl asserts that if an n-vertex graph is non-universal then it contains an almost homogeneous set (i.e one with edge density either very close to 0 or 1) of size \Omega(n). We prove that if a 3-uniform hypergraph is non-universal then it contains an almost homogeneous set of size \Omega(log n). An example of R\"odl from 1986 shows that this bound is tight.

2. Let R_r(t) denote the size of the largest non-universal r-graph G so that neither G nor its complement contain a complete r-partite subgraph with parts of size t. We prove an Erd\H{o}s--Hajnal-type stepping-up lemma, showing how to transform a lower bound for R_r(t) into a lower bound for R_{r+1}(t). As an application of this lemma, we improve a bound of Conlon-Fox-Sudakov by showing that R_3(t) \geq t^{ct).

Joint work with M. Amir and A. Shapira

Analytic continuation is ill-posed, but becomes merely ill-conditioned (though with an infinite condition number) if it is known that the function in question is bounded in a given region of the complex plane.
This classical, seemingly theoretical subject has many connections with numerical practice.  One argument indicates that if one tracks an analytic function from z=1 around a branch point at z=0 and back to z=1 again by a Weierstrass chain of disks, the number of accurate digits is divided by about exp(2 pi e) ~= 26,000,000.

The problem of authorship attribution (AA) involves matching a text of unknown authorship with its creator, found among a pool of candidate authors. In this work, we examine in detail authorship attribution methods that rely on networks of function words to detect an “authorial fingerprint” of literary works. Previous studies interpreted these word adjacency networks (WANs) as Markov chains, giving transition rates between function words, and they compared them using information-theoretic measures. Here, we apply a variety of network flow-based tools, such as role-based similarity and community detection, to perform a direct comparison of the WANs. These tools reveal an interesting relation between communities of function words and grammatical categories. Moreover, we propose two new criteria for attribution based on the comparison of connectivity patterns and the similarity of network partitions. The results are positive, but importantly, we observe that the attribution context is an important limiting factor that is often overlooked in the field's literature. Furthermore, we give important new directions that deserve further consideration.

We study solutions to stationary Navier-Stokes system in two dimensional exterior domains, namely, existence of these solutions and their asymptotical behavior. The talk is based on the recent joint papers with K. Pileckas and R. Russo where the uniform boundedness and uniform convergence at infinity for arbitrary solution with finite Dirichlet integral were established. Here  no restrictions on smallness of fluxes are assumed, etc.  In the proofs we develop the ideas of the classical papers of Gilbarg & H.F. Weinberger (Ann. Scuola Norm.Pisa 1978) and Amick (Acta Math. 1988).

We address the problem of pricing and hedging general exotic derivatives. We study this problem in the scenario when one has access to limited price data of other exotic derivatives. In this presentation I explore a nonparametric approach to pricing exotic payoffs using market prices of other exotic derivatives using signatures.

The lower central series of a group $G$ is defined by $\gamma_1=G$ and $\gamma_n = [G,\gamma_{n-1}]$. The "dimension series", introduced by Magnus, is defined using the group algebra over the integers: $\delta_n = \{g: g-1\text{ belongs to the $n$-th power of the augmentation ideal}\}$.

It has been, for the last 80 years, a fundamental problem of group theory to relate these two series. One always has $\delta_n\ge\gamma_n$, and a conjecture by Magnus, with false proofs by Cohn, Losey, etc., claims that they coincide; but Rips constructed an example with $\delta_4/\gamma_4$ cyclic of order 2. On the positive side, Sjogren showed that $\delta_n/\gamma_n$ is always a torsion group, of exponent bounded by a function of $n$. Furthermore, it was believed (and falsely proven by Gupta) that only $2$-torsion may occur.
In joint work with Roman Mikhailov, we prove however that for every prime $p$ there is a group with $p$-torsion in some quotient $\delta_n/\gamma_n$.
Even more interestingly, I will show that the dimension quotient $\delta_n/gamma_n$ is related to the difference between homotopy and homology: our construction is fundamentally based on the order-$p$ element in the homotopy group $\pi_{2p}(S^2)$ due to Serre.
 

Abstract: Consider a gaussian field f on R^2 and a level l. One can define a random coloring of the plane by coloring a point x in black if f(x)>-l and in white otherwise. The topology of this coloring is interesting in many respects. One can study the "small scale" topology by counting connected components with fixed topology, or study the "large scale" topology by considering black crossings of large rectangles. I will present results involving these quantities.

Einstein metrics are fixed points (up to scaling) of Hamilton's Ricci flow. A natural question to ask is whether a given metric is stable in the sense that the flow returns to the Einstein metric under a small perturbation. I'll give a brief survey of this area focussing on the case when the Einstein constant is positive. An interesting class of metrics where this question is not completely resolved are the compact symmetric spaces. I'll report on some recent progress with Tommy Murphy and James Waldron where we have been able to use a criterion due to Kroencke to show the Kaehler-Einstein metric on some Grassmannians and the bi-invariant metric on the Lie group G_2 are unstable.

Get to know the Mathematrix events of this term!

We were a bit too late with ordering food, so the usual sandwich lunch will only start from week 2. However, there may be some small snacks.

The zeta-function of a manifold varies with the parameters and may be evaluated in terms of the periods. For a one parameter family of CY manifolds, the periods satisfy a single 4th order differential equation. Thus there is a straight and, it turns out, readily computable path that leads from a differential operator to a zeta-function. Especially interesting are the specialisations to singular manifolds, for which the zeta-function manifests modular behaviour. We are also able to find, from the zeta function, attractor points. These correspond to special values of the parameter for which there exists a 10D spacetime for which the 6D corresponds to a CY manifold and the 4D spacetime corresponds to an extremal supersymmetric black hole. These attractor CY manifolds are believed to have special number theoretic properties. This is joint work with Xenia de la Ossa, Mohamed Elmi and Duco van Straten.

The 23rd Annual Meeting of the SIAM UKIE Section will take place on Friday 11th January 2019 at the Mathematical Institute at the University of Oxford.

The meeting will feature five invited speakers covering a broad range of industrial and applied mathematics: 

- Lisa Fauci, Tulane University, Incoming SIAM President
- Des Higham, Strathclyde University 
- Carola-Bibiane Schoenlieb (IMA sponsored speaker), University of Cambridge 
- Kirk Soodhalter, Trinity College Dublin 
- Konstantinos Zygalakis, University of Edinburgh 

There will also be a poster session, open to PhD students and postdocs. Travel support will be available for PhD students with an accepted poster presentation, and Best Poster prizes will be awarded. 

All talks will take place in room L3 in the Andrew Wiles Building (Mathematical Institute, University of Oxford). 

Programme 
09:30 - 10:00 Registration, tea/coffee 
10:00 - 10:15 Welcome 
10:15 - 11:00 Des Higham: Our Friends are Cooler than Us 
11:00 - 11:45 Lisa Fauci: Complex dynamics of fibers in flow at the microscale 
11:45 - 12:15 Poster Blitz 
12:15 - 13:30 Lunch and Poster session 
13:30 - 14:00 SIAM UKIE Business Meeting, open to all 
14:00 - 14:45 Kirk Soodhalter: Augmented Arnoldi-Tikhonov Methods for Ill-posed Problems 
14:45 - 15:30 Konstantinos Zygalakis: Explicit stabilised Runge-Kutta methods and their application to Bayesian inverse problems 
15:30 - 16:00 Tea/coffee 
16:00 - 16:45 Carola-Bibiane Schoenlieb (IMA sponsored speaker): Variational models and partial differential equations for mathematical imaging 
16:45 - 17:00 Poster prize announcement