Felix Otto (Max-Planck-Institut für Mathematik, Leipzig)
Stochastic homogenization abstract
Abstract:
In engineering applications, heterogeneous media are often described in statistical terms. This partial knowledge is sufficient to determine the effective, i.e. large-scale behavior. This effective behavior may be inferred from the Representative Volume Element (RVE) method. I report on last decades progress on the quantitative understanding of what is called stochastic homogenization of linear elliptic partial differential equations with random coefficient fields: optimal error estimates of the RVE method and the homogenization error, and the leading-order characterization of fluctuations. Methods connect to elliptic regularity theory, and in fact lead to a fresh look upon this classical area, and to concentration of measure arguments.In this course, I try to be both self-contained and efficient, by focussing on simple situations. Some prior knowledge on linear elliptic equations and functional analysis will be more helpful than advanced knowledge on probability theory, beyond elementary concepts like expectation or variance.
10:00 • online
Celia Hacker (EPF Lausanne)
Abstract:
Given the success of single-parameter persistence in data analysis and the fact that some systems warrant analysis across multiple parameters, it is highly desirable to develop data analysis pipelines based on multi-parameter persistence in order to study multi-variate data. One of the simplest invariants for a multi-parameter persistence module is its rank invariant, defined as the function that counts the number of linearly independent homology classes that live in the filtration through a given pair of values of the multi-parameter.
In this talk, we will discuss how discrete Morse theory may be used to compute the rank invariant for a multi-parameter persistence module. We will show that the rank invariant of a persistence module is completely determined by its values at points whose coordinates are critical, with respect to a discrete Morse function. These critical points partition the set of all lines in the parameter space into equivalence classes, such that the rank invariant along lines in the same class are also equivalent. We will show that we can deduce all persistence diagrams of rank invariants of a given class from the persistence diagram of a representative rank invariant in that class. This is joint work with the WinCompTop group lead by Claudia Landi.
13:15 • EPF Lausanne, Zoom Seminar
Prof. Dr. Felix Otto (MPI-MIS Leipzig)
The thresholding scheme for mean curvature flow and De Giorgi\'s ideas for gradient flows abstract
Abstract:
Flow of interfaces by mean curvature, in its multi-phase version,was first formulated in the context of grain growth in polycrystalline materials. The computationally efficient and very popular thresholding schemefor mean curvature flow by Osher et. al. can be naturally extended to such a multi-phase situation, even for surface tensions that depend on the lattice mismatch between the adjacent grains.This extension relies on the gradient flow structure of mean curvature flow, and the interpretation of the thresholding schemeas a corresponding ``minimizing movements\'\' scheme, that is, a sequence of variational problemsnaturally attached to the implicit time discretization of a gradient flow.This interpretation also allows for a (conditional) convergence proof based on De Giorgi\'s ideas for gradient flows in metric spaces. The approach is similar to the convergence proof for the minimizing movement scheme by Almgren, Taylor and Wang,as given by Luckhaus et. al. This is joint work with S. Esedoglu and T. Laux.
15:15 • Online via Zoom
Adrien Brochier (Université de Paris)
Abstract:
I will survey some recent work with Ben-Zvi, Jordan, Snyder and Safronov aiming at defining and constructing a certain "categorified" 3d TFT from the representation theory of the quantum group associated with a complex reductive algebraic group G. Here "categorified" means it associates a vector space (rather than a number) to a closed 3 manifold which is expected to coincide with the associated generalized skein modules. Likewise, it attaches categories to surfaces, which can be computed explicitly using factorization homology (aka skein categories) and produce canonical quantizations of character varieties, and unifies and generalizes various well-known constructions in quantum algebra.
During the first session, I\'ll review the definition and combinatorial construction of the classical character varieties and their Poisson structures. I\'ll explain this can be reformulated in the language of TFT\'s provided one uses the category of sheaves on those varieties rather than their algebras of global functions. I\'ll introduce certain tools of categorified linear algebra in order to turn this into a precise statement.
In the second session I\'ll introduce the formalism of factorization homology and explain how it recovers, as a particular case, many quantizations of character varieties and their features (e.g. Alekseev\'s "moduli algebras" and skein algebras). I\'ll then explain how to extend this construction up to dimienson 3. Time permitting I\'ll explain how this relates to the Witten--Reshetikhin--Turaev TFT.
15:30 • Université de Genève, Zoom Seminar
Christina Osborne (Cedarville University)
Abstract:
The classifying diagram was defined by Rezk and is a generalization of the nerve of a category; in contrast to the nerve, the classifying diagram of two categories is equivalent if and only if the categories are equivalent. In this talk, we will show that the classifying diagram of any category is characterized in terms of classifying spaces of stabilizers of groups. We will also prove explicit decompositions of the classifying diagrams for the categories of finite ordered sets, finite dimensional vector spaces, and finite sets in terms of classifying spaces of groups.
17:00 • EPF Lausanne, Zoom Seminar
Christophe Pittet (Université de Genève)
Abstract:
Pour quels graphes de Cayley infinis le Laplacien combinatoire possède-t-il des fonctions propres de carré sommable ? Pour les graphes de Cayley moyennables nous rappellerons le phénomène de localisation : s\'il existe une fonction propre non-nulle de carré sommable alors il existe une fonction propre non-nulle à support fini. Nous présenterons une condition géométrique qui entraîne la continuité de la densité intégrée des états. Nous illustrerons cette condition géométrique en concluant que tout groupe moyennable de type fini qui admet un homomorphisme non-trivial à valeurs dans Z (le groupe cyclique infini) admet un graphe de Cayley dont le Laplacien combinatoire n\'admet pas de fonction propre non-nulle de carré sommable. (Travail en cours avec R. Grigorchuk.)
17:00 • Université de Neuchâtel, Zoom Seminar
Onlline Seminar
Dr. Karan Khathuria (Universität Zürich)
What is.. private information retrieval? abstract
Abstract:
Have you ever wondered about how your privacy is maintained when you are accessing a public database (like Netflix or stock markets)? and what kind of request do you send to the server to access a specific file, without letting the server know which file is requested? In this talk, we will address these questions. In order to ensure that not even the owner of the database can determine the files that the user has requested, the communication between the two parties (the server and the user) is done via private information retrieval (PIR) schemes. The main aim of this talk is to introduce PIR schemes from a mathematical point of view and to discuss the known PIR schemes for different types of database settings (single-server or multiple-server). Some keywords that illustrate the kind of mathematics we will see in this talk: coding theory (= linear algebra + finite rings), complexity theory, quadratic residues, lattice theory, etc.
17:30 • Onlline Seminar