University of Edinburgh

In the ongoing programme to classify noncommutative projective surfaces (connected graded noetherian domains of Gelfand-Kirillov dimension three) a natural question is:  what are the minimal models within a birational class?  It is not even clear a priori what the correct definition is of a minimal model in this context.

We show that a generic Sklyanin algebra (a noncommutative analogue of P^2) satisfies the surprising property that it has no birational connected graded noetherian overrings, and explain why this is a reasonable definition of 'minimal model.' We show also that the noncommutative versions of P^1xP^1 and of the Hirzebruch surface F_2 are minimal.
This is joint work in progress with Dan Rogalski and Toby Stafford.

 

The talk will be based on some of the material in the joint survey with Etienne Ghys

"Signatures in algebra, topology and dynamics"

http://arxiv.org/abs/1512.092582

In the 19th century Sturm's theorem on the number of roots of a real polynomial motivated Sylvester to define the signature of a quadratic form. In the 20th century the classification of quadratic forms over algebraic number fields motivated Witt to introduce the "Witt groups" of stable isomorphism classes of quadratic forms over arbitrary fields. Still in the 20th century the study of high-dimensional topological manifolds with nontrivial fundamental group motivated Wall to introduce the "Wall groups" of stable isomorphism classes of quadratic forms over arbitrary rings with involution. In our survey we interpreted Sturm's theorem in terms of the Witt-Wall groups of function fields. The talk will emphasize the common thread running through this developments, namely the notion of the localization of a ring inverting elements. More recently, the Cohn localization of inverting matrices over a noncommutative ring has been applied to topology in the 21st century, in the context of the speaker's algebraic theory of surgery.

Leinster and Willerton have introduced the concept of the magnitude of a metric space, as a special case as that of an enriched category. It is a numerical invariant which is designed to capture the important geometric information about the space, but concrete examples of ts values on compact sets in euclidean space have hitherto been lacking. We discuss progress in some conjectures of Leinster and Willerton.

The concept of delegated quantum computing is a quantum extension of  
the classical task of computing with encrypted data without decrypting  
them first. Many quantum protocols address this challenge for a  
futuristic quantum client-server setting achieving a wide range of  
security properties. The central challenge of all these protocols to  
be applicable for classical tasks (such as secure multi party  
computation or fully homomorphic encryption) is the requirement of a  
server with a universal quantum computer. By restricting the task to  
classical computation only, we derive a protocol for unconditionally  
secure delegation of classical computation to a remote server that has  
access to basic quantum devices.

Security Constrained Optimal Power Flow is an increasingly important problem for power systems operation both in its own right and as a subproblem for more complex problems such as transmission switching or
unit commitment.

The structure of the problem resembles stochastic programming problems in that one aims to find a cost optimal operation schedule that is feasible for all possible equipment outage scenarios
(contingencies). Due to the presence of power flow constraints (in their "DC" or "AC" version), the resulting problem is a large scale linear or nonlinear programming problem.

However it is known that only a small subset of the contingencies is active at the solution. We show how Interior Point methods can exploit this structure both by simplifying the linear algebra operations as
well as generating necessary contingencies on the fly and integrating them into the algorithm using IPM warmstarting techniques. The final problem solved by this scheme is significantly smaller than the full
contingency constrained problem, resulting in substantial speed gains.

Numerical and theoretical results of our algorithm will be presented.

We investigate the effects of a finite set of agents interacting socially in an equilibrium pricing mechanism. A derivative written on non-tradable underlyings is introduced to the market and priced in an equilibrium framework by agents who assess risk using convex dynamic risk measures expressed by Backward Stochastic Differential Equations (BSDE). An agent is not only exposed to financial and non-financial risk factors, but he also faces performance concerns with respect to the other agents. The equilibrium analysis leads to systems of fully coupled multi-dimensional quadratic BSDEs.

Within our proposed models we prove the existence and uniqueness of an equilibrium. We show that aggregation of risk measures is possible and that a representative agent exists. We analyze the impact of the problem's parameters in the pricing mechanism, in particular how the agent's concern rates affect prices and risk perception.

When applied to an inequality constrained optimization problem, interior point methods generate iterates that belong to the interior of the set determined by the constraints, thus avoiding/ignoring the combinatorial aspect of the solution. This comes at the cost of difficulty in predicting the optimal active constraints that would enable termination.  We propose the use of controlled perturbations to address this challenge. Namely, in the context of linear programming with only nonnegativity constraints as the inequality constraints, we consider perturbing the nonnegativity constraints so as to enlarge the feasible set. Theoretically, we show that if the perturbations are chosen appropriately, the solution of the original problem lies on or close to the central path of the perturbed problem and that a primal-dual path-following algorithm applied to the perturbed problem is able to predict the optimal active-set of the original problem when the duality gap (for the perturbed problem) is not too small. Encouraging preliminary numerical experience is obtained when comparing the perturbed and unperturbed interior point algorithms' active-set predictions for the purpose of cross-over to simplex.

I will explain how, given a crepant morphism with one-dimensional fibres between 3-folds, it is possible to use noncommutative deformations to run the MMP in a satisfyingly algorithmic fashion.  As part of this, a flop is viewed homologically as the solution to a universal property, and so is constructed not by changing GIT, but instead by changing the algebra. Carrying this extra information of the new algebra allows us to continue to flop, and thus continue the MMP, without having to calculate everything from scratch. Proving things in this manner does in fact have other consequences too, and I will explain some them, both theoretical and computational.

The accurate and efficient solution of linear systems $Ax=b$ is very important in many engineering and technological applications, and systems of this form also arise as subproblems within other algorithms. In particular, this is true for interior point methods (IPM), where the Newton system must be solved to find the search direction at each iteration. Solving this system is a computational bottleneck of an IPM, and in this talk I will explain how preconditioning and deflation techniques can be used, to lessen this computational burden.  This work is joint with Jacek Gondzio.