Forthcoming Seminars

Please note that the list below only shows forthcoming events, which may not include regular events that have not yet been entered for the forthcoming term. Please see the past events page for a list of all seminar series that the department has on offer.

Past events in this series
4 June 2019
14:15
Francois Petit
Abstract

Deformation quantization modules or DQ-modules where introduced by M. Kontsevich to study the deformation quantization of complex Poisson varieties. It has been advocated that categories of DQ-modules should provide invariants of complex symplectic varieties and in particular a sort of complex analog of the Fukaya category. Hence, it is natural to aim at describing the functors between such categories and relate them with categories appearing naturally in algebraic geometry. Relying, on methods of homotopical algebra, we obtain an analog of Orlov representation theorem for functors between categories of DQ-modules and relate these categories to deformations of the category of quasi-coherent sheaves.
 

4 June 2019
14:30
Annika Heckel

Further Information: 

A classic result of Shamir and Spencer states that for any function $p=p(n)$, the chromatic number of $G(n,p)$ is whp concentrated on a sequence of intervals of length about $\sqrt{n}$. For $p<n^{-\frac{1}{2} -\epsilon}$, much more is known: here, the chromatic number is concentrated on two consecutive values.

Until now, there have been no non-trivial cases where $\chi(G(n,p))$ is known not to be extremely narrowly concentrated. In 2004, Bollob\'as asked for any such examples, particularly in the case $p=\frac{1}{2}$, in a paper in the problem section of CPC. 

In this talk, we show that the chromatic number of $G(n, 1/2)$ is not whp concentrated on $n^{\frac{1}{4}-\epsilon}$ values

  • Combinatorial Theory Seminar
6 June 2019
12:00
Abstract

Function solutions to linear PDEs often carry rigidity properties directly associated to the equation they satsify. However, the realm of solutions covers a much larger sets of solutions. For instance, we can speak of measure solutions, as opposed to classical $C^\infty$ functions or even $L^p$ functions. It is only logical to expect that the “better” space the solution lives in, the more rigid its properties will be.

Measure solutions lie just at a comfortable half of this threshold: it is a sufficently large space which allows for a rich range of new structures; but is sufficiently rigid to preserve a meaningful geometrical pattern. For example, have you ever wondered how gradients look like in the space of measures? What about other PDE structures? In this talk I will discuss these general questions, a few examples of them, and a new theoretical approach to its understanding via PDE theory, harmonic analysis, and geometric measure theory methods.

  • PDE CDT Lunchtime Seminar
Abstract

As parallel computers approach Exascale (10^18 floating point operations per second), processor failure and data corruption are of increasing concern. Numerical linear algebra solvers are at the heart of many scientific and engineering applications, and with the increasing failure rates, they may fail to compute a solution or produce an incorrect solution. It is therefore crucial to develop novel parallel linear algebra solvers capable of providing correct solutions on unreliable computing systems. The common way to mitigate failures in high performance computing systems consists of periodically saving data onto a reliable storage device such as a remote disk. But considering the increasing failure rate and the ever-growing volume of data involved in numerical simulations, the state-of-the-art fault-tolerant strategies are becoming time consuming, therefore unsuitable for large-scale simulations. In this talk, we will present a  novel class of fault-tolerant algorithms that do not require any additional resources. The key idea is to leverage the knowledge of numerical properties of solvers involved in a simulation to regenerate lost data due to system failures. We will also share the lessons learned and report on the numerical properties and the performance of the new resilience algorithms.

  • Computational Mathematics and Applications Seminar

Pages

Add to My Calendar