var sms = '<div id="sms_bulletin">  <div id="sms_header">  <div class="do_not_print" id="arrow_left"><a href="?next=-5"><img src="//www2.math.ethz.ch/smsjs/images/arrow_left.png"/></a></div><div class="do_not_print" id="arrow_right"><a href="?next=-3"><img src="//www2.math.ethz.ch/smsjs/images/arrow_right.png"/></a></div>    <div class="sms_title">      <span style="float: left;">SMS</span>      <span>SWISS MATHEMATICAL SOCIETY</span>      <span style="float: right;">SMG</span>    </div>    <div class="sms_info">      <span style="float: left; width: 250px;">Bulletin no. 5</span>      <span style="float: right; text-align:right; width: 250px;">29.6 - 3.7.2026</span>      <span style="text-align: center; display: block; width: 250px; margin: auto; position: relative;">Summer Break 2026</span>    </div>  </div>  <div></div>  <div id="sms_content">    <div class="day">      <div class="day_title">        Monday, June 29      </div>      <div class="day_content">        <div class="day_content_item normal"><div class="event_location uni_la"><a class="external" href="https://www.epfl.ch">EPF Lausanne</a></div><div class="event_type"><a class="external" href="https://theory.epfl.ch/seminar/">Theory and Combinatorics Seminar</a></div><br /><div class="event_speaker"> Radu Toma (Sorbonne University and the University of Paris Cité )</div><div class="event_title">On the average hardness of short vector problems, or grabbing the automorphic bull by the horns <span class="abstract-button do_not_print">abstract</span></div><div class="abstract-text" style="display: none"><strong>Abstract:</strong><br /> In joint work with Koen de Boer, Aurel Page, and Benjamin Wesolowski, we study the hardness of the approximate Short Independent Vectors Problem for random module lattices. We use here a natural notion of randomness as defined originally by Siegel through Haar measures. We show it is essentially as hard as the problem for arbitrary instances. While this was previously known for ideal lattices (those of rank 1), it is the first such result in higher rank. I will give an overview of the reduction and discuss some of the challenges. The work involves deep number theoretic techniques and results, such as the equidistribution of sublattices, which we study using the spectral theory of automorphic forms. I will give a gentle introduction to such techniques.</div><div class="event_time">11:00 &bull; EPF Lausanne, BC 010</div>        </div>      </div>    </div>    <div class="day">      <div class="day_title">        Tuesday, June 30      </div>      <div class="day_content">        <div class="day_content_item normal"><div class="event_location uni_zh"><a class="external" href="https://ethz.ch">ETH Z&uuml;rich</a></div><div class="event_type"><a class="external" href="https://stat.ethz.ch/events/research_seminar">Research Seminar in Statistics</a></div><br /><div class="event_speaker"> Tim Gehrunger (ETH Zurich, Department of Mathematics)</div><div class="event_title">Agentic AI for the Working Mathematician <span class="abstract-button do_not_print">abstract</span></div><div class="abstract-text" style="display: none"><strong>Abstract:</strong><br />Can commercially available LLMs solve research-level mathematics problems? Can mathematicians use these models to support their own research?The current answer to both questions seems to be a cautious “yes,” which grows less cautious over time. In this talk, I will give an overview of the mathematical reasoning abilities of current state-of-the-art models, with a special focus on agentic systems. I will also highlight best practices, limitations, and open questions surrounding the use of AI in mathematical research.</div><div class="event_time">13:15 &bull; ETH Zentrum, R&auml;mistrasse 101, Z&uuml;rich, Building HG, Room G 19.2</div>        </div>      </div>    </div>    <div class="day">      <div class="day_title">        Wednesday, July 1      </div>      <div class="day_content">        <div class="day_content_item no_event">        No events scheduled today!        </div>      </div>    </div>    <div class="day">      <div class="day_title">        Thursday, July 2      </div>      <div class="day_content">        <div class="day_content_item normal"><div class="event_location uni_zh"><a class="external" href="https://ethz.ch">ETH Z&uuml;rich</a></div><div class="event_type"><a class="external" href="https://math.ethz.ch/s/talks-in-financial-and-insurance-mathematics">Talks in Financial and Insurance Mathematics</a></div><br /><div class="event_speaker"> Giangiacomo Mercatali (Haute Ecole de Gestion de Genève)</div><div class="event_title">Constraining Generative Models: Conditioning, Structure, and Physics in Diffusion and Flows <span class="abstract-button do_not_print">abstract</span></div><div class="abstract-text" style="display: none"><strong>Abstract:</strong><br />Diffusion and flow-matching models have become the default tools for generative modeling,but in scientific and structured domains their value depends on one ability: to generatenot just plausible samples, but samples that satisfy prescribed constraints and guidancesignals — known physics, structure, and target properties. Such requirements come inseveral distinct types, and a generative model has to be designed in a specific way toaccommodate each. This talk frames a line of work around that question — how do we builddiffusion and flow models that respect different kinds of constraints? — and presents onedesign per type.The first type is conditioning on target properties: a score-based diffusion withco-evolving processes that exchange information through loop guidance, steering generationtoward desired attributes. The second is structural: a continuous-time flow constrained bya causal dependency graph, learned jointly with the dynamics of interacting time series.The third is partial physics: when the governing equations are known only in part, agrey-box flow-matching model embeds the available physics while a structured latent absorbsthe unknown parameters and stochasticity. The fourth is hard physical constraints —conservation laws, boundary conditions — enforced at sampling time by projecting generationonto the constraint manifold.</div><div class="event_time">14:00 &bull; ETH Zentrum, R&auml;mistrasse 101, Z&uuml;rich, Building HG, Room F 26.5</div>        </div>        <div class="day_content_item normal"><div class="event_location uni_la"><a class="external" href="https://www.epfl.ch">EPF Lausanne</a></div><div class="event_type"><a class="external" href="https://theory.epfl.ch/seminar/">Theory and Combinatorics Seminar</a></div><br /><div class="event_speaker"> Avi  Wigderson  (IAS, Princeton)</div><div class="event_title">Optimization, Complexity and Math (or, can we prove P!=NP by gradient descent?) <span class="abstract-button do_not_print">abstract</span></div><div class="abstract-text" style="display: none"><strong>Abstract:</strong><br />This talk aims to summarize a project I was involved in during the past decade, with the hope of explaining our most complete understanding so far, as well as challenges and open problems. The main messages of this project are summarized below; I plan to describe, through examples, many of the concepts they refer to, and the evolution of ideas leading to them. No special background is assumed. We extend the most basic tools of convex optimization in Euclidean space to a far more general setting of Riemannian manifolds that arise from the symmetries of noncommutative groups. We develop first-order and second-order algorithms, and analyze their performance in general. Invariant theory, which studies such group actions, plays an essential role in this development. The focus on symmetries exposes old and reveals new relations between the application problems below. These algorithms give exponential (or better) improvements in run-time for solving algorithmic many problems across CS, Math and Physics. In particular, these include problems in algebra (e.g. testing rational identities in non-commutative variables), in analysis (testing the feasibility and tightness of Brascamp-Lieb inequalities), in quantum information theory (to the quantum marginals problem), in algebraic geometry (to computing Kronecker coefficients), in computational complexity (to derandomizing new special cases of the PIT problem) and in optimization (to testing membership in large, implicitly described polytopes). Based on joint works with Zeyuan Allen-Zhu, Peter Burgisser, Cole Franks, Ankit Garg, Leonid Gurvits, Pavel Hrubes, Yuanzhi Li, Visu Makam, Rafael Oliveira and Michael Walter.REGISTER HERE : Lecture Prof. Avi Wigderson (IAS, Princeton) – Fill in form :forms.cloud.microsoft/Pages/ResponsePage.aspx?id=alXC9vvEsUqix54iDfEcQ-g_-oaFq4NMizPr-UXNEiNURExDNE9ORUhLOEs3QVc4U0U3R0hHVkg2Ri4u</div><div class="event_time">15:30 &bull; EPF Lausanne, BCH 2201</div>        </div>      </div>    </div>    <div class="day">      <div class="day_title">        Friday, July 3      </div>      <div class="day_content">        <div class="day_content_item normal"><div class="event_location uni_zh"><a class="external" href="https://ethz.ch">ETH Z&uuml;rich</a></div><div class="event_type"><a class="external" href="https://math.ethz.ch/s/algebraic-geometry-and-moduli-seminar">Algebraic Geometry and Moduli Seminar</a></div><br /><div class="event_speaker">Prof. Dr. Longting Wu (SUSTECH)</div><div class="event_title">Virasoro constraints for orbifold curves <span class="abstract-button do_not_print">abstract</span></div><div class="abstract-text" style="display: none"><strong>Abstract:</strong><br />I will first review the Virasoro constraints for Gromov–Witten theory and the curve case proved by Okounkov and Pandharipande. I will then discuss ongoing work on extending these constraints to orbifold curves using degeneration techniques. </div><div class="event_time">13:30 &bull; ETH Zentrum, R&auml;mistrasse 101, Z&uuml;rich, Building HG, Room G 43</div>        </div>      </div>    </div>  </div>  <div id="sms_footer">    address: Alessandra Naldi Windler, Departement Mathematik, HG G 51.4, ETH Zurich, Raemistrasse 101, CH-8092 Zurich<br />    email: <a href="mailto:bulletin@math.ch">bulletin@math.ch</a> | phone: +41 44 632 3684 | url: <a href="https://math.ch">https://math.ch</a>    <br /><br /><img src="//www2.math.ethz.ch/smsjs/sms_logo.gif" width="150" alt="SMS/SMG Logo" title="SMS/SMG Logo" />  </div></div>';