Past

We shall describe a new proof of the Mordell-Lang conjecture in positive characteristic, in the situation where the variety under scrutiny is a smooth subvariety of an abelian variety. 
Our proof is based on the theory of semistable sheaves in positive characteristic, in particular on  Langer's theorem that the Harder-Narasimhan filtration of sheaves becomes strongly semistable after a finite number of iterations of Frobenius pull-backs. Our proof produces a numerical upper-bound for the degree of the finite morphism from an isotrivial variety appearing in the statement of the Mordell-Lang conjecture. This upper-bound is given in terms of the Frobenius-stabilised slopes of the cotangent bundle of the variety.

With few exceptions, optimal stopping assumes that the underlying system is stopped immediately after the decision is made. 
In fact, most stoppings take time. This has been variously referred to as "time-to-build", "investment lag" and "gestation period", 
which is often non negligible. 
In this talk, we consider a class of optimal stopping/switching problems with delivery lags, or equivalently, delayed information, 
by using reflected BSDE method. As an example, we study American put option with delayed exercise, and show that it can be decomposed 
as a European put option and a premium, the latter of which involves a new optimal stopping problem where the investor decides when to stop
to collect the Greek theta of such a European option. We also give a complete characterization of the optimal exercise boundary by resorting to free boundary analysis.  

Joint work with Zhou Yang and Mihail Zervos. 

Barbara Mahler: 15+5 min

Thomas Woolley: 15+5 min

Julian A. Garcia Grajales: 15+5 min
 

Abstract: n-homological algebra was initiated by Iyama
via his notion of n-cluster tilting subcategories.
It was turned into an abstract theory by the definition
of n-abelian categories (Jasso) and (n+2)-angulated categories
(Geiss-Keller-Oppermann).
The talk explains some elementary aspects of these notions.
We also consider the special case of an n-representation finite algebra.
Such an algebra gives rise to an n-abelian
category which can be "derived" to an (n+2)-angulated category.
This case is particularly nice because it is
analogous to the classic relationship between
the module category and the derived category of a
hereditary algebra of finite representation type.
 

To face the advent of multicore processors and the ever increasing complexity of hardware architectures, programming
models based on DAG parallelism regained popularity in the high performance, scientific computing community. Modern runtime systems offer a programming interface that complies with this paradigm and powerful engines for scheduling the tasks into which the application is decomposed. These tools have already proved their effectiveness on a number of dense linear algebra applications. 

In this talk we present the design of task-based sparse direct solvers on top of runtime systems. In the context of the
qr_mumps solver, we prove the usability and effectiveness of our approach with the implementation of a sparse matrix multifrontal factorization based on a Sequential Task flow parallel programming model. Using this programming model, we developed features such as the integration of dense 2D Communication Avoiding algorithms in the multifrontal method allowing for better scalability compared to the original approach used in qr_mumps.

Following this approach, we move to heterogeneous architectures where task granularity and scheduling strategies are critical to achieve performance. We present, for the multifrontal method, a hierarchical strategy for data partitioning and a scheduling algorithm capable of handling the heterogeneity of resources.   Finally we introduce a memory-aware algorithm to control the memory behavior of our solver and show, in the context of multicore architectures, an important reduction of the memory footprint for the multifrontal QR factorization with a small impact on performance.

We will discuss various familiar properties of groups studied in geometric group theory, whether or not they are invariant under quasi-isometry, and why.

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.

In the talk I will give an introduction to the Manin-Mumford conjecture and to the Pila-Zannier strategy for attacking it in the case of products of elliptic curves. if the permits it, I will also speak about how this same strategy has allowed to attack the analogous André-Oort conjecture for Shimura Varieties of abelian type. 

Fix some positive integer r. A famous theorem of Schur states that if you partition Z/pZ into r colour classes then, provided p > p_0(r) is sufficiently large, there is a monochromatic triple {x, y, x + y}. By essentially the same argument there is also a monochromatic triple {x', y', x'y'}. Recently, Tom Sanders and I showed that in fact there is a
monochromatic quadruple {x, y, x+y, xy}. I will discuss some aspects of the proof.

Amplitudes in quantum field theory have discontinuities when regarded as
functions of
the scattering kinematics. Such discontinuities can be determined from
Cutkosky rules.
We present a structural analysis of such rules for massive quantum field
theory which combines
algebraic geometry with the combinatorics of Karen Vogtmann's Outer Space.
This is joint work with Spencer Bloch (arXiv:1512.01705).

Many theorems and conjectures in prime number theory are equivalent to finding solutions to certain linear equations in primes -- witness Goldbach's conjecture, the twin prime conjecture, Vinogradov's theorem, finding k-term arithmetic progressions, etcetera. Classically these problems were attacked using Fourier analysis -- the 'circle' method -- which yielded some success, provided that the number of variables was sufficiently large. More recently, a long research programme of Ben Green and Terence Tao introduced two deep and wide-ranging techniques -- so-called 'higher order Fourier analysis' and the 'transference principle' -- which reduces the number of required variables dramatically. In particular, these methods give an asymptotic formula for the number of k-term arithmetic progressions of primes up to X. In this talk we will give a brief survey of these techniques, and describe new work of the speaker, partially ongoing, which applies the Green-Tao machinery to count prime solutions to certain linear inequalities in primes -- a 'higher order Davenport-Heilbronn method'. 

I will discuss a recent joint work with A. Malchiodi (Pisa) and M. Micallef (Warwick) in which we show that not every harmonic map can be approximated by a sequence of $\alpha$-harmonic maps.

Abstract: Kolmogorov backward equations related to stochastic evolution equations (SEE) in Hilbert space, driven by trace class Gaussian noise have been intensively studied in the literature. In this talk I discuss the extension to non trace class Gaussian noise in the particular case when the leading linear operator generates an analytic semigroup. This natural generalization leads to several complications, requiring new existence and uniqueness results for SEE with initial singularities and a new notion of an extended transition semigroup. This is joint work with Arnulf Jentzen and Ryan Kurniawan (ETH).

We consider the non-linear equation $T^{-1} u+\partial_tu-\partial_x^2\pi(u)=\xi$

driven by space-time white noise $\xi$, which is uniformly parabolic because we assume that $\pi'$ is bounded away from zero and infinity. Under the further assumption of Lipschitz continuity of $\pi'$ we show that the stationary solution is - as for the linear case - almost surely Hölder continuous with exponent $\alpha$ for any $\alpha<\frac{1}{2}$ w. r. t. the parabolic metric. More precisely, we show that the corresponding local Hölder norm has stretched exponential moments.

On the stochastic side, we use a combination of martingale arguments to get second moment estimates with concentration of measure arguments to upgrade to Gaussian moments. On the deterministic side, we first perform a Campanato iteration based on the De Giorgi-Nash Theorem as well as finite and infinitesimal versions of the $H^{-1}$-contraction principle, which yields Gaussian moments for a weaker Hölder norm. In a second step this estimate is improved to the optimal

Hölder exponent at the expense of weakening the integrability to stretched exponential.

This is joint work with Felix Otto.

It is unknown whether a bound on axion field ranges exists within quantum gravity. We study axion field ranges using extended supersymmetry, in particular allowing an analysis within strongly coupled regions of moduli space. We apply this strategy to Calabi-Yau compactifications with one and two Kähler moduli. We relate the maximally allowable decay constant to geometric properties of the underlying Calabi-Yau geometry. In all examples we find a maximal field range close to the reduced Planck mass (with the largest field range being 3.25 $M_P$). On this perspective, field ranges relate to the intersection and instanton numbers of the underlying Calabi-Yau geometry.

In the same way that the classical Torelli theorem determines a curve from its polarized Jacobian we show that moduli spaces of parabolic bundles and parabolic Higgs bundles over a compact Riemann surface X  also determine X. We make use of a theorem of Hurtubise on the geometry of algebraic completely integrable systems in the course of the proof. This is a joint work with I. Biswas and T. Gómez 

Most networks and graphs encountered in empirical studies, including internet and web graphs, social networks, and biological and ecological networks, are very sparse.  Standard spectral and linear algebra methods can fail badly when applied to such networks and a fundamentally different approach is needed.  Message passing methods, such as belief propagation, offer a promising solution for these problems.  In this talk I will introduce some simple models of sparse networks and illustrate how message passing can form the basis for a wide range of calculations of their structure.  I will also show how message passing can be applied to real-world data to calculate fundamental properties such as percolation thresholds, graph spectra, and community structure, and how the fixed-point structure of the message passing equations has a deep connection with structural phase transitions in networks.

Humpback whales are iconic mammals at the top of the Antarctic food chain. Their large reserves of lipid-rich tissues such as blubber predispose them to accumulation of lipophilic contaminants throughout their lifetime. Changes in the volume and distribution of lipids in humpback whales, particularly during migration, could play an important role in the pharmacokinetics of lipophilic contaminants such as the organochlorine pesticide hexachlorobenzene (HCB). Previous models have examined constant feeding and nonmigratory scenarios. In the present study, the authors develop a novel heuristic model to investigate HCB dynamics in a humpback whale and its environment by coupling an ecosystem nutrient-phytoplankton-zooplankton-detritus (NPZD) model, a dynamic energy budget (DEB) model, and a physiologically based pharmacokinetic (PBPK) model. The model takes into account the seasonal feeding pattern of whales, their energy requirements, and fluctuating contaminant burdens in the supporting plankton food chain. It is applied to a male whale from weaning to maturity, spanning 20 migration and feeding cycles. The model is initialized with environmental HCB burdens similar to those measured in the Southern Ocean and predicts blubber HCB concentrations consistent with empirical concentrations observed in a southern hemisphere population of male, migrating humpback whales.