The goal of this workshop is to bring together both senior and junior specialists in the fields of almost complex and non-Kähler geometry to present their latest achievements in research.

This workshop is organized to honor János Pintz on the occasion of his 75th birthday. Our invited speakers will bring together various fields of number theory, including analytic prime number theory and classical L-functions, the analytic theory of automorphic forms and automorphic L-functions, additive combinatorics, diophantine equations, and Beurling generalized primes.

Part of the thematic semester New Directions in Modern Harmonic Analysis and Applications January-June 2026) hosted by the Erdős center.

Part of the thematic semester New Directions in Modern Harmonic Analysis and Applications (January-June 2026) hosted by the Erdős Center.

The Workshop will highlight the enumerative and birational geometry of the moduli spaces of curves, abelian varieties and K3 surfaces, etc.

The Workshop will focus on modern techniques in the classification theory of higher dimensional algebraic varieties, highlighting connections to K-stability and singularity theory. Part of the thematic semester Algebraic Geometry (August-December 2026) hosted by the Erdős Center.

Ordered structures arise naturally in many problems and proofs in discrete geometry. For example, the unit distance problem for convex polygons stimulated the extremal theory of 0–1 matrices. Similarly, the study of point-set configurations, known as the study of order types, plays an important role in geometric problems such as rectilinear crossing numbers and the happy ending problem.

In extremal, probabilistic, and structural combinatorics, many objects and arguments possess natural orderings. For example, the Erdős–Hajnal stepping-up argument for hypergraph Ramsey numbers processes vertices one by one according to a fixed order. Similarly, the resolution of the Stanley–Wilf conjecture relies on 0–1 matrices, which may be viewed loosely as ordered analogues of bipartite graphs.