Eric Chen
Duality of automorphic periods abstract
Abstract:
The study of automorphic integrals has a long history which began with Hecke\'s Mellin transform of a modular form, and more recently it has provided an indispensable language with which to describe functoriality phenomena in the Langlands program. In the first half of this presentation, I will explain these developments via emblematic examples while rephrasing them in terms of the recent framework of relative Langlands duality proposed by Ben-Zvi--Sakellaridis--Venkatesh. In the second half, I will present joint work with Venkatesh in which we establish relative duality in certain "singular" examples with the aid of new numerical invariants of Galois representations that we call "nonabelian L-functions".
10:00 • EPF Lausanne,
Gonzalo Ruiz Stolowicz (EFPL)
Representations on infinite-dimensional hyperbolic spaces abstract
Abstract:
The infinite-dimensional hyperbolic spaces are defined and some generalities of the group representations in their isometry groups will be presented. The functions of complex hyperbolic type defined by Monod are a fundamental tool when studying infinite-dimensional representations. These functions play a role with respect to hyperbolic representations analogous to that of positive type functions with respect to unitary representations. With this tool, the representations of the groups PU(1,n) and PO(1,n) will be addressed.
10:20 • Université de Fribourg, 0.05 PER23
Prof. Dr. Motohico Mulase (UC Davis)
À la recherche de courbes cachées abstract
Abstract:
In some problems, sometimes finding a hidden curve behind the scene becomes a key to solve the problem. I will explain a few results from the past with a new perspective: (1) Construction of a D-module on a Jacobian; and (2) Finding the right coordinate on the hidden curve to understand the relation between enumeration problems and the quantities on the Deligne-Mumford moduli stack of curves. Then I will try to explain (3) An attempt toward describing the character variety on a curve in a combinatorial manner. The last one is an ongoing project with Olivia Dumitrescu (UNC).
14:00 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Bian Wu (MPI Leipzig)
Scale invariant bounds for mixing in the Rayleigh-Taylor instability
14:15 • Universität Basel, Spiegelgasse 5, Seminarraum 05.002
Tatjana Bossalini (University of Zurich)
The ROCA Vulnerability: A Study on Coppersmith's Algorithm and its Applications abstract
Abstract:
The search for strong security and effective algorithms is never-ending in the field of modern cryptosystems. Cryptography is the foundation of trust in the digital era, covering everything from our private communications to financial transactions and essential infrastructure. It enables us to share sensitive information and communicate with confidence, knowing that our data remains confidential and secure. This thesis presents an introduction to Coppersmith\'s algorithm. We start by laying the theoretical groundwork for three variants: univariate modular, bivariate integer, and multivariate modular case. Subsequently, we proceed to analyze the diverse range of applications that can be derived from these findings, including but not limited to the use of stereotyped messages, random padding for two messages, factoring with incomplete information, and the Chinese Remaindering with Errors problem. We developed and implemented code examples for each scenario, providing a tangible demonstration of the algorithm\'s efficiency. Finally, we discuss the ROCA vulnerability that was found in Estonia and its effects on the nation. This weakness allows an attacker to factorize the RSA modulus and compromise the security of the affected systems. The Estonian example emphasizes the significance of using secure implementation techniques, being careful when choosing random number generators, and being cautious when picking cryptographic libraries.
15:15 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H 25
Simon Machado (EHTZ)
Approximate subgroups and bounded cohomology abstract
Abstract:
Approximate subgroups are subsets of groups that are stable under multiplication up to a finite multiplicative error. The study of approximate subgroups has long been motivated by problems regarding random walks, expansion and growth in groups. A notion of regularity - coined laminarity - has plaid a crucial role in the understanding of their structure. In a recent breakthrough, Hrushovski noticed that failure of laminarity could be witnessed by a certain bounded cohomology class. I will explain why another notion of cohomology - that sits halfway between bounded cohomology and group cohomology - is more suitable. I will then discuss how this can be used to classify approximate lattices - a class of approximate subgroups first studied by Yves Meyer that generalises at the same time lattices of locally compact groups, Pisot numbers of a number field and Penrose tilings.
15:45 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Yatin Dandi (Bernoulli Centre)
Title T.B.A.
16:00 • EPF Lausanne
Yves Krähenbühl (University of Zurich)
Overview of Classes of MDP Convolutional Codes and Their Erasure Decoding Algorithms abstract
Abstract:
Convolutional codes are a class of codes particularly well-suited for data transmission over erasure channels, commonly used in multimedia traffic over the internet. This thesis compares three erasure decoding algorithms for convolutional codes: The forward and backward decoding algorithm, the low delay decoding algorithm for modules, and the low delay decoding algorithm for linear systems. Our primary focus is on comparing these algorithms in terms of their delays, computational complexities, and erasure recovery capabilities. Additionally, we discuss various classes of MDP convolutional codes, highlighting their advantageous properties in achieving an optimal performance with the three erasure decoding algorithms. Through two simulations, we assess the performance of the decoding algorithms over different erasure channel models simulating practical scenarios. In a first simulation, we evaluate the recovery capability of the algorithms using their respective optimal convolutional code classes and compare them with MDS linear block codes of the same rate. The results show that convolutional codes consistently match or even outperform MDS block codes over the different channel models. In a second simulation, we use longer received codewords relative to the largest sliding window of a convolutional code, revealing that the recovery process is influenced not only by the quantity of erasures but also by their distribution. Notably, early erasures have a minimal influence on the remainder of the decoding process. This thesis provides valuable insights into the selection and optimization of erasure decoding algorithms for convolutional codes, offering practical implications for multimedia data transmission over the internet.
16:15 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H 25
Prof. Dr. H. Gimperlein (Leopold-Franzens-Universität Innsbruck)
Boundary integral equations in space and time: Higher order Galerkin methods and applications abstract
Abstract:
Boundary integral formulations are well-known to lead to efficient numerical methods for time-independent scattering and emission problems. In this talk we consider corresponding formulations for the time-dependent acoustic and elastic wave equations. We survey recent work on space-time Galerkin methods for the numerical solution, including higher order approximations by h- and hp-versions, a posteriori error estimates and adaptive mesh refinements, and illustrate them for applications in traffic noise.
16:30 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room E 1.2
Prof. Dr. Grégory Miermont (ENS Lyon)
Compact Brownian surfaces abstract
Abstract:
We describe the compact scaling limits of uniformly random quadrangulations with boundaries on a surface of arbitrary fixed genus. These limits, called Brownian surfaces, are homeomorphic to the surface of the given genus with or without boundaries depending on the scaling regime of the boundary perimeters of the quadrangulation. They are constructed by appropriate gluings of pieces derived from Brownian geometrical objects (the Brownian plane and half-plane). In this talk, I will review their definition and discuss possible alternative constructions. This is based on joint work with Jérémie Bettinelli.
17:15 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H12