Prof. Dr. Alexander Shnirelman (Concordia University)
Some problems of Mathematical Fluid Dynamics abstract
Abstract:
Ideal incompressible fluid is one of the most fundamental models inthe continuum mechanics. The fluid flow is described by the Euler-Lagrange equations which, in spite of their apparent simplicity, are among the toughest in the whole mathematics. No wonder that the study of these equations involves many different mathematical structures, and requires a stereoscopic approach to capture the full picture. In these lectures I\'ll propose variousviewpoints on the fluid. Here are the topics of the lectures.1. Analyticity properties of the flows of the ideal incompressible fluid. Complex singularities, their persistence and propagation.2. Singularities of solutions, their propagation and evolution. Exponential map as an elliptic paradifferential operator. Microlocal integrals and Liapunov functions. Global geometrical structure of the group of volumepreserving diffeomorphisms and the exponential map.3. Two-point problem for the Euler-Lagrange equations. Surjectivity of the exponential map in 2-d, and pathologies in 3-d.4. Braids and flows. Length minimizing braids and weak solutions in 2-d. Minimal folded braids and the inverse cascade solutions.5. Generalized flows and weak solutions of the Euler equations. Models of turbulent cascade.6. Long-time behavior of solutions of the Euler equations and the existence of a non-trivial attractor.
10:00 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Misha Sharir (Tel Aviv University)
Eliminating depth cycles for lines and triangles, with applications to bounding incidences abstract
Abstract:
The talk presents three related results. We first consider the problem of eliminating all depth cycles in a set of n lines in 3-space. For two lines l_1, l_2 in 3-space (in general position), we say that l_1 lies below l_2 if the unique vertical line that meets both lines meets l_1 at a point below the point where it meets l_2. This depth relationship typically has cycles, which can be eliminated if we cut the lines intosmaller pieces. A 25-year old problem asks for a sharp upper bound on the number of such cuts.We show that this can be done with O(n^{3/2} polylog(n)) cuts, almost meeting the known worst-caselower bound Omega(n^{3/2}). The second topic extends the previous result to eliminating depth cycles in a set of pairwise disjoint triangles in 3-space. (This is the "real" problem one would like to solve, motivated by applications to computer graphics.) The depth relationship is defined in an analogous manner, and cycles can be eliminated by cutting the triangles into simply-shaped pieces for which thedepth relationship is acyclic. A well known (albeit non-trivial) way of doing this is to usea binary space partition, which produces quadratically many cuts (into triangular pieces).We extend the cycle elimination result for lines to this setup, and show that all depth cyclescan be eliminated by cutting the triangles into O(n^{3/2+eps}) pieces, for any eps>0, whereeach piece is a semialgebraic region of constant complexity (where this complexity depends on eps).The extension is fairly involved, as it needs to use fairly sophisticated topological arguments(unnecessary for the case of lines) to control the number of pieces. The third topic is based on a straightforward, albeit technically demanding, extension of the first result to eliminating cycles in a set of n algebraic arcs of constant degree in 3-space, with a similar upper bound, close to n^{3/2}, on the number of required cuts. Combining this with a recent idea of Ellenberg, Solymosi, and Zahl, we obtain new incidence bounds for points and arbitrary fixed-degree algebraic curves in the plane. All these developments are based on the polynomial partitioning technique of Guth and Katz, and constitute a somewhat "unorthodox" application of this tool, which we hope will have follow-up applications of a similar nature. Based on joint works with Boris Aronov, Ed Miller, and Joshua Zahl.
11:00 • EPF Lausanne, Salle MA B1 524
Adam Thomas (University of Bristol)
The Jacobson-Morozov Theorem and complete reducibility of Lie subalgebras abstract
Abstract:
The well-known Jacobson--Morozov Theorem states that every nilpotent element of a complex semisimple Lie algebra Lie(G) can be embedded in an sl_2-subalgebra. Moreover, a result of Kostant shows that this can be done uniquely, up to G-conjugacy. Much work has been done on extending these fundamental results to the modular case when G is a reductive algebraic group over an algebraically closed field of characteristic p > 0. I will discuss joint work with David Stewart, proving that the uniqueness statement of the theorem holds in the modular case precisely when p is larger than h(G), the Coxeter number of G. In doing so, we consider complete reducibility of subalgebras of Lie(G) in the sense of Serre/McNinch.
15:00 • EPF Lausanne, Sallet BI A0 448
Prof. Dr. Alessio Porretta (Università di Roma "Tor Vergata")
Long time behavior of mean field games abstract
Abstract:
Mean field games theory, introduced by J.-M. Lasry and P.-L.Lions in 2006,describes the limit of Nash equilibria in N-persons differential gameswhen the number of agents N tends to infinity.The mean field limit leads to a forward-backward system of PDEs couplingHamilton-Jacobi with Fokker-Planck equations, which macroscopicallydescribes a stochastic optimization problem in finite horizon, in whichthe strategy depends on the distribution law of the controlled dynamics.In this talk I will discuss the limit of mean field games systems as thehorizon T tends to infinity, explaining how the ergodic behavior of thesystem can be described and in which sense a convergence to a stationaryproblem is observed. Such a study points out the connections withso-called turnpike solutions in optimal control problems and to uncouplingmethods in mean field games systems.
15:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Yusuke Kuno (Tsuda College, Japan)
1-cocycles on the fatgraph complex abstract
Abstract:
The fatgraph complex associated to an oriented surface can be seen as a combinatorial model for the Teichmuller space and the mapping class group action on it. It\'s study has a number of applications to the cohomology of the mapping class group and the moduli space. In 2008, Morita and Penner gave a 1-cocycle on the fatgraph complex, which provides an explicit cocycle for the extended first Johnson homomorphism. Since then there have been known several other constructions of 1-cocycles related to twisted cohomology classes of the mapping class group. In this talk, we first review these 1-cocycles. Then we discuss a certain secondary object coming from the comparison of the Morita-Penner cocycle and a cocycle introduced by Penner, Turaev and the speaker in 2013. We will also mention a construction of spin structures on a once bordered surface from a trivalent fatgraph spine on it, and relate this construction with our secondary object.
15:30 • Université de Genève, Villa Battelle, 7 route de Drize, 1227 Carouge
Bob Oliver (Université Paris 13)
16:15 • EPF Lausanne, Sallet BI A0 448
Dr. Wim Hordijk (Universität Wien)
Autocatalytic Sets: The Origin and Organization of Life abstract
Abstract:
Life is a chemical reaction. Or, more precisely, life is a functionally closed and self-sustaining chemical reaction network. In other words, living systems produce their own components, in such a way as to maintain and regulate the chemical reaction network that produced them. During the 1970s, several researchers independently developed formal models of a minimal living system based on the above definition. However, most of these models do not explain how these systems could have emerged spontaneously from basic chemistry. They provide insights into the organization of life, but not necessarily its origin. Now, a new mathematical framework, based on the original notion of autocatalytic sets, is able to shed more light on both of these aspects. Autocatalytic sets capture the functionally closed and self-sustaining properties of life in a formal way, and detailed studies have shown how such sets emerge spontaneously, and can then evolve further, in simple models of chemical reaction networks. Furthermore, this new framework has been applied directly and successfully to real chemical and biological networks. Thus, the autocatalytic sets framework provides a useful and formal tool for studying and understanding both the origin and organization of life. In this talk, I will give a non-technical overview of the background, concepts, and main results of the formal framework, and how it can perhaps be generalized beyond chemistry and the origin of life to entire living systems, ecological networks, and possibly even social systems like the economy.
17:15 • Université de Fribourg, room Phys 2.52
Prof. Dr. Eitan Tadmor (University of Maryland + ETH-ITS)
Collective dynamics: emergence of consensus and social hydrodynamics abstract
Abstract:
Prototypical models for collective dynamics are found in opinion dynamics, flocking, self-organization of biological organisms, and rendezvous in mobile networks.They are driven by the “social engagement” of agents with their local neighbors.We discuss the emergent behavior of such systems. Their large-time behavior leads to the emergence of different patterns, depending on the propagation of connectivity of the underlying graphs. In particular, global interactions lead to the emergence of consensus, leaders etc. The collective dynamics of large crowds of agents lend itself to “social hydrodynamics”, driven by the corresponding local means. We discuss the global regularity of social hydrodynamics for sub-critical initial configurations.
17:15 • UZH Zentrum, Building KO2, Room F 150