Please share this opportunity with potentially interested students and postdocs.

The application deadline for the Heidelberg Laureate Forum (HLF) 2026 is Feb 11, 2026. See https://www.heidelberg-laureate-forum.org/ for details.

The HLF offers a rare opportunity for students, PhD candidates, and postdocs in mathematics and computer science to spend a week interacting with Abel Prize, Fields Medal, Turing Prize, ACM Prize in Computing, IMU Abacus Medal and Nevanlinna Prize laureates, as well as with other outstanding international early-career mathematicians and computer scientists from around the world, and a variety of distinguished guests. The program includes lectures, workshops, panel discussions, networking events, and more. All local expenses (hotel and meals) are covered and an option to apply for travel funding exists if needed.

Participating in an HLF is a wonderful opportunity in many ways.

A conference on the occasion of Annette Werner's 60th birthday

Conference in honor of Alexander Kechris, focusing on Descriptive Set Theory and its applications to other fields of mathematics.

This international conference focuses on the interplay between modular forms, geometry, complex analysis, dynamical systems, and combinatorics. Modular forms encode deep arithmetic information through L-functions and Galois representations. Complex analytic methods (Bergman spaces, growth estimates, analytic continuation) investigate hyperbolicity in complex geometry. Dynamics such as Perron numbers and β‑expansions illustrate how symbolic dynamics encodes arithmetic information. Special functions (theta functions, hypergeometric series, orthogonal polynomials) and combinatorics serve as a bridge linking these areas.

The nineteenth annual Binghamton University Graduate Combinatorics Algebra and Topology Conference (BUGCAT Conference) will meet November 21-22, 2026 at Binghamton University. Graduate students at all levels, as well as faculty, are invited to give a 20-minute talk; talks may be expository or on current research. This year, we have three distinguished keynote speakers: Casey Donoven (Montana State University Northern), Ben Knudsen (Colorado State University) and Pablo Soberón (City University of New York).

The Stellenbosch Number Theory conference is held every two years to attract international experts to South Africa to enrich our research and postgraduate experiences. The theme is broadly around number theory and arithmetic geometry, but does not have a narrow focus on any specific area. Often we have talks on a variety of topics ranging from elliptic curves to modular forms to function field arithmetic to rational points on varieties to model theoretic approaches and more.

The Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM) is a biennial meeting, held in odd numbered years, that brings together researchers from the various disciplines with which discrete and algorithmic mathematics interact. The general topic of the conference is the theory and application of discrete structures and algorithms. Its goal is to highlight the most salient trends in the field. Particular areas of interest include additive combinatorics, algebraic combinatorics, analytic combinatorics, coding theory, combinatorial algorithms, combinatorial games, combinatorial matrix theory, combinatorial optimization, computational complexity, computational geometry, design theory, directed graphs, enumeration, extremal combinatorics, graph theory, hypergraphs, matroid theory and probabilistic combinatorics with applications to diverse areas including artificial intelligence, biology, chemistry, computer science, cryptography, information processing, large networks, physics and quantum information theory.

A three day crash course into the OSCAR computer algebra system at TU Berlin, a week before the SIAM AG 2027 in Osnabrueck, focusing on topics around applied algebraic geometry. Both beginners and experienced programmers are welcome!

For beginners, the first two days will cover the basics of programming in Julia and OSCAR. For experienced programmers, the first two days will cover advanced topics such as the internals of OSCAR. The final day will feature parallel tracks dedicated to specialized topics, such as:

• algebraic statistics
• polynomial system solving
• tropical geometry
• etc

We expect funding to be available to support early career researchers. More info to come. If you are interested and want to be kept in the loop, please contact the organizers.