Deformation theory and curvature of direct image sheaves

Deformation theory and curvature of direct image sheaves

강연자 최영준
소속 부산대학교

An important problem in complex geometry is to classify complex manifolds up to biholomorphism. Deformation theory approaches this problem by studying how complex structures vary in holomorphic families and relating these variations to the geometry of their parameter spaces.

In this talk, we use compact Riemann surfaces as our main examples to explain this viewpoint. Kodaira–Spencer theory describes infinitesimal changes of complex structure, and the L² pairing of their harmonic representatives defines the Weil–Petersson metric. The curvature of this metric provides information about the geometry of the moduli space of Riemann surfaces.

These ideas extend to families of higher-dimensional compact Kähler manifolds through higher direct image sheaves, which organize the cohomology of the fibers. Their natural L² metrics provide a broader framework for understanding the relationship between deformation and curvature. We will present general results on the curvature of these metrics and discuss several applications.

<학부생을 위한 ɛ 강연> Exploring Variational Problems over Graphons with a Tailored Neural Architecture and LLMs

강연자 : 양홍석 | 소속 : 고등과학원

In this talk, I will describe our neural framework for exploring variational problems over graphons—symmetric measurable functions from [0,1]^2 to [0,1] that serve as limit objects for dense graph sequences. These problems arise in two areas of mathematics: extremal graph theory, which studies the optimisation of graph parameters under constraints, often in the limit as the number of vertices grows; and large-deviation theory for dense random graphs, which uses constrained graphon optimisation to study the probabilities and typical structures of rare events. We represent graphons with implicit neural networks and optimise graphon objectives by gradient descent. Our approach combines three ingredients: a multiscale sinusoidal residual architecture designed to capture sharp, step-like graphons; an embedded solver that enforces a single empirical density constraint, with gradients computed by implicit differentiation; and symmetry-aware Monte Carlo estimators. For generalised Turán problems whose known solutions required substantial human effort, our framework recovers known optimal graphons without human intervention. Applied to open instances, it produces candidate optima, including a previously unreported family of candidate extremal structures. This led us to a Goodman-type conjecture for odd-cycle densities, which we subsequently proved and formalised in Lean with the help of LLMs. For variational problems arising in large-deviation theory for Erdős–Rényi random graphs, the framework produces new candidate optimal graphons in both upper- and lower-tail regimes for several pattern graphs. In the upper-tail regime, these candidates achieve better objective values than the best-known benchmark construction due to Lubetzky and Zhao.