Weekly Bulletin

The FIM provides a Newsletter called FIM Weekly Bulletin, which is a selection of the mathematics seminars and lectures taking place at ETH Zurich and at the University of Zurich. It is sent by e-mail every Tuesday during the semester, or can be accessed here on this website at any time.

Subscribe to the Weekly Bulletin

FIM Weekly Bulletin

×

Modal title

Modal content
Monday, 25 September
Time Speaker Title Location
15:00 - 16:00 Prof. Dr. Jayadev Athreya
University of Washington
Abstract
Motivated by the comparison of sets of holonomies of saddle connections on translation surfaces to Poisson point processes, we show that for almost every translation surface the number of pairs of saddle connections with bounded virtual area has asymptotic quadratic growth. The proof techniques combine ergodic methods for counting saddle connections with the fact that the Siegel--Veech transform is in L2. The talk will not assume prior knowledge of translation surfaces, and we will attempt to keep it broadly accessible. This is joint work with Sam Fairchild and Howard Masur.
Ergodic theory and dynamical systems seminar
Counting Pairs of Saddle Connections
Y27H 25
Tuesday, 26 September
Time Speaker Title Location
15:15 - 16:15 Dr. Stefano Decio
Institute for Advanced Study, Princeton
Abstract
一个不欢而散本征函数在有限域是harmonic function whose normal derivative at the boundary is proportional to the function itself. I will tell you most of what I know about the zero sets of such functions. A nice fact is that there are many zeros near the boundary: I will give a gentle proof of this in the first part of the talk. In the second, perhaps a little less gentle, part I will discuss some lower and upper bounds for the Hausdorff measure of the zero set; several questions remain unanswered. Comparisons with the (slightly) better understood case of eigenfunctions of the Laplace-Beltrami operator will also be provided.
Analysis Seminar
Zeros of Steklov eigenfunctions
HG G 43
16:00 - 17:00 Peter Koymans
ETH Institute for Theoretical Studies
Abstract
A Diophantine equation is a polynomial equation to be solved in integers with the most famous example being X^n + Y^n = Z^n to be solved in integers X, Y and Z. A popular topic in number theory is to consider a family of Diophantine equations and ask how often it is soluble. We will give an introductory overview of this area.

More information: https://eth-its.ethz.ch/activities/its-fellows--seminar/Peter-Koymans.html
ETH-ITS Fellows' Seminar
Statistics of Diophantine equations
CLV B 4
Clausiusstrasse 47
16:00 - 17:00 Filippo Fila-Robattino
Universität Zürich
Abstract
In field theory, from a local Lagrangian it is possible to derive the phase space of the system. Roughly speaking, it represents the space of Cauchy data of the theory. Such space is equipped with a closed 2-form, whose kernel is often given by Hamiltonian vector fields generating (gauge) symmetries. The reduced phase space (RPS) is obtained as a symplectic manifold via quotienting the original phase space. In this talk, after a brief introduction and an example of RPS in a simple case, I will present the derivation (using a construction due to Kijowski and Tulcjiew) of the RPS of N=1 supergravity in dimension 4. If time allows, the corresponding BFV description is then carried out.
Zurich Graduate Colloquium
What is... the Reduced Phase Space of (N=1,D=4) Supergravity?
KO2F 150
Wednesday, 27 September
Time Speaker Title Location
14:00 - 15:00 Prof. Dr. Motohico Mulase
UC Davis
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).
Algebraic Geometry and Moduli Seminar
À la recherche de courbes cachées
HG G 43
15:15 - 16:00 Tatjana Bossalini
University of Zurich
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.
Neuchatel - St.Gallen - Zurich Seminar in Coding Theory and Cryptography
The ROCA Vulnerability: A Study on Coppersmith's Algorithm and its Applications
Y27H 25
15:45 - 16:45 Simon Machado
EHTZ
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.
Geometry Seminar
Approximate subgroups and bounded cohomology
HG G 43
16:15 - 17:00 Yves Krähenbühl
University of Zurich
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.
Neuchatel - St.Gallen - Zurich Seminar in Coding Theory and Cryptography
Overview of Classes of MDP Convolutional Codes and Their Erasure Decoding Algorithms
Y27H 25
16:30 - 17:30 Prof. Dr. H. Gimperlein
Leopold-Franzens-Universität Innsbruck
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.
Zurich Colloquium in Applied and Computational Mathematics
Boundary integral equations in space and time: Higher order Galerkin methods and applications
HG E 1.2
17:15 - 18:45 Prof. Dr. Grégory Miermont
ENS Lyon
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.
Seminar on Stochastic Processes
Compact Brownian surfaces
Y27H12
Thursday, 28 September
Time Speaker Title Location
10:15 - 12:00 Javier Fresán
École polytechnique, Palaiseau
Abstract
Nachdiplomvorlesung
E-functions and geometry
HG G 43
16:15 - 18:00 Jaemin Park
University of Basel
Abstract
在本课程中,我们将检查转化m behaviors of the two- imensional incompressible Boussinesq equations without thermal diffusion. While the Boussinesq equations exhibit energy conservation, the flow's small-scale creation may induce the growth of finer norms in the solutions over time. During this talk, we will construct smooth initial data to demonstrate such norm growth phenomena, both with and without considering kinematic viscosity. Additionally, we will extend our results to provide an example of temperature patch solutions, the curvature and perimeter of which increase as time progresses. This work is a joint work with A. Kiselev and Y. Yao.
PDE and Mathematical Physics
Small scale creation for the 2D Boussinesq Equations
HG G 19.2
Friday, 29 September
Time Speaker Title Location
14:15 - 15:15 Dr. Vivian Kuperberg
ETH Zürich
Abstract
In 2000, Shiu proved that there are infinitely many primes whose last digit is 1 such that the next prime also ends in a 1. However, it is an open problem to show that there are infinitely many primes ending in 1 such that the next prime ends in 3. In this talk, we'll instead consider the sequence of sums of two squares in increasing order. In particular, we'll show that there are infinitely many sums of two squares ending in 1 such that the next sum of two squares ends in 3. We'll show further that all patterns of length 3 occur infinitely often: for any modulus q, every sequence (a mod q, b mod q, c mod q) appears infinitely often among consecutive sums of two squares. We'll discuss some of the proof techniques, and explain why they fail for primes. Joint work with Noam Kimmel.
Number Theory Seminar
Consecutive sums of two squares in arithmetic progressions
HG G 43
15:15 - 16:15 Leonardo Egidi
University of Trieste
Abstract
现在需要可再生的贝叶斯模型, generative, predictive, robust, computationally scalable, and able to provide sound inferential conclusions. In this wide framework, Bayes factors still represent one of the most well-known and commonly adopted tools to perform model selection and hypothesis testing; however, they are usually criticized due to their intrinsic lack of calibration, and they are rarely used to measure the predictive accuracy arising from competing models. We propose two distinct approaches relying on BFs from our most recent research. With regard to prediction, we propose a new algorithmic protocol to transform Bayes factors into measures that evaluate the pure and intrinsic predictive capabilities of models in terms of posterior predictive distributions, by assessing some preliminary theoretical properties (joint work with Ioannis Ntzoufras). Then, regarding the analysis of replication studies (Held, 2020), we follow the stream outlined by Pawel and Held (2022) and propose a skeptical mixture prior which represents the prior of an investigator who is unconvinced by the original findings. Its novelty lies in the fact that it incorporates skepticism while controlling for prior-data conflict (Egidi et al., 2021). Consistency properties of the resulting skeptical BF are provided together with a thorough analysis of the main features of our proposal (joint work with Guido Consonni). Short Bibliography: Egidi, L., Pauli, F., & Torelli, N. (2022). Avoiding prior–data conflict in regression models via mixture priors. Canadian Journal of Statistics, 50(2), 491-510. Held, L. (2020). A new standard for the analysis and design of replication studies. Journal of the Royal Statistical Society Series A: Statistics in Society, 183(2), 431-448. Pawel, S., & Held, L. (2022). The sceptical Bayes factor for the assessment of replication success. Journal of the Royal Statistical Society Series B: Statistical Methodology, 84(3), 879-911.
Research Seminar in Statistics
Prediction, skepticism, and the Bayes Factory
HG G 19.1
JavaScript has been disabled in your browser