Events

The goal of this conference is to present a panorama of research directions in mathematics and mathematical physics related to the scientific program of our CRC 1624 "Higher structures, moduli spaces and integrability". The CRC 1624 has started in the Spring of 2024. It aims to stimulate interactions between highly active topics in mathematics such as higher structures and their applications in TQFT and CFT, the geometry of moduli spaces with their applications in SUSY QFT and string theory like the swampland program, and integrability with its multitude of applications in quantum field theory and string theory. With this conference we aim to stimulate new interactions between mathematics and theoretical physics by bringing together leading representatives of these research directions.

This is an informal workshop entirely dedicated to young mathematicians who work in differential geometry in a broad sense. The scientific theme of the workshop is the study of topological and geometric properties of complex manifolds, and, more in general, of manifolds endowed with ''special'' geometric structures, either integrable or non-integrable.

The Hanseatic Dynamical Systems Days (HanDSDays) are recurring one-day workshops taking place at universities in Northern Germany. The goal of the workshop is to enhance connections, collaborations and exchange of ideas within the Dynamical Systems & Ergodic Theory community. The 11th HanDSDay will take place at the University of Bremen at March 28th, 2025. For more information: https://sites.google.com/view/handsdays11

The S.-T. Yau College Student Mathematics Contest, initiated by Prof. Shing-Tung Yau in 2010, reaches its 16th edition in 2025 with the first global expansion. Hosted by Tsinghua University’s Yau Mathematical Sciences Center, this competition has attracted over 25,000 participants from 600+ universities in China with 980+ awardees honored. In 2025, the competition expands internationally, setting up test centers in the USA (California-Los Angeles, Berkeley; New Jersey-New Brunswick; Massachusetts-Boston; Texas-Houston), Russia (Moscow, Saint Petersburg), Japan (Tokyo), and Singapore. It is open to undergraduate students worldwide who have not yet obtained a bachelor’s degree. Registration runs from March 15 to April 15, 2025. The semifinal written examination will take place on May 17–18, 2025. The global finals will be held at Tsinghua University in Beijing from June 28–29. For more information, please visit http://yau-contest.com or contact college-contest@tsinghua.edu.cn.

This workshop will be centered on recent advances in graph rigidity and interactions between rigidity, algebraic statistics, and matroid theory. Three major advances are the recent resolution of the matroid maximality conjecture, the newly developed link to maximum likelihood estimation in Gaussian graphical models, and the recent positive resolution of Lovasz and Yemini's connectivity conjecture for generic rigidity. The workshop will showcase a diverse sample of current work addressing fundamental problems in graph rigidity, algebraic matroids, and algebraic statistics.

Control theory and reinforcement learning converge on a shared objective: facilitating autonomous, real-time decision-making to optimize dynamical processes. Historically, these disciplines have diverged in assumptions regarding available prior information and in analytical techniques applied. However, recent advances bridging the two domains are fostering collaborations. The upcoming CWI research semester programme in spring 2025, themed "Control Theory and Reinforcement Learning: Connections and Challenges", will comprise a spring school and workshops on various sub-topics, orchestrated by a distinguished team including Aditya Gilra, Bert Kappen, Debabrota Basu, Frans Oliehoek, Maryam Kamgarpour and Sean Meyn, to explore the intersections and challenges within these intertwined fields.

The proposed three-day workshop will focus on interrelated mathematical advances in each of the following highly active areas of current research: complex birational geometry (led by MMP), K-stability, and moduli spaces. These domains are of fundamental importance for the (birational) geometry and classification of complex projective varieties as well as for the understanding of their moduli spaces. The workshop will focus on some of the current frontiers that are of particular importance to each of these areas.

The school in Geilo will be devoted to selected topics in analysis, geometry, and differential equations. Participants are invited to stay from Sunday evening March 2 to Friday March 7. The scientific program for the winter school will begin in the morning of Monday March 3. The main lecturers are: - Mike Eastwood (Adelaide, Australia): Prolongation and symmetry - Karin Melnick (Luxembourg): Rigid geometric structures and their automorphism groups - Sigmund Selberg (Bergen, Norway): The geometry of the light cone, the vector fields method, and global existence for non-linear wave equations - Francisco Torres de Lizaur (Seville, Spain): Dynamics of 2D and 3D divergence-free flows, with applications to fluid mechanics and magnetohydrodynamics In addition to these, the meeting will have regular / contributed lectures by participants.

The International Workshop on Information Geometry, Quantum Mechanics and Applications is part of a series of meetings on Quantum Mechanics and its applications that are held annually either at Policeta (Italy) or Madrid. It is an international meeting devoted to the study of the mathematical foundations of Quantum Mechanics and their applications, many of them instrumental in the emergent problems related to Quantum Information Technologies. The objective of this workshop is to present a few relevant problems in the foundations of Quantum Mechanics to a small number of young researchers (Post and Pre doctoral) and to work in a collaborative environment.

Researchers working on graph algorithms use a broad range of different criteria for deciding what makes an algorithm efficient. While in theory the dominant benchmark is the asymptotic running time, in practice the story is more nuanced: an algorithm needs to be simple enough to be implementable, fast on graphs of bounded size, space efficient, cache-friendly, and easy to test. While many of these requirements motivate interesting algorithmic questions that are highly relevant in practice, they are often overlooked by the theory community. The goal of the workshop is to foster the exchange of ideas between researchers working on graph algorithms, which have high practical relevance. The workshop will include overview talks on the various perspectives, research talks, an open problem session, and structured time for collaboration. The topics of the workshop include fundamental data science graph algorithms (e.g., clustering, partitioning, graph embedding), graph neural networks, and modeling data using networks (e.g. approximate nearest neighbor search). Additionally, the workshop program incorporates problems and approaches necessitated by scaling graph algorithms to large datasets (e.g. parallel, distributed, dynamic and external memory models, as well as algorithm engineering).