A fundamental theorem of Wilson states that, for every graph $F$, every sufficiently large $F$-divisible clique has an $F$-decomposition. Here $G$ has an $F$-decomposition if the edges of $G$ can be covered by edge-disjoint copies of $F$ (and $F$-divisibility is a trivial necessary condition for this). We extend Wilson's theorem to graphs which are allowed to be far from complete (joint work with B. Barber, D. Kuhn, A. Lo).

I will also discuss some results and open problems on decompositions of dense graphs and hypergraphs into Hamilton cycles and perfect matchings.

Studies of thermal convection in planetary interiors have largely focused on convection above the critical Rayleigh number. However, convection in planetary mantles and crusts can also occur under subcritical conditions. Subcritical convection exhibits phenomena which do not exist above the critical Rayleigh number. One such phenomenon is spatial localization characterized by the formation of stable, spatially isolated convective cells. Spatial localization occurs in a broad range of viscosity laws including temperature-dependent viscosity and power-law viscosity and may explain formation of some surface features observed on rocky and icy bodies in the Solar System.

We revisit the optimal exit problem by adding a moral hazard problem where a firm owner contracts out with an agent to run a project. We analyse the optimal contracting problem between the owner and the agent in a Brownian framework, when the latter modifies the project cash-flows with an hidden action. The analysis leads to the resolution of a constrained optimal stopping problem that we solve explicitly.

We consider the problem of unveiling the implicit network structure of user interactions in a social network, based only on high-frequency timestamps. Our inference is based on the minimization of the least-squares loss associated with a multivariate Hawkes model, penalized by $\ell_1$ and trace norms. We provide a first theoretical analysis of the generalization error for this problem, that includes sparsity and low-rank inducing priors. This result involves a new data-driven concentration inequality for matrix martingales in continuous time with observable variance, which is a result of independent interest. The analysis is based on a new supermartingale property of the trace exponential, based on tools from stochastic calculus. A consequence of our analysis is the construction of sharply tuned $\ell_1$ and trace-norm penalizations, that leads to a data-driven scaling of the variability of information available for each users. Numerical experiments illustrate the strong improvements achieved by the use of such data-driven penalizations.

I will introduce the general idea of p-adic Hodge theory from the view point of a beginner. Also, I will give a sketch of the proof of the crystalline comparison theorem in the case of good reduction using 'almost mathematics'.

We will give a sketch overview of Scholze's theory of perfectoid spaces and the tilting equivalence, starting from Huber's geometric approach to valuation theory. Applications to weight-monodromy and p-adic Hodge theory we will only hint at, preferring instead to focus on examples which illustrate the philosophy of tilting equivalence.
 

In this talk I will describe two instances of Langlands functoriality concerning the group $\mathrm{Sp}_{2n}$. I will then very briefly explain how this enables one to attach Galois representations to automorphic representations of (inner forms of) $\mathrm{Sp}_{2n}$.