Évènements

The stochastic dynamic matching problem has recently drawn attention in the stochastic-modeling community due to its numerous applications, ranging from supply-chain management to kidney exchange programs. In this presentation, we consider a matching problem in which items of different classes arrive according to independent Poisson processes, unmatched items are stored in a queue, and compatibility constraints are described by a simple graph on the classes, so that two items can be matched if their classes are neighbors in the graph. We analyze the efficiency of matching policies, not only in terms of system stability, but also in terms of matching rates between different classes. Our results rely on the observation that, under any stable policy, the matching rates satisfy a conservation equation that equates the arrival and departure rates of each item class.

This presentation is based on a joint work with Fabien Mathieu (LINCS) and Ana Bušić (Inria and PSL University). A preprint is available at the following address: https://arxiv.org/abs/2112.14457.

In the past decades a kind of « quantum mathematics » has evolved as a more and more coherent theory. It contains, amongst others, C*-algebras (aka noncommutative topology), von Neumann algebras (aka noncommutative measure theory), Connes’s noncommutative (differential) geometry, Voiculescu’s free probability theory and many more. In this mostly analytic setting, Woronowicz’s quantum groups provide a suitable notion of quantum symmetry.
In this talk, we will give a pedestrian approach to quantum symmetries: We will introduce quantum permutations purely in the language of linear algebra and sketch its use in graph theory (see for instance an exciting extension of Lovasz’ homomorphism counts theorem from the 1960s). On the way, we will briefly mention the broader context of quantum mathematics, quantum groups and some links to quantum information theory. We will try to keep the talk quite algebraic and combinatorial and we will avoid too many details from analysis.

La décomposabilité géométrique  pour un groupoïde peut-être vue comme une forme d’implémentation de la technique de « cut-and-pasting » utilisée par G. Yu dans sa preuve de la conjecture de Novikov pour les groupes de dimension  asymptotique finie.

Dans cet exposé, nous introduirons tout d’abord ce concept de décomposabilité, puis nous établirons le lien avec la dimension asymptotique et plus généralement avec la notion de décomposabilité  à complexité finie pour un espace métrique. Nous donnerons des applications à la moyennabilité des groupoïdes (en particulier à celle des actions de groupes). Si le temps nous le permet nous discuterons d’applications à la calculabilité en K-théorie (en particulier à la conjecture de Baum-Connes).