Craig Evans (University of California, Berkeley)
Weak Convergence Methods for Nonlinear Partial Differential Equations abstract
Abstract:
This course will be an ambitious survey of rigorous methods for understanding solutions (u^\\epsilon) of various nonlinear PDE in various asymptotic limits. Assuming in particular that the (u^\\epsilon) converge weakly as (\\epsilon \\to 0), we want to identify what PDE the weak limit (u) solves. This can be a hugely complicated problem, since the weak convergence is usually incompatible with the nonlinearities; but a rich variety modern techniques can handle these issues for many interesting cases. The lectures will discuss recent developments concerning
(i) asymptotics for ODE,
(ii) maximum principle methods,
(iii) convexity and monotonicity,
(iv) oscillations and compensated compactness, and
(v) defect measures, with many examples and applications.
10:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Stefano Riolo (Université de Neuchâtel)
Non-spinnable hyperbolic manifolds abstract
Abstract:
Let\'s say that a manifold is "spinnable" if it admits a spin structure. (Every manifold here is smooth, connected, closed, and orientable.) Unlike higher-dimensional manifolds, every surface or 3-manifold is spinnable. Let\'s now focus on hyperbolic manifolds. By a work of Deligne and Sullivan (1975), every hyperbolic manifold is finitely covered by a spinnable manifold. On the other hand, we will see that there exist non-spinnable hyperbolic manifolds of all dimensions bigger than three. Joint work with B. Martelli and L. Slavich.
10:30 • Université de Genève, Section Mathématiques, 2-4, rue du Lièvre, Salle 623
Antje Berndt (Australian National University)
Dealer Inventory, Short Interest and Price Efficiency in the Corporate Bond Market abstract
Abstract:
We propose an equilibrium model of over-the-counter corporate bond trading with short selling, asymmetric information and dealer inventory costs. The model predicts that higher inventory costs impose implicit short-sale constraints and are thus associated with lower price efficiency. We construct bond-level proxies for inventory costs and provide empirical evidence in support of the model\'s prediction. Our findings suggest that tighter post-GFC regulation may have had unintended consequences for corporate bond market quality.
10:30 • EPF Lausanne, Quartier UNIL - Dorigny, Salle Extranef 126
Konstantin Kokhas (St. Petersburg University)
For which graphs the sages can guess correctly the color of at least one hat? abstract
Abstract:
Several sages wearing colored hats occupy the vertices of a graph. Each sage tries to guess the color of his own hat merely on the basis of observing the hats of his neighbours without exchanging any information. A predetermined guessing strategy is winning if it guarantees at least one correct individual guess for every assignment of colors. We consider deterministic variant of the game in which the number of colors for each sage is given by a "hat function" on the set of vertices.
In the talk I will explain for which hat functions the sages can win on cliques, describe graphs for which the sages win if the hat function equas 3 in each vertex, and discuss how to construct "complicated" winning graphs starting with "simple" graphs. We will also consider a computational approach to the problem: how to reduce the question on the existence of winning strategies on graphs to the Boolean satisfability problem (SAT).
11:00 • Université de Genève, Villa Battelle, 7 route de Drize, 1227 Carouge
Ilka Agricola (Universität Marburg)
Lectures on geometric connections and their holonomy theory, Part II abstract
Abstract:
This series of lectures gives a gentle introduction into metric connections with torsion on Riemannian manifolds and how they can be used to investigate geometric structures on the underlying manifolds - like almost hermitian manifolds, contact manifolds, G_2 and Spin(7)-manifolds. Homogeneous spaces will turn out to play a crucial role herein - in the motivation of concepts, as a rich playground of examples, and just as much for applications like the classification of naturally reductive spaces. Further highlights will be the skew holonomy theorem and the investigation of strongly positive curvature.
15:00 • Université de Genève, Villa Battelle, 7 route de Drize, 1227 Carouge
Naya Yerolemou (University of Oxford)
Equivariant simplicial reconstruction abstract
Abstract:
We will answer the following question: given a finite simplicial complex X acted on by a finite group G, which object stores the minimal amount of information about the symmetries of X in such a way that we can reconstruct both X and the group action? The natural first guess would be the quotient X/G, which remembers one representative from each orbit. However, it does not tell us the size of each orbit or how to glue together simplices to recover X. Our desired object is, in fact, a complex of groups. We will understand two processes: compression and reconstruction, see through an example how to answer our initial question and briefly discuss some applications.
16:15 • EPF Lausanne, Campus Biotech
Prof. Dr. Peter Feller (ETH Zürich)
Inscribed rectangles, Knots, and Möbius bands abstract
Abstract:
Does every Jordan curve in the Euclidian plane contain 4 points that form the corners of a square? Starting from this old metric problem posed by Toeplitz a hundred years ago, we discuss problems in low-dimensional topology. The talk will feature:
- knots, embedded circles in 3-dimensional space,
- disks and Möbius bands in 4-dimensional space, and-
- a recent translation due to Hugelmeyer recasting Toeplitz\' question as a problem about knots and Möbius bands.
No prior knowledge of low-dimensional topology will be assumed.
17:15 • Université de Fribourg, room Phys 2.52
Gianira Nicoletta Alfarano (Universität Zürich)
What is... a convolutional code? abstract
Abstract:
The theory of error-correcting codes has inspired many mathematicians who were interested in applying techniques from algebra and discrete mathematics in order to progress on questions in information processing. Convolutional codes were introduced in 1955 by Peter Elias, as an interesting natural generalization of classical block codes and they have been widely implemented in practice with applications in mobile communications, satellite communications and data streaming. In this talk, we are going to introduce the theory of error-correcting codes and the classical theory of linear block codes. Then, we will give a mathematical description of convolutional codes, by using module theory over a polynomial ring and we will discuss their most important parameters.
17:15 • UZH Zentrum, Building KO2, Room F 150