Past

 The Sen conjecture, made in 1994, makes precise predictions about the existence of L^2 harmonic forms on the monopole moduli spaces. For each positive integer k, the moduli space M_k of monopoles of charge k is a non-compact smooth manifold of dimension 4k, carrying a natural hyperkaehler metric.  Thus studying Sen’s conjectures requires a good understanding of the asymptotic structure of M_k and its metric.  This is a challenging analytical problem, because of the non-compactness of M_k and because its asymptotic structure is at least as complicated as the partitions of k.  For k=2, the metric was written down explicitly by Atiyah and Hitchin, and partial results are known in other cases.  In this talk, I shall introduce the main characters in this story and describe recent work aimed at proving Sen’s conjecture.

Recently, millions of novel examples of compact G2 holonomy manifolds have been constructed as twisted connected sums of asymptotically cylindrical Calabi-Yau threefolds. In case these are K3 fibred, they can in turn be constructed from dual pairs of tops. This is analogous to Batyrev's construction of Calabi-Yau manifolds via reflexive polytopes. For compactifications of Type II superstrings on such G2 manifolds, we formulate a construction of the mirror.

Featuring
Peter Grindrod, Director of the Oxford-Emirates Data Science Lab, Oxford Mathematical Institute

Geraint Lloyd, Senior Software Engineer, Schlumberger

[[{"fid":"45910","view_mode":"media_square","fields":{"format":"media_square","field_file_image_alt_text[und][0][value]":"Geraint Lloyd","field_file_image_title_text[und][0][value]":"Geraint Lloyd"},"type":"media","attributes":{"alt":"Geraint Lloyd","title":"Geraint Lloyd","height":"258","width":"258","class":"media-element file-media-square"}}]]

Mick Pont, VP Research and Development, Numerical Algorithms Group (NAG)

[[{"fid":"45911","view_mode":"media_square","fields":{"format":"media_square","field_file_image_alt_text[und][0][value]":"Mick Pont","field_file_image_title_text[und][0][value]":"Mick Pont"},"type":"media","attributes":{"alt":"Mick Pont","title":"Mick Pont","height":"258","width":"258","class":"media-element file-media-square"}}]]

Anna Railton, Technical Staff, Smith Institute

[[{"fid":"45912","view_mode":"media_square","fields":{"format":"media_square","field_file_image_alt_text[und][0][value]":"Anna Railton","field_file_image_title_text[und][0][value]":"Anna Railton"},"type":"media","attributes":{"alt":"Anna Railton","title":"Anna Railton","height":"258","width":"258","class":"media-element file-media-square"}}]]
Michele Taroni, Senior Project Manager, Roxar

[[{"fid":"45913","view_mode":"media_square","fields":{"format":"media_square","field_file_image_alt_text[und][0][value]":"Michele Taroni","field_file_image_title_text[und][0][value]":"Michele Taroni"},"type":"media","attributes":{"alt":"Michele Taroni","title":"Michele Taroni","height":"258","width":"258","class":"media-element file-media-square"}}]]

The projects include melting of the paste, fluid flow, particle segregation, baking, shrinkage and material properties of baked electrode.

I will start with a motivation of what algebraic and model-theoretic properties an algebraically closed field of characteristic 1 is expected to have. Then I will explain how these properties forces one to follow the route of Hrushovski's construction/Schanuel-type conjecture analysis. Then I am able to formulate very precise axioms that such a field must satisfy.  The main theorem then states that under the axioms the structure has the desired algebraic properties.
The axioms have a form of statements about existence of solutions to systems of equations in terms of a 'multi-dimansional' valuation theory and the validity of these statements is an open problem to be discussed. 

 

What makes cities successful? A complex systems approach to modelling urban economies

Urban centres draw a diverse range of people, attracted by opportunity, amenities, and the energy of crowds. Yet, while benefiting from density and proximity of people, cities also suffer from issues surrounding crime, congestion and density. Seeking to uncover the mechanisms behind the success of cities using novel tools from the mathematical and data sciences, this work uses network techniques to model the opportunity landscape of cities. Under the theory that cities move into new economic activities that share inputs with existing capabilities, path dependent industrial diversification can be described using a network of industries. Edges represent shared necessary capabilities, and are empirically estimated via flows of workers moving between industries. The position of a city in this network (i.e., the subnetwork of its current industries) will determine its future diversification potential. A city located in a central well-connected region has many options, but one with only few peripheral industries has limited opportunities.

We develop this framework to explain the large variation in labour formality rates across cities in the developing world, using data from Colombia. We show that, as cities become larger, they move into increasingly complex industries as firms combine complementary capabilities derived from a more diverse pool of workers. We further show that a level of agglomeration equivalent to between 45 and 75 minutes of commuting time maximizes the ability of cities to generate formal employment using the variety of skills available. Our results suggest that rather than discouraging the expansion of metropolitan areas, cities should invest in transportation to enable firms to take advantage of urban diversity.

This talk will be based on joint work with Eduardo Lora and Andres Gomez at Harvard University.

Hamilton-Jacobi-Bellman equations for dynamic pricing

I will discuss the Hamilton-Jacobi-Bellman (HJB) equation, which is a nonlinear, second-order, terminal value PDE problem. The equation arises in optimal control theory as an optimality condition.

Consider a dynamic pricing problem: over a given period, what is the best strategy to maximise revenues and minimise the cost of unsold items?

This is formulated as a stochastic control problem in continuous time, where we try to find a function that controls a stochastic differential equation based on the current state of the system.

The optimal control function can be found by solving the corresponding HJB equation.

I will present the solution of the HJB equation using a toy problem, for a risk-neutral and a risk-averse decision maker.

Mirror symmetry is a duality from string theory that states that given a Calabi-Yau variety, there exists another Calabi-Yau variety so that various geometric and physical data are exchanged. The investigation of this mirror correspondence has its roots in enumerative geometry and hodge theory, but has been later interpreted by Kontsevich in a categorical setting. This exchange in data is very powerful, and has been shown to persist for zeta functions associated to Calabi-Yau varieties, although there is no rigorous statement for what arithmetic mirror symmetry would be. Instead of directly trying to state and prove arithmetic mirror symmetry, we will instead use mirror symmetry as an intuitional framework to obtain arithmetic results for special Calabi-Yau pencils in projective space from the Hodge theoretic viewpoint. If time permits, we will discuss work in progress in starting to find arithmetic implications of Kontsevich's Homological Mirror Symmetry.

Work with Jemima Tabeart, Sarah Dance, Nancy Nichols, Joanne Waller (University of Reading) and Stefano Migliorini, Fiona Smith (Met Office). 
In environmental prediction variational data assimilation (DA) is a method for using observational data to estimate the current state of the system. The DA problem is usually solved as a very large nonlinear least squares problem, in which the fit to the measurements is balanced against the fit to a previous model forecast. These two terms are weighted by matrices describing the correlations of the errors in the forecast and in the observations. Until recently most operational weather and ocean forecasting systems assumed that the errors in the observations are uncorrelated. However, as we move to higher resolution observations then it is becoming more important to specify observation error correlations. In this work we look at the effect this has on the conditioning of the optimization problem. In the context of a linear system we develop bounds on the condition number of the problem in the presence of correlated observation errors. We show that the condition number is very dependent on the minimum eigenvalue of the observation error correlation matrix. We then present results using the Met Office data assimilation system, in which different methods for reconditioning the correlation matrix are tested. We investigate the effect of these different methods on the conditioning and the final solution of the problem.
 

Systems that have more than one conserved quantity (i.e. energy plus momentum, density etc.), can exhibit quite interesting temperature profiles in non-equilibrium stationary states. I will present some numerical experiment and mathematical result. I will also expose some other connected problems, always concerning thermal boundary conditions in hydrodynamic limits.
 

Abstract: We will consider a model theoretic approach to Gelfand-Naimark duality, from the point of view of (generalized) Zariski structures. In particular we will show quantifier elimination for compact Hausdorff spaces in the natural Zariski language. Moreover we may see a slightly unusual construction and tweak to the language, which improves stability properties of the structures.
 

Code based Cryptography had its beginning in 1978 when Robert McEliece
demonstrated how the hardness of decoding a general linear code up to
half the minimum distance can be used as the basis for a public key
crypto system.  At the time the proposed system was not implemented in
practice as the required public key was relatively large.

With the realization that a quantum computer would make many
practically used systems obsolete coding based systems became an
important research subject in the area of post-quantum cryptography.
In this talk we will provide an overview to the subject.

In addition  we will report on recent results where the underlying
code is a disguised Gabidulin code or more generally a subspace
code and where the distance measure is the rank metric respecively the
subspace distance.
 

This talk will be on general amalgamation theory, covering ground from the 1950s to original research, with applications and examples from many different areas of mathematics and ranging from classical results to open problems.

A classification of simple flops on smooth threefolds in terms of the length invariant was given by Katz and Morrison, who showed that the length must take the value 1,2,3,4,5, or 6. This classification was produced by understanding simultaneous (partial) resolutions that occur in the deformation theory of A, D, E Kleinian surface singularities. An outcome of this construction is that all simple threefold flops of length l occur by pullback from a "universal flop" of length l. Curto and Morrison understood the universal flops of length 1 and 2 using matrix factorisations. I aim to describe how these universal flops can understood for lengths >2 via noncommutative algebra.

We will consider the following deceptively simple question, formulated recently by Po Shen Loh who connected it to an open problem in Ramsey Theory. Define the '2-less than' relation on the set of triples of integers by saying that a triple x is 2-less than a triple y if x is less than y in at least two coordinates. What is the maximal length of a sequence of triples taking values in {1,...,n} which is totally ordered by the '2-less than' relation?

In his paper, Loh uses the triangle removal lemma to improve slightly on the trivial upper bound of n^2, and conjectures that the truth should be of order n^(3/2). The gap between these bounds has proved to be surprisingly resistant. We shall discuss joint work with Tim Gowers, giving some developments towards this conjecture and a wide array of natural extensions of the problem. Many of these extensions remain open.
 

We consider the classic problem of establishing a statistical ranking of a set of n items given a set of inconsistent and incomplete pairwise comparisons between such items. Instantiations of this problem occur in numerous applications in data analysis (e.g., ranking teams in sports data), computer vision, and machine learning. We formulate the above problem of ranking with incomplete noisy information as an instance of the group synchronization problem over the group SO(2) of planar rotations, whose usefulness has been demonstrated in numerous applications in recent years. Its least squares solution can be approximated by either a spectral or a semidefinite programming (SDP) relaxation, followed by a rounding procedure. We perform extensive numerical simulations on both synthetic and real-world data sets (Premier League soccer games, a Halo 2 game tournament and NCAA College Basketball games) showing that our proposed method compares favorably to other algorithms from the recent literature.

We propose a similar synchronization-based algorithm for the rank-aggregation problem, which integrates in a globally consistent ranking pairwise comparisons given by different rating systems on the same set of items. We also discuss the problem of semi-supervised ranking when there is available information on the ground truth rank of a subset of players, and propose an algorithm based on SDP which recovers the ranks of the remaining players. Finally, synchronization-based ranking, combined with a spectral technique for the densest subgraph problem, allows one to extract locally-consistent partial rankings, in other words, to identify the rank of a small subset of players whose pairwise comparisons are less noisy than the rest of the data, which other methods are not able to identify. 
 

The trigonometric interpolants to a periodic function f in equispaced points converge if f is Dini-continuous, and the associated quadrature formula, the trapezoidal rule, converges if f is continuous.  What if the points are perturbed?  Amazingly little has been done on this problem, or on its algebraic (i.e. nonperiodic) analogue.  I will present new results joint with Anthony Austin which show some surprises.

We outline what we expect from a good cohomology theory and introduce some of the most common cohomology theories. We go on to discuss what properties each should encode and detail attempts to fit them into a common framework. We build evidence for this viewpoint through several worked number theoretic examples and explain how many of the key conjectures in number theory fit into this theory of motives.

In this talk we will discuss some properties of Schrödinger operators on parabolic manifolds, and particularize them to study the stability operator of a parabolic surface with constant mean curvature immersed in a 3-manifold that admits a Killing vector field. As an application, we will determine the range of values of H such that some homogeneous 3-manifolds admit complete parabolic stable surfaces with constant mean curvature H. Time permitting, we will also discuss some related area and first-eigenvalue estimates for the stability operator of constant mean curvature graphs in such 3-manifolds.

Wave propagation in random media can be studied by multi-scale and stochastic analysis. We first consider the direct problem and show that, in a physically relevant regime of separation of scales, wave propagation is governed by a Schrodinger-type equation driven by a Brownian field. We study the associated moment equations and clarify the propagation of coherent and incoherent waves. Second, using these new results we design original methods for sensor array imaging when the medium is randomly scattering and apply them to seismic imaging and ultrasonic testing of concrete.

A randomly trapped random walk on a graph is a simple continuous time random walk in which the holding time at a given vertex is an independent sample from a probability measure determined by the trapping landscape, a collection of probability measures indexed by the vertices.

This is a time change of the simple random walk. For the constant speed continuous time random walk, the landscape has an exponential distribution with rate 1 at each vertex. For the Bouchaud trap model it has an exponential random variable at each vertex but where the rate for the exponential is chosen from a heavy tailed distribution. In one dimension the possible scaling limits are time changes of Brownian motion and include the fractional kinetics process and the Fontes-Isopi-Newman (FIN) singular diffusion. We extend this analysis to put these models in the setting of resistance forms, a framework that includes finitely ramified fractals. In particular we will construct a FIN diffusion as the limit of the Bouchaud trap model and the random conductance model on fractal graphs. We will establish heat kernel estimates for the FIN diffusion extending what is known even in the one-dimensional case.