Past

The concept of pseudofinite dimension for ultraproducts of finite structures was introduced by Hrushovski and Wagner. In this talk, I will present joint work with D. Macpherson and C. Steinhorn in which we explored conditions on the (fine) pseudofinite dimension that guarantee simplicity or supersimplicity of the underlying theory of an ultraproduct of finite structures, as well as a characterization of forking in terms of droping of the pseudofinite dimension. Also, under a suitable assumption, it can be shown that a measure-theoretic condition is equivalent to loc

Let $a_1, \cdots, a_N$ be the sequence of y-smooth numbers up to x (i.e. composed only of primes up to y). When y is a small power of x, what can one say about the size of the gaps $a_{j+1}-a_j$? In particular, what about

$$\sum_1^N (a_{j+1}-a_j)^2?$$

We focus on the mathematical structure of systemic risk measures as proposed by Chen, Iyengar, and Moallemi (2013). In order to clarify the interplay between local and global risk assessment, we study the local specification of a systemic risk measure by a consistent family of conditional risk measures for smaller subsystems, and we discuss the appearance of phase transitions at the global level. This extends the analysis of spatial risk measures in Föllmer and Klϋppelberg (2015).

Our everyday usage of the Internet generates huge amounts of data on how humans collect and exchange information worldwide. In this talk, I will outline recent work in which we investigate whether data from sources such as Google, Wikipedia and Flickr can be used to gain new insight into real world human behaviour. I will provide case studies from a range of domains, including disease detection, crowd size estimation, and evaluating whether the beauty of the environment we live in might affect our health.

For linear dynamical systems, model reduction has achieved great success. In the case of linear dynamics,  we know how to construct, at a modest cost, (locally) optimal, input-independent reduced models; that is, reduced models that are uniformly good over all inputs having bounded energy. In addition, in some cases we can achieve this goal using only input/output data without a priori knowledge of internal  dynamics.  Even though model reduction has been successfully and effectively applied to nonlinear dynamical systems as well, in this setting,  bot the reduction process and the reduced models are input dependent and the high fidelity of the resulting approximation is generically restricted to the training input/data. In this talk, we will offer remedies to this situation.

We will explore the many guises under which groups of 2x2 matrices appear, such as isometries of the hyperbolic plane, mapping class groups and the modular group. Along the way we will learn some interesting and perhaps surprising facts.

A Steiner Triple System on a set X is a collection T of 3-element subsets of X such that every pair of elements of X is contained in exactly one of the triples in T. An example considered by Plücker in 1835 is the affine plane of order three, which consists of 12 triples on a set of 9 points. Plücker observed that a necessary condition for the existence of a Steiner Triple System on a set with n elements is that n be congruent to 1 or 3 mod 6. In 1846, Kirkman showed that this necessary condition is also sufficient. In 1974, Wilson conjectured an approximate formula for the number of such systems. We will outline a proof of this
conjecture, and a more general estimate for the number of Steiner systems. Our main tool is the technique of Randomised Algebraic Construction, which
we introduced to resolve a question of Steiner from 1853 on the existence of designs.

I will present a definition of symplectic homology groups for pairs of Liouville cobordisms with fillings, and explain how these fit into a formalism of homology theory similar to that of Eilenberg and Steenrod. This construction allows to understand form a unified point of view many structural results involving Floer homology groups, and yields new applications. Joint work with Kai Cieliebak.

We purify and generalize some techniques which were successful in the limit theory of graphs and other discrete structures. We demonstrate how this technique can be used for solving different combinatorial problems, by defining the limit problems of the Manickam--Miklós--Singhi Conjecture, the Kikuta–Ruckle Conjecture and Alpern's Caching Game.

we study a new mechanism of reaction-diffusion involving a line with fast diffusion, proposed to model the influence of transportation networks on biological invasions. 
We will be interested in the existence and uniqueness of traveling waves solutions, and especially focus on their velocity. We will show that it grows as the square root of the diffusivity on the line, generalizing and showing the robustness of a result by Berestycki, Roquejoffre and Rossi (2013), and provide a characterization of the growth ratio thanks to an hypoelliptic (a priori) degenerate system. 
Finally we will take a look at the dynamics and show that the waves attract a large class of initial data. In particular, we will shed light on a new mechanism of attraction which enables the waves to attract initial data with size independent of the diffusion on the line : this is a new result, in the sense than usually, enhancement of propagation has to be paid by strengthening the assumptions on the size of the initial data for invasion to happen.

We consider families of fast-slow skew product maps of the form \begin{align*}x_{n+1}   = x_n+\eps^2 a_\eps(x_n,y_n)+\eps b_\eps(x_n)v_\eps(y_n), \quad

y_{n+1}   = T_\eps y_n, \end{align*} where $T_\eps$ is a family of nonuniformly expanding maps, $v_\eps$ is of mean zero and the slow variables $x_n$ lie in $\R^d$.  Under an exactness assumption on $b_\eps$ (automatically satisfied in the cases $d=1$ and $b_\eps\equiv I_d$), we prove convergence of the slow variables to a limiting stochastic differential equation (SDE) as $\eps\to0$.   Our results include cases where the family of fast dynamical systems

$T_\eps$ consists of intermittent maps, unimodal maps (along the Collet-Eckmann parameters) and Viana maps.Similar results are obtained also for continuous time systems  \begin{align*} \dot x   =  \eps^2 a_\eps(x,y,\eps)+\eps b_\eps(x)v_\eps(y), \quad \dot y   =  g_\eps(y). \end{align*}

Here, as in classical Wong-Zakai approximation, the limiting SDE is of Stratonovich type $dX=\bar a(X)\,dt+b_0(X)\circ\,dW$ where $\bar a$ is the average of $a_0$

and $W$ is a $d$-dimensional Brownian motion.

I am going to discuss Rips' conjecture that all finitely presented groups with quadratic Dehn functions have decidable conjugacy problem.

This is a joint work with A.Yu. Olshanskii.
 

This talk will be about  Lévy processes on compact groups - discrete or continuous - and  two-dimensional analogues called pure Yang-Mills fields. The latter are indexed by  reduced loops of finite length in the plane and satisfy properties analogue to independence and stationarity of increments.     There is a one-to-one correspondance between Lévy processes invariant by adjunction and pure Yang-Mills fields. For Brownian motions, Yang-Mills fields stand for a rigorous version of the Euclidean Yang-Mills measure in two dimension.  I shall first sketch this correspondance for  Lévy processes with large jumps. Then, I will discuss two applications of an extension theorem, due to Thierry Lévy, similar to Kolmogorov extension theorem. On the one hand, it allows to construct pure Yang-Mills fields for any invariant Lévy process. On the other hand, when the group acts on vector spaces of large dimension, this theorem also allows to study the asymptotic behavior  of traces. The limiting objects yield a natural family of states on the group algebra of reduced loops.  We characterize among them the master field defined by Thierry Lévy by a continuity property.   This is  a joint work with Guillaume Cébron and Franck Gabriel.