var sms = '<div id="sms_bulletin">  <div id="sms_header">  <div class="do_not_print" id="arrow_left"><a href="?next=-17"><img src="//www2.math.ethz.ch/smsjs/images/arrow_left.png"/></a></div><div class="do_not_print" id="arrow_right"><a href="?next=-15"><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. 14</span>      <span style="float: right; text-align:right; width: 250px;">1.9 - 5.9.2025</span>      <span style="text-align: center; display: block; width: 250px; margin: auto; position: relative;">Summer Break 2025</span>    </div>  </div>  <div></div>  <div id="sms_content">    <div class="day">      <div class="day_title">        Monday, September 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">        Tuesday, September 2      </div>      <div class="day_content">        <div class="day_content_item normal"><div class="event_location uni_dis"><a class="external" href="https://unidistance.ch">UniDistance Suisse and Zoom Meeting</a></div><div class="event_type"><a class="external" href="https://distanceuniversity.ch/academic-events/mathematics-colloquium/">Mathematics Colloquium </a></div><br /><div class="event_speaker">Prof. Dr. Serte  Donderwinkel  (University of Groningen)</div><div class="event_title"><a class="external" href="https://unidistance.ch/en/event/universality-in-random-graphs">Universality in Random Graphs</a> <span class="abstract-button do_not_print">abstract</span></div><div class="abstract-text" style="display: none"><strong>Abstract:</strong><br />Universality is a remarkable phenomenon in probability theory: diverse random systems, despite their microscopic differences, often exhibit the same macroscopic behaviour. The most famous example is the central limit theorem, which allows school children to approximate the chance of flipping more than 60 heads in 100 coin tosses using a normal distribution table—even though the coin itself is not normally distributed.A similar regularizing effect of randomness can be observed in random networks. This helps explain why broccolis look somewhat like trees—and even like the bronchioles in our lungs. Universality principles are not only mathematically fascinating, but also powerful in applications. If we can show that broccolis, trees, and other random structures satisfying basic assumptions resemble the same random fractal, then we can deduce global properties without needing to fully understand local interactions.In this talk, I will introduce the idea of universality in random graphs, highlighting its combinatorial, probabilistic, and geometric aspects, and exploring recent developments in this area of research.</div><div class="event_time">17:00 &bull; <a class="external" href="https://fernuni.zoom.us/j/64850280617">UniDistance Suisse and Zoom Meeting</a></div>        </div>      </div>    </div>    <div class="day">      <div class="day_title">        Wednesday, September 3      </div>      <div class="day_content">        <div class="day_content_item normal"><div class="event_location uni_zh"><a class="external" href="https://uzh.ch">Universit&auml;t Z&uuml;rich</a></div><div class="event_type"><a class="external" href="https://www.math.uzh.ch/aa/?events">Neuchatel - St.Gallen - Zurich Seminar in Coding Theory and Cryptography</a></div><br /><div class="event_speaker">Peter Otto Buck</div><div class="event_title">On the Use of Matrices over Semirings in Cryptography <span class="abstract-button do_not_print">abstract</span></div><div class="abstract-text" style="display: none"><strong>Abstract:</strong><br />The presentation is about the cryptographic properties of matrices over the finite semirings S6 and S20, which form a semigroup under multiplication. The main objectives are to explore: <br> 1. The existence of matrices over S6 and S20 with large multiplicative order, and<br> 2. The computational hardness of solving linear equations of the form A·X = B, where A, B, and X are matrices over either S6 or S20. <br> The idea of the first part is to find a base element for a Diffie-Hellman key exchange. In the second part, we try to construct a sigma protocol where the solution X of AX = B serves as the witness.</div><div class="event_time">16:00 &bull; UZH Irchel, Winterthurerstrasse 190, Z&uuml;rich, Building Y27, Room H 46</div>        </div>      </div>    </div>    <div class="day">      <div class="day_title">        Thursday, September 4      </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">        Friday, September 5      </div>      <div class="day_content">        <div class="day_content_item no_event">        No events scheduled today!        </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>';