Prof. Dr. Andreas Strömbergsson (Uppsala University)
An effective equidistribution result in the space of 2-dimensional tori with k marked points abstract
Abstract:
Let X be the homogeneous space Gamma \\ G, where G is the semidirect product of SL(2,R) and a direct sum of k copies of R^2, and where Gamma is the subgroup of integer elements in G. I will present a result giving effective equidistribution of 1-dimensional unipotent orbits in the space X. The proof makes use of the delta method in the form developed by Heath-Brown. Joint work with Anders Södergren and Pankaj Vishe.
13:30 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 19.1
Prof. Dr. Alessio Sammartano (Politecnico di Milano)
Components and singularities of Hilbert schemes of points abstract
Abstract:
The Hilbert scheme of points in affine n-dimensional space parametrizes finite subschemes of a given length. It is smooth and irreducible if n is at most 2, singular and reducible if n is at least 3. Understanding its irreducible components, their singularities and birational geometry, has long been an inaccessible problem. In this talk, I will describe substantial progress on this problem achieved in recent years. In particular, I will focus on the discovery of elementary components, Murphy’s law up to retraction, and the problem of rationality of components. This is based on works of Joachim Jelisiejew and on a joint work of Gavril Farkas, Rahul Pandharipande, and myself.
13:30 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Louise Gassot (IRMAR, Rennes)
Abstract:
We focus on the Benjamin-Ono equation on the line with a small dispersion parameter. The goal of this talk is to precisely describe the solution at all times when the dispersion parameter is small enough. This solution may exhibit locally rapid oscillations, which are a manifestation of a dispersive shock. The description involves the multivalued solution of the underlying Burgers equation, obtained by using the method of characteristics. This work is in collaboration with Elliot Blackstone, Patrick Gérard, and Peter Miller.
14:15 • Universität Basel
Jessica Bariffi (Universität Zürich)
Analysis and Decoding of Linear Lee-Metric Codes with Application to Code-Based Cryptography abstract
Abstract:
In the last few decades, Lee-metric codes gained a lot of attention especially with their promising application to code-based cryptography as well as their connection to lattices. Even though, begin a rather old metric considered in coding theory, there are still many open questions regarding Lee metric codes regarding both the algebraic structure of codes in the Lee metric as well as efficient decoding algorithms. In this talk we present some selected topics on Lee-metric codes. We start by introducing generalized Lee distances in order to derive improved upper bounds on the minimum Lee distance. We discuss the derivation of the bound as well as the density of codes achieving it. In a next step we turn the attention to channel coding where we introduce two channel models in the Lee metric. At this point we specifically focus on a static channel model, introducing an error of fixed weight. We derive its marginal distribution using typical sequences. Additionally, this channel can be viewed as a design parameter to code-based cryptography and hence, the knowledge of the marginal distribution shows some implication in the field of cryptography too. Lastly, we introduce classical random low-density parity-check (LDPC) codes over a finite integer residue ring endowed with the Lee metric, and we present their expected weight enumerator.
15:15 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H 25
Tanushree Shah (University of Vienna)
Contact structures on 3-manifolds abstract
Abstract:
We will start with friendly introduction to contact structures. They come in two flavors: tight and overtwisted. Classification of overtwisted contact structures is well understood as opposed to tight contact structures. We will look into recent techniques developed to study these by understanding special knots(legendrian knots) in overtwisted 3 manifolds. We will look at what more classification results can we hope to get using the current techniques and what is far-fetched.
15:30 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Prof. Dr. Guglielmo Scovazzi (Department of Civil and Environmental Engineering, Duke University)
The Shifted Boundary Method: How Approximate Boundaries Can Help in Complex-Geometry Computations abstract
Abstract:
Scientific computing is routinely assisting in the design of systems or components, which have potentially very complex shapes. In these situations, it is often underestimated that the mesh generation process takes the overwhelming portion of the overall analysis and design cycle. If high order discretizations are sought, the situation is even more critical. Methods that could ease these limitations are of great importance, since they could more effectively interface with meta-algorithms from Optimization, Uncertainty Quantification, Reduced Order Modeling, Machine Learning, and Artificial Neural Networks, in large-scale applications.Recently, immersed/embedded/unfitted boundary finite element methods (cutFEM, Finite Cell Method, Immerso-Geometric Analysis, etc.) have been proposed for this purpose, since they obviate the burden of body-fitted meshing. Unfortunately, most unfitted finite element methods are also difficult to implement due to: (a) the need to perform complex cell cutting operations at boundaries, (b) the necessity of specialized quadrature formulas on cut elements, and (c) the consequences that these operations may have on the overall conditioning/stability of the ensuing algebraic problems. This talk introduces a simple, stable, and accurate unfitted boundary method, named “Shifted Boundary Method” (SBM), which eliminates the need to perform cell cutting operations. Boundary conditions are imposed on the boundary of a “surrogate” discrete computational domain, specifically constructed to avoid cut elements. Appropriate field extension operators are then constructed by way of Taylor expansions (or similar operators), with the purpose of preserving accuracy when imposing boundary conditions. An extension of the SBM to higher order discretizations will also be presented, together with a summary of the numerical analysis results.The SBM belongs to the broader class of Approximate Boundary Methods, a less explored or somewhat forgotten class of algorithms, which however might have an important role in the future of scientific computing. The performance of the SBM is tested on large-scale problems selected from linear and nonlinear elasticity, fluid mechanics, shallow water flows, thermos-mechanics, porous media flow, and fracture mechanics.
16:30 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room E 1.2