Anibal Maximiliano Medina-Mardones (EPF Lausanne)
An effective Proof of the Cartan Formula abstract
Abstract:
The Cartan formula encodes the relationship between the cup product and the action of the Steenrod algebra in F_p-cohomology. In this work, we present an effective proof of the Cartan formula at the cochain level when the field is F_2. More explicitly, for an arbitrary pair of cocycles and any non-negative integer, we construct a natural coboundary that descends to the associated instance of the Cartan formula. Our construction of Cartan coboundaries works for general algebras over the Barratt-Eccles operad, in particular, for the singular cochains of spaces, a case that has been used in condensed mater physics and for which we have developed open source software.
10:15 • EPF Lausanne, Salle CM 011
Luis Paris (Université de Dijon)
Commensurabilité dans les groupes d\'Artin abstract
Abstract:
En collaboration avec Maria Cumplido Cabello.
Un groupe d\'Artin est par définition un groupe donné par une présentation avec des relations de la forme $sts \\cdots = tst \\cdots$, où le mot de gauche et celui de droite ont la même longueur. Ces groupes ont été introduits dans les années 60 par Tits et interviennent dans différents domaines des mathématiques telles que les singularités, la topologie de basse dimension, la physique mathématique ou la géométrie des groupes. Il existe peu de résultats englobant la totalité des groupes d’artie et la théorie consiste surtout en l\'étude de familles précises. Les deux familles les plus étudiées sont celle des groupes d’artie à angles droits (RAAG) et celle des groupes d\'Artin de type sphérique. C\'est cette dernière famille qui nous intéresse. Deux groupes $G_1$ et $G_2$ sont dits commensurables s\'il existe des sous-groupes d\'indice fini $H_1$ de $G_1$ et $H_2$ de $G_2$ tels que $H_1$ soit isomorphe à $H_2$. Une classification des présentations des groupes d\'Artin de type sphérique se déduit immédiatement d\'un travail de Coxeter datant des années 30. La classification à isomorphisme près date 2004. La classification à commensurabilité près sera l\'objet de notre travail et de notre présentation.
10:30 • Université de Genève, Section Mathématiques, 2-4, rue du Lièvre, Salle 623
Caio Alves (Universität Leipzig)
Decoupling inequalities in loop percolation
10:30 • Université de Fribourg, room PER 12 0.101
Anne Lonjou (Universität Basel)
Actions of Cremona groups on CAT(0) cube complexes abstract
Abstract:
not available. Recently in geometric group theory, actions on CAT(0) cube complexes turned out to be a powerfull tool to study a large class of groups.
In this talk, based on a common work with Christian Urech, we will construct such complexes on which Cremona groups of rank n act. We will then see which kind of results on these groups we can obtain.
10:30 • Universität Basel, Fachbereich Mathematik, Spiegelgasse 1, Seminar Room 00.003
Tim Boonen (University of Amsterdam)
Optimal (re)insurance risk sharing: strategic behavior and competitive pricing abstract
Abstract:
Risk sharing and optimal reinsurance arrangements have been substantially studied in the literature. Main focusses in the literature are on generalizing objective functions and incorporating more business constraints. In this talk, I will propose a bilateral risk sharing framework in reinsurance with translation invariant preferences of the agents involved. I will propose a game where insurance agents can misrepresent their risk aversion in order to alter the price. All individual rational prices constitute a Nash equilibrium. Moreover, the Stackelberg equilibria turn out to be the specific Nash equilibria where welfare gains are "allocated" to the leader of the game (typically the reinsurer, who sets the prices). I extend this idea to the case with multiple reinsurers, where the reinsurers determine the premium in a competitive manner. This leads to a specific strategic, core-type constraint, and I show the competitive prices in closed-form in case the insurance agents minimize a distortion risk measure.
11:00 • Université de Lausanne, Quartier UNIL - Extranef 125
David Kotz (Dartmouth College, USA)
Amulet and Auracle: Wearable Platforms for mHealth Research abstract
Abstract:
The advent of mobile and wearable computing technology has made it increasingly possible for individuals to wear devices that can sense their physiology or health-related behaviors, collecting valuable data in support of diagnosis, treatment, public health, or other applications. In this talk, we describe two research-grade platforms developed in our lab: Amulet and Auracle. The Amulet platform is an open-hardware, open-software wrist-worn computing device designed specifically for mHealth applications; we provide an overview of the platform and of several applications to research. The Auracle is a wearable earpiece that can automatically recognize eating behavior. More specifically, in free-living conditions, Auracle seeks to recognize when and for how long a person is eating. Our experiments show Auracle can achieve accuracy exceeding 92.8% and F1 score exceeding 77.5% for eating detection. Moreover, Auracle successfully detected 20-24 eating episodes (depending on the metrics) out of 26 in free-living conditions.
12:15 • Universität Basel, Fachbereich Mathematik, Spiegelgasse 2, Seminar Room 05.002
Marc-Arthur N\'Guessan (EPF Lausanne)
Space adaptive methods with error control based on adaptive multiresolution for incompressible flows abstract
Abstract:
We address the development of new numerical methods for the efficient resolution of stiff Partial Differential Equations modelling multi-scale low-Mach reacting flow processes. In this general context, this work introduces dedicated numerical tools for the resolution of the incompressible Navier-Stokes equations, an important first step when designing an hydrodynamic solver for low-Mach flows. We build a space adaptive numerical scheme to solve incompressible flows in a finite-volume context, that relies on multiresolution analysis with error control. To this end, we introduce a new collocated finite-volume method on adaptive rectangular grids, with an original treatment of the spurious pressure and velocity modes that does not alter the precision of the discretization technique. The adaptive spatial discretization is coupled to a new 3rd-order additive Runge-Kutta method for the incompressible Navier-Stokes equations, combining a 3rd-order, A-stable, stiffly accurate, 4-stage ESDIRK method for the algebraic linear part of these equations, and a 4th-order explicit Runge-Kutta scheme for the nonlinear convective part. We assess the capabilities of this new hydrodynamic solver in terms of speed and efficiency, in the context of scalar transport on adaptive grids.
14:00 • Université de Genève, Section Mathématiques, Centre Acacias II, Salle 623
Leonid Rybnikov (HSE Moscow)
Gaudin model, opers and crystals - Lecture 1 abstract
Abstract:
In this mini-course I will explain quantization and Bethe ansatz for Gaudin model (following classical work of Feigin, Frenkel and Reshetikhin and more recent works of Feigin, Frenkel, Toledano Laredo and myself). If time allows, I will mention recent results (joint with Iva Halacheva, Joel Kamnitzer and Alex Weekes) relating Bethe ansatz to Kashiwara crystals. More detailed plan is below:
Lecture 1.
Classical Gaudin model. Quantization problem. Quantum Hamiltonians from the center of g^ on the critical level. Opers on the projective line as eigenvalues of Gaudin Hamiltonians. Bethe ansatz and the completeness problem. (Main reference: Boris Feigin, Edward Frenkel, Nikolai Reshetikhin, Gaudin Model, Bethe Ansatz and Critical Level arXiv:hep-th/9402022).
15:00 • Université de Genève, Villa Battelle, 7 route de Drize, 1227 Carouge
Nina Holden (ETH Zürich)
Trace reconstruction for bit strings abstract
Abstract:
In the trace reconstruction problem, an unknown string $x$ of $n$ bits is observed through the deletion channel, which deletes each bit with some constant probability $q\\in(0,1)$, yielding a contracted string. How many independent outputs (traces) of the deletion channel are needed to reconstruct $x$ with high probability?
In a joint work with Pemantle and Peres we prove that $\\exp(O(\\log^{1/3}n))=n^{o(1)}$ traces are sufficient if the bits of the input string were chosen uniformly and independently at random. This improves the earlier upper bounds of $\\exp(O(\\log^{1/2}n))$ for $q<1/2$ and $\\exp(O(n^{1/3}))$ for $q\\geq 1/2$. In a follow-up work also with Zhai we argue that the running time of our reconstruction algorithm is n^{o(1)}. In a joint work with Lyons we improve the lower bound for arbitrary strings from $\\Omega(n)$ traces to $\\tilde\\Omega(n^{5/4})$ traces.
15:15 • EPF Lausanne, Salle INF 213
Michael Schaub (University of Oxford)
Signal processing and random walks on simplicial complexes abstract
Abstract:
In many applications, we are confronted with with signals defined on the nodes of a graph.Think for instance of a sensor network measuring temperature; or a social network, in which each person has an opinion about a specific issue. Graph signal processing (GSP) tries to device appropriate tools to process such data by generalizing classical methods from signal processing of time-series and images — such as smoothing, filtering and interpolation — to signals defined on graphs. Typically, this involves leveraging the structure of the graph as encoded in the spectral properties of the graph Laplacian.
In applications such as traffic network analysis, however, the signals of interest are naturally defined on the edges of a graph, rather than on the nodes. After a brief introduction to the ideas of GSP, we examine why the standard tools from GSP may not be suitable for the analysis of such edge signals. More specifically, we discuss how the underlying notion of a ‘smooth signal’ inherited from (the typically considered variants of) the graph Laplacian are not suitable when dealing with edge signals that encode a notion of flow. To overcome this limitation we devise signal processing tools based on the Hodge 1-Laplacian and discrete Hodge Theory. We first discuss how these tools can be applied for signal smoothing, semi-supervised and active learning for edge-signals on graphs. We then explore connections of these signal processing tools to random walks on graphs and simplicial complexes, and give alternative interpretations of our previously derived methods in terms of diffusion processes on simplicial complexes.
16:15 • EPF Lausanne, Salle MA B2 485
Davide Spriano (ETHZ)
What are.. the ends of a group? abstract
Abstract:
The key idea of geometric group theory is to treat groups as metric spaces and to find correspondences between algebraic and geometric properties. In this introductory talk, we will survey some basic construction and define the number of ends of a group. This is a simple, intuitive geometric invariant which has, nevertheless, deep consequences. A consequence of particular interest on which we will focus is Stalling\'s theorem about splittings over finite groups.
16:30 • UZH Zentrum, Building KO2, Room F 150