Prof. Dr. Yilin Wang (ETHZ)
Geodesics and Brownian motion on hyperbolic surfaces abstract
Abstract:
<p><span style="caret-color: #ffffff; font-family: Helvetica; font-size: 12px; font-style: normal; font-variant-caps: normal; font-weight: 400; letter-spacing: normal; text-align: start; text-indent: 0px; text-transform: none; white-space: normal; word-spacing: 0px; -webkit-text-stroke-width: 0px; text-decoration: none; display: inline !important; float: none;"><span style="caret-color: #ffffff; font-family: Helvetica; font-size: 12px; font-style: normal; font-variant-caps: normal; font-weight: 400; letter-spacing: normal; text-align: start; text-indent: 0px; text-transform: none; white-space: normal; word-spacing: 0px; -webkit-text-stroke-width: 0px; text-decoration: none; display: inline !important; float: none;">There are intimate relations between the geodesic flow and Brownian motion on hyperbolic surfaces (for instance, Hopf-Tsuji-Sullivan theorem and the expression of harmonic measure). In this talk, I will show how we can use Brownian motion to express the lengths of closed geodesics, length of orthogeodesics, zeta-regularized determinant of the Laplace-Beltrami operator of a hyperbolic surface. This gives a tool to study the length spectra of a hyperbolic surface and we obtain a new identity between the length spectrum of a hyperbolic surface and that of the same surface with an arbitrary number of additional cusps. This is mainly based on a joint work with Yuhao Xue (IHES). </span></span></p>
13:30 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room F 26.3
Prof. Dr. Luca Giuzzi (Section of Mathematics, Università degli studi di Brescia)
Codes from Incidence Geometries abstract
Abstract:<p>Incidence geometries are a powerful and general framework to axiomatically describe classical geometric objects, in terms of relations between objects of different types. Important cases of incidence geometries are induced by point -- line geometries, i.e. geometries determined by two sets \\({\\cal P}\\neq\\emptyset\\) and \\(\\cal L\\) (called respectively points and lines) and an incidence relation such that and for any two given distinct points there is at most a line which is incident with them both. In a point-line geometry, we say that two points \\(p\\) and \\(q\\) are collinear (written \\(p\\perp q\\)) if there is a line \\(\\ell\\in{\\cal L}\\) such that both \\(p\\) and \\(q\\) are incident with \\(\\ell\\).</p> <p>In this talk we shall focus mostly on \\(\\Gamma\\)-geometries i.e. point--line geometries where given \\((p,\\ell)\\in{\\cal P}\\times{\\cal L}\\) we have either \\(\\forall q\\in\\ell: p\\perp q\\) or \\(|\\{ q\\in\\ell: p\\perp q\\}|\\leq 1\\). Projective spaces, polar spaces as well as their grassmannians are all \\(\\Gamma\\) geometries.</p> <p>Next, we shall discuss the notion of projective embeddings as providing useful "concrete" models for geometries, by representing their points as varieties embedded in a suitable projective space.</p> <p>By regarding embedded geometries as projective systems it is possible to construct codes which usually admit large automorphism groups and sport a rich "local" structure which can be used in order to perform efficient decoding.</p> <p>In this talk, I will report on the general constructions and then focus on the case of polar Grassmannians and of the representation of flag geometries of a given geometry.</p> <p>All of these results are joint work with Ilaria Cardinali from University of Siena.</p> <p> </p> <p><strong>References</strong></p> <p>[1] Ilaria Cardinali and Luca Giuzzi, <em>Codes and caps from orthogonal Grassmannians, </em>Finite Fields and their Applications <strong>24</strong> (2013) 148–169.
[2] ________, <em>Enumerative Coding for Line Polar Grassmannians with Applications to Codes</em>, Finite Fields and their Applications <strong>46 </strong>(2017) 107–138.
[3] ________, <em>Linear codes arising from the point-hyperplane geometry – part I: the Segre </em><em>embedding,</em> Finite Fields and their Applications <strong>111</strong> (2026) 102766.
[4] ________, <em>Linear codes arising from the point-hyperplane geometry – part II: the twisted </em><em>embedding,</em>
arXiv:2507.16694 (2025).
[5] ________, <em>On minimal codes arising from projective embeddings of point–line geometries</em>,
arXiv:2511.22747 (2025).</p>
15:15 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H 28
Thomas Nikolaus (Münster)
Singular chains as Coalgebras abstract
Abstract:
A very old and natural question in topology is how much information about a space X is contained in its singular homology H_*(X). It is well known that homology by itself is not a complete invariant: different spaces can have exactly the same homology groups without being homotopy equivalent.The situation becomes much more interesting once additional structure is taken into account. Instead of passing immediately to homology, one can look at the full chain complex C_*(X) together with the cross product, which is closely related to the cup product on cochains. This extra structure encodes subtle interactions between chains that are lost on homology, and it is responsible for familiar phenomena such as Massey products and Steenrod operations.In this talk, we discuss the result that singular cochains, when viewed as an E_infinity coalgebra, actually form a complete invariant of a space: the homotopy type of X can be recovered from this structure in a functorial way. This generalizes classical rational homotopy theory as well as deep results of Mandell, Yuan and Bachmann--Hahn. More generally, we explain how the result is based on a classification of "perfect" E-infinity coalgebras.All of this is joint work with F. Riedel.
15:30 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Dr. Nathan Kirk (University of St. Andrews)
Abstract:
Quasi-Monte Carlo (QMC) methods offer deterministic accuracy improvements over standard Monte Carlo sampling for numerical approximation, but their classical error bound—given by the Koksma-Hlawka inequality and governed by the Hardy-Krause variation—often proves too conservative in practice. In this talk, I present a recent randomized QMC framework that begins with ordinary random samples and partitions them into highly uniform point sets using tools from combinatorial discrepancy. The method introduces a new measure of smoothness, the smoothed-out variation, which captures cancellations ignored by the Hardy-Krause variation formulation and leads to a strictly tighter error bound. I’ll also show how the same construction extends naturally to weighted function spaces, producing sampling nodes that can be tuned to exploit known structure in your problem.
16:15 • Universität Bern, Hörsaal B77, ExWi, Sidlerstrasse 5, 3012 Bern
Tomer Cohen (Technion - Israel Institute of Technology)
Rank Modulated Composite Encoding for Data Storage in DNA abstract
Abstract:
<p>The talk focuses on the integration of composite DNA alphabets and rank modulation, two promising paradigms for high-density DNA-based data storage. Composite DNA leverages the inherent redundancy of synthesis by representing positions as mixtures of nucleotides, while rank modulation utilizes the relative ordering of these motifs to provide robustness against signal variations. We first address this combination through a framework of fixed-length permutations subject to ranking errors measured by Kendall’s tau distance. For this setting, we establish the channel capacity and present a construction for sequences of ranked symbols using Tensor Permutation Codes (TPC). We then extend the theory to a more physically faithful model involving variable-length permutations, specifically addressing insertion and deletion (indel) errors occurring at the "tail" of the ranking, the lower-frequency motifs. Within this paradigm, we establish a theoretical equivalence between tail deletion, insertion, and indel codes, and provide optimal constructions for both individual symbols and sequences via Tail Tensor Permutation Codes (TTPC). Together, these results offer a comprehensive theoretical and practical framework for leveraging rank-modulated composite symbols in error-resilient DNA storage systems.</p>
16:30 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H 28
Prof. Dr. Yueyun Hu (Université Sorbonne Paris Nord)
Average-weight percolation on the complete graph abstract
Abstract:
This talk is based on a joint work with Elie Aidékon (Shanghai). Attach to each edge of the complete graph on $n$ vertices, i.i.d. exponential random variables with mean $n$. Aldous (1998) proved that the longest path with average weight below $p$ undergoes a phase transition at $p=\\frac{1}{e}$: it is $o(n)$ when $p<\\frac{1}{e}$ and of order $n$ if $p>\\frac1e$. Later, Ding (2013) revealed a finer phase transition around $\\frac{1}{e}$: there exist $c\'>c>0$ such that the length of the longest path is of order $\\ln^3 n$ if $ p \\le \\frac{1}{e}+\\frac{c}{\\ln^2 n}$ and is polynomial if $p\\ge \\frac{1}{e}+\\frac{c\'}{\\ln^2 n}$. We identify the location of this phase transition and obtain sharp asymptotics of the length near criticality. The proof uses an exploration mechanism mimicking a branching random walk with selection introduced by Brunet and Derrida (1999).
17:15 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H12