Shahar Mendelson (The Australian National University)
Probabilistic methods in Analysis
10:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Tom Ferragut (Université de Fribourg)
Geometry and rigidity of quasi-isometries of horospherical products abstract
Abstract:
Horospherical products of two Gromov hyperbolic spaces where introduced to unify the construction of metric spaces such as Diestel-Leader graphs, the Sol geometry or treebolic spaces. In this talk we will first recall all the bases required to construct these horospherical products, then we will study their large scale geometry through a description of their geodesics and visual boundary. Afterwards we will get interested in a geometric rigidity property of their quasi-isometries. This result will lead us to a description of the quasi-isometry group of solvable Lie groups constructed as horospherical products and to a new quasi-isometry classification for some solvable Lie groups.
10:20 • Université de Fribourg, room Phys 2.52
Prof. Dr. Marcos Marino (Université de Genève)
Resurgence and asymptotics in Gromov-Witten theory abstract
Abstract:
The generating functions of genus g Gromov-Witten invariants of Calabi-Yau threefolds lead to factorially divergent series, when the genus is large. Finding the precise asymptotics of these series is an interesting question. The theory of resurgence of Jean Ecalle associates a very rich structure to a factorially divergent series, involving a collection of “trans-series”, which in particular makes it possible to obtain the precise asymptotics. Determining the resurgent structure of generating functions in Gromov-Witten theory is a difficult problem, and in this talk I will present some partial results and conjectures on this structure, based on trans-series solutions of the holomorphic anomaly equations. As a consequence of these results, I will formulate precise conjectures for the asymptotics of the generating functions of the quintic CalabiYau, and for the asymptotics of fixed degree orbifold Gromov-Witten invariants of C^3/Z_3.
13:30 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Federico Cacciafesta (University of Padova) & Marta Strani (University Ca\' Foscari)
The Dirac equation in dispersive PDEs: advances and open problems abstract
Abstract:
The Dirac equation is one of the fundamental equations in relativistic quantum mechanics, widely used in a large number of applications from physics to quantum chemistry. The aim of this talk will be to discuss some recent results, together with a number of open questions, concerning the dynamics for this model: after briefly reviewing the main properties of the Dirac operator and providing some background and motivations from the theory of linear dispersive PDEs, we shall focus in particular on the cases of the Dirac-Coulomb equation and of the Dirac equation on non flat manifolds, showing how some linear estimates (in particular, Strichartz estimates) can be obtained by exploiting various properties of the operator.
14:15 • Universität Basel, Spiegelgasse 5, SR 05.002
Theresa Körner (University of Bayreuth)
Lengths of divisible codes with restricted column multiplicities abstract
Abstract:
A linear code C over GF(q) is called Delta-divisible if the Hamming weights wt(c) of all codewords c are divisible by Delta. The study of divisible codes was initiated by Harold Ward. The possible effective lengths of q^r-divisible codes have been completely characterized for each prime power q and each nonnegative integer r. An implication of these results are upper bound for partial spreads. More and more applications of divisible codes emerged in the last years, e.g. upper bounds for so-called subspace codes. Noting that the known characterization result for the possible (effective) lengths of q^r-divisible codes involves quite large point multiplicities on the constructive side, there is quite some need for more refined results taking other parameters like the maximum possible point multiplicities or the dimension. Also the restriction that the exponent r in the divisibility constant Delta = q^r has to be an integer is not always met in the applications. In this talk I present some partial results on the possible effective lengths of divisible codes with extra constraints. <BR> <BR> (**This eSeminar will take place over Zoom, using the same meeting details as previous seminars. If you do not have meeting details, please contact zita.fiquelideabreu@math.uzh.ch **)
15:00 • Uni St. Gallen, 64-110
Alejandra Garrido (Universidad Autónoma de Madrid)
Detecting free factors in profinite completions abstract
Abstract:
If one is interested in finitely generated residually finite groups, it is natural to ask to what extent such a group is determined by all its finite quotients. The finite quotients of a group are encoded in the group\'s profinite completion. Perhaps the boldest question in this area is that attributed to Remeslennikov: "If G has the same profinite completion as a free group of finite rank, must G be isomorphic to that free group?" The answer to this still seems remote, given current knowledge, but some success has been found on variants of it, restricting the type of group G is allowed to be. Another natural variant of Remeslennikov\'s question is whether a free factor of a group G can be detected from its profinite completion: if G has a subgroup H, whose closure in the profinite completion of G is a profinite free factor, must H be a free factor of G? This question is still hard, with positive known answer only when G itself is a free group. I will report on joint work with A. Jaikin in which we provide a new proof of the above positive answer and extend it to the case when G is virtually free. The methods may be extended to other classes of groups if some interesting questions are answered on their completed group algebras.No knowledge of profinite groups will be assumed for the talk.
15:45 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Dr. Andrea Manzoni (Politecnico di Milano, Italy)
Deep learning for reduced order modeling: recent results and open challenges abstract
Abstract:
Reduced order modeling (ROM) techniques, such as the reduced basis method, provide nowadays an essential toolbox for the efficient approximation of parametrized differential problems, whenever they must be solved either in real-time, or in several different scenarios. These tasks arise in several contexts like, e.g., uncertainty quantification, control and monitoring, as well as data assimilation, ultimately representing key aspects in view of designing predictive digital twins in engineering or medicine. On the other hand, in the last decade deep learning algorithms have witnessed a dramatic blossoming in several fields, ranging from image and signal processing to predictive data-driven models. More recently, deep neural networks have also been exploited for the numerical approximation of differential problems yielding powerful physics-informed surrogate models.In this talk we will explore different contexts in which deep neural networks (DNNs) can enhance the efficiency of ROM techniques, ultimately allowing the real-time simulation of large-scale nonlinear time-dependent problems. We show how to exploit DNNs to build ROMs for parametrized PDEs in a fully non-intrusive way, exploiting deep autoencoders as main building block, ultimately yielding deep learning-based ROMs (DL-ROMs) and their further extension to POD-enhanced DL-ROMs (POD-DL-ROMs). In particular, we will provide some guidelines for the design of deep autoencoders, showing the interplay between their minimal latent dimension and some topological properties of the solution manifold, and illustrating some theoretical results on the approximation errors entailed by the proposed approach, as well as more recent investigations on the use of deep convolutional autoencoders.Other examples of ROM strategies enhanced by deep learning include the use of DNNs for (i) learning nonlinear ROM operators, thus yielding hyper-reduced order models enhanced by deep neural networks (Deep-HyROMnets), or (ii) enhancing the accuracy of low-fidelity ROMs through a multi-fidelity neural network regression technique for the sake of input/output evaluations.Through a set of applications from engineering including, e.g., structural mechanics and fluid dynamics problems, we will highlight the opportunities provided by deep learning in the context of ROMs for parametrized PDEs, as well as those challenges that are still open.
16:30 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H 35/36
Zita Abreu (University of Zurich)
A novel criterion for the construction of MDS convolutional codes of rate 1/n abstract
Abstract:
Maximum-distance separable (MDS) convolutional codes are characterized by the property that their free distance reaches the generalized Singleton bound. In this paper, a new criterion to construct MDS convolutional codes of rank 1 is presented. This criterion allows to relate the construction of MDS convolutional codes to the construction of reverse superregular Toeplitz matrices. Additionally, we present some construction examples for small code parameters over small finite fields. <BR> <BR> (**This eSeminar will take place over Zoom, using the same meeting details as previous seminars. If you do not have meeting details, please contact zita.fiquelideabreu@math.uzh.ch **)
16:30 • Uni St. Gallen, 64-110
Dr. Barbara Dembin (ETH Zurich)
Upper tail large deviations for chemical distance in supercritical percolation abstract
Abstract:
We consider supercritical bond percolation on Z^d and study the chemical distance, i.e., the graph distance on the infinite cluster. It is well-known that there exists a deterministic constant μ(x) such that the chemical distance D(0,nx) between two connected points 0 and nx grows like nμ(x). We prove the existence of the rate function for the upper tail large deviation event {D(0,nx)>nμ(x)(1+ϵ),0↔nx} for d>=3. Joint work with Shuta Nakajima.
17:15 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H12