L4

Given $d \ge 1$, $T>0$ and a vector field $\mathbf b \colon [0,T] \times \mathbb R^d \to \mathbb R^d$, we study the problem of uniqueness of weak solutions to the associated transport equation $\partial_t u + \mathbf b \cdot \nabla u=0$ where $u \colon [0,T] \times \mathbb R^d \to \mathbb R$ is an unknown scalar function. In the classical setting, the method of characteristics is available and provides an explicit formula for the solution of the PDE, in terms of the flow of the vector field $\mathbf b$. However, when we drop regularity assumptions on the velocity field, uniqueness is in general lost.
In the talk we will present an approach to the problem of uniqueness based on the concept of Lagrangian representation. This tool allows to represent a suitable class of vector fields as superposition of trajectories: we will then give local conditions to ensure that this representation induces a partition of the space-time made up of disjoint trajectories, along which the PDE can be disintegrated into a family of 1-dimensional equations. We will finally show that if $\mathbf b$ is locally of class $BV$ in the space variable, the decomposition satisfies this local structural assumption: this yields in particular the renormalization property for nearly incompressible $BV$ vector fields and thus gives a positive answer to the (weak) Bressan's Compactness Conjecture. This is a joint work with S. Bianchini.
 

Random matrices now play a role in many areas of theoretical, applied, and computational mathematics. Therefore, it is desirable to have tools for studying random matrices that are flexible, easy to use, and powerful. Over the last fifteen years, researchers have developed a remarkable family of results, called matrix concentration inequalities, that balance these criteria. This talk offers an invitation to the field of matrix concentration inequalities and their applications.

A C^infinity scheme is a version of a scheme that uses a maximal spectrum. The category of C^infinity schemes contains the category of Manifolds as a full subcategory, as well as being closed under fibre products. In other words, this category is equipped to handle intersection singularities of smooth spaces.

While originally defined in the set up of Synthetic Differential Geometry, C^infinity schemes have more recently been used to describe derived manifolds, for example, the d-manifolds of Joyce. There are applications of this in Symplectic Geometry, such as the describing the moduli space of J-holomorphic forms.

In this talk, I will describe the category of C^infinity schemes, and how this idea can be extended to manifolds with corners. If time, I will mention the applications of this in derived geometry.

I will present a procedure for perturbatively constructing the field content of gravitational theories from a convolutive product of two Yang-Mills theories. A dictionary "gravity=YM * YM" is developed, reproducing the symmetries and dynamics of the gravity theory from those of the YM theories. I will explain the unexpected, yet crucial role played by the BRST ghosts of the YM system in the construction of gravitational fields. The dictionary is expected to develop into a solution-generating technique for gravity.
 

There is currently a large interest in the applications of the Blockchain technology. After the well known success of the cryptocurrency Bitcoin, several other real-world applications of Blockchain technology have been proposed, often raising privacy concerns. We will discuss the potential of advanced cryptographic tools in relaxing the tension between pros and cons of this technology.

I will explain our recent description of the fundamental degrees of freedom underlying a generalized Kahler structure. For a usual Kahler
structure, it is well-known that the geometry is determined by a complex structure, a Kahler class, and the choice of a positive(1,1)-form in this class, which depends locally on only a single real-valued function: the Kahler potential. Such a description for generalized Kahler geometry has been sought since it was discovered in1984. We show that a generalized Kahler structure of symplectic type is determined by a pair of holomorphic Poisson manifolds, a
holomorphic symplectic Morita equivalence between them, and the choice of a positive Lagrangian brane bisection, which depends locally on
only a single real-valued function, which we call the generalized Kahler potential. To solve the problem we make use of, and generalize,
two main tools: the first is the notion of symplectic Morita equivalence, developed by Weinstein and Xu to study Poisson manifolds;
the second is Donaldson's interpretation of a Kahler metric as a real Lagrangian submanifold in a deformation of the holomorphic cotangent bundle.

Tight security is increasingly gaining importance in real-world
cryptography, as it allows to choose cryptographic parameters in a way
that is supported by a security proof, without the need to sacrifice
efficiency by compensating the security loss of a reduction with larger
parameters. However, for many important cryptographic primitives,
including digital signatures and authenticated key exchange (AKE), we
are still lacking constructions that are suitable for real-world deployment.

This talk will present the first first practical AKE protocol with tight
security. It allows the establishment of a key within 1 RTT in a
practical client-server setting, provides forward security, is simple
and easy to implement, and thus very suitable for practical deployment.
It is essentially the "signed Diffie-Hellman" protocol, but with an
additional message, which is crucial to achieve tight security. This
message is used to overcome a technical difficulty in constructing
tightly-secure AKE protocols.

The second important building block is a practical signature scheme with
tight security in a real-world multi-user setting with adaptive
corruptions. The scheme is based on a new way of applying the
Fiat-Shamir approach to construct tightly-secure signatures from certain
identification schemes.

For a theoretically-sound choice of parameters and a moderate number of
users and sessions, our protocol has comparable computational efficiency
to the simple signed Diffie-Hellman protocol with EC-DSA, while for
large-scale settings our protocol has even better computational per-
formance, at moderately increased communication complexity.

We first consider multilevel Monte Carlo and stochastic collocation methods for determining statistical information about an output of interest that depends on the solution of a PDE with inputs that depend on random parameters. In our context, these methods connect a hierarchy of spatial grids to the amount of sampling done for a given grid, resulting in dramatic acceleration in the convergence of approximations. We then consider multifidelity methods for the same purpose which feature a variety of models that have different fidelities. For example, we could have coarser grid discretizations, reduced-order models, simplified physics, surrogates such as interpolants, and, in principle, even experimental data. No assumptions are made about the fidelity of the models relative to the “truth” model of interest so that unlike multilevel methods, there is no a priori model hierarchy available. However, our approach can still greatly accelerate the convergence of approximations.

In the past few decades, power grids across the world have become dependent on markets that aim to efficiently match supply with demand at all times via a variety of pricing and auction mechanisms. These markets are based on models that capture interactions between producers, transmission and consumers. Energy producers typically maximize profits by optimally allocating and scheduling resources over time. A dynamic equilibrium aims to determine prices and dispatches that can be transmitted over the electricity grid to satisfy evolving consumer requirements for energy at different locations and times. Computation allows large scale practical implementations of socially optimal models to be solved as part of the market operation, and regulations can be imposed that aim to ensure competitive behaviour of market participants.

Questions remain that will be outlined in this presentation.

Firstly, the recent explosion in the use of renewable supply such as wind, solar and hydro has led to increased volatility in this system. We demonstrate how risk can impose significant costs on the system that are not modeled in the context of socially optimal power system markets and highlight the use of contracts to reduce or recover these costs. We also outline how battery storage can be used as an effective hedging instrument.

Secondly, how do we guarantee continued operation in rarely occuring situations and when failures occur and how do we price this robustness?

Thirdly, how do we guarantee appropriate participant behaviour? Specifically, is it possible for participants to develop strategies that move the system to operating points that are not socially optimal?

Fourthly, how do we ensure enough transmission (and generator) capacity in the long term, and how do we recover the costs of this enhanced infrastructure?