Department Seminars & Colloquia
When you're logged in, you can subscribe seminars via e-mail
I will discuss how Gibbs measures concentrate and exhibit two distinct central limit theorems around multi-vortex manifold in QFT, especially in comparison with point vortices in incompressible fluids/Coulomb gases.
Joint work with Martin Hairer.
We study the semiclassical limit of the two-dimensional Dirac--Hartree equation in the presence of a periodic external potential. The spinor dynamics are formulated using the matrix-valued Wigner transform together with spectral projectors onto the positive and negative energy bands. Under suitable assumptions on the initial data and the potentials, we rigorously derive Vlasov-type transport equations describing the evolution of the band-resolved phase-space densities in both the massive and massless regimes. In the massless case, the limiting dynamics propagate ballistically with constant speed, while in the massive case the velocity is relativistic. Our analysis justifies the emergence of relativistic Vlasov equations from Dirac--Hartree dynamics in the semiclassical regime. As a corollary, we recover the relativistic Vlasov--Poisson equation from the Dirac equation with a regularized Coulomb interaction when the regularization vanishes together with the semiclassical parameter. This talk is based on the joint work with Kunlun Qi.
Using an operator-theoretic approach, we provide a unified framework for Optimal Transport (OT) between Gaussian measures on separable Hilbert spaces. This formulation allows us to fully characterize the Monge and Kantorovich problems without imposing any regularity or non-degeneracy conditions on the covariance operators. We then develop the dynamic picture, explicitly characterizing 2-Wasserstein geodesics and particle dynamics in this general setting. Extending these results to Entropic OT, we show that the optimal entropic coupling operates as a precise spectral shrinkage of the correlation operator. Time permitting, I will discuss the algorithmic advantages of this spectral perspective and present complementary viewpoints connecting these transport problems.
Functional principal component analysis (FPCA) is a fundamental tool for exploring variation in samples of random curves or surfaces. We propose a new approach to FPCA for functional data observed irregularly and sparsely over their domains, based on smoothing directly at the level of the eigenfunctions. Our formulation leads to an efficient optimization-based procedure whose computational and storage costs are comparable to those of standard multivariate PCA for regularly observed data. The method is flexible with respect to domain geometry and model class, accommodates structural constraints and penalties, and facilitates uncertainty quantification via resampling and asymptotic theory.
Room B332, IBS (기초과학연구원)
Discrete Mathematics
Stefan Weltge (Technical University of Munich)
The relaxation complexity of the standard simplex is logarithmic
Room B332, IBS (기초과학연구원)
Discrete Mathematics
For a set $X$ of integer points, the relaxation complexity $\operatorname{rc}(X)$ is the smallest number of facets of any polyhedron P whose integer points are precisely those of X. In this paper, we focus on the case where X is the discrete standard simplex $\Delta_d = \{0, e_1, …, e_d\}$. We show that $\operatorname{rc}(\Delta_d) = O(\log d)$ by an explicit, elementary construction. This improves upon the previously best-known upper bound $\operatorname{rc}(\Delta_d) = O(d / \sqrt{\log d})$ due to Aprile, Averkov, Di Summa, and Hojny (2022) and matches an asymptotic lower bound by Averkov and Schymura (2020). This is joint work with Simon Keil.
Wall's stabilization principle suggests that exotic phenomena in dimension four in the orientable category disappear after taking connected sums with sufficiently many S2xS2. Since most known exotic pairs of closed 4-manifolds become diffeomorphic after one stabilization, a natural question was: is a single S2xS2 enough? Recently, Jianfeng Lin constructed an exotic diffeomorphism on a closed 4-manifold-a diffeomorphism topologically isotopic to the identity but not smoothly isotopic-that survives one stabilization. In this talk, we provide a relative exotic diffeomorphism on a compact contractible 4-manifold that survives two stabilizations. This gives the first exotic phenomenon in the orientable category that survives two stabilizations. The obstruction to stabilization comes from equivariant Seiberg–Witten theory, together with a version of lattice homology. I will also survey some background and recent developments in equivariant gauge theory.
This is joint work with Sungkyung Kang and JungHwan Park.
Room B332, IBS (기초과학연구원)
Discrete Mathematics
Ting-Wei Chao (MIT)
The Oddtown Problem Modulo a Composite Number
Room B332, IBS (기초과학연구원)
Discrete Mathematics
A family of sets in $[n]$ is called an $\ell$-Oddtown if the sizes of all sets are not divisible by $\ell$, but the sizes of pairwise intersections are divisible by $\ell$. The problem was completely solved when $\ell$ is a prime via an elegant linear algebraic method, showing that the family has size at most $n$. However, not much was known for composite numbers. By splitting the family into families correspond to each prime factor of $\ell$, one can show that the number is at most $\omega n$, where $omega$ is the number of prime factors of $\ell$. We used both combinatorial and Fourier analytic arguments to prove that the number of sets in any $\ell$-Oddtown is at most $\omega n-(2\omega+\varepsilon)\log_2 n$ for most $n,\ell$.
Zoom Meeting
Inverse Problems
최재웅 (성균관대학교 통계학과)
Neural Optimal Transport for Inverse Problems: From Image Inverse Problems to Hilbert-Space Operator Learning
Zoom Meeting
Inverse Problems
Inverse problems aim to recover unknown signals from corrupted measurements, often under limited or unpaired data. In this talk, I will present two recent directions in Neural Optimal Transport motivated by inverse problems and function-space learning. First, I will introduce UOTIP, which formulates unpaired image inverse problems as an Unbalanced Optimal Transport map from noisy measurements to clean signals. By incorporating a likelihood-based cost, UOTIP admits a MAP-estimation interpretation, improves robustness to multi-level noise and class imbalance, and provides a theoretical guarantee for the existence and uniqueness of the transport map. Second, I will discuss HiSNOT, which extends Semi-dual Neural Optimal Transport to infinite-dimensional Hilbert spaces, providing a theoretical foundation for function-to-function transport maps relevant to Neural Operator learning. To address the spurious solution problem arising from the low-dimensional structure of functional data, HiSNOT employs principled Gaussian smoothing with provable convergence guarantees. Together, these works suggest a path toward extending Neural Optimal Transport from image inverse problems to stable operator learning in function spaces.
(세미나 ZOOM 링크: https://cau.zoom.us/j/88050404196// 회의 ID: 880 5040 4196)
(세미나 ZOOM 링크: https://cau.zoom.us/j/88050404196// 회의 ID: 880 5040 4196)
XGBoost is one of the most successful machine learning methods in practice, yet its theoretical foundations remain poorly understood. In particular, despite its widespread use, there is currently no rigorous characterization of the function class that XGBoost is capable of learning. In this talk, I will present a theoretical framework that addresses this question.
I will introduce an infinite-dimensional function class that extends finite ensembles of bounded-depth regression trees, together with a complexity measure that generalizes the regularization penalty used by XGBoost. I will show that every minimizer of the XGBoost objective is a minimizer of an equivalent penalized regression problem over this larger function class, thereby revealing the function class that XGBoost implicitly targets.
I will also discuss a smoothness-based characterization of this function class, connecting XGBoost to classical smoothness-based methods in nonparametric regression. Finally, I will present statistical guarantees showing that least squares estimation over this class achieves nearly minimax-optimal rates of convergence without suffering from the curse of dimensionality. These results provide a theoretical explanation for why XGBoost performs well in practice.
(This is a seminar talk given by an undergraduate student, Mr. Rayhyun Kim, after his individual reading course studies.)
In this seminar, I want to discuss about some basic notions of homological algebra that appears in category of sheaves.
Many useful functors which are not exact, and the failure of exactness often contains important information. In the sheaves category this point of view naturally leads to sheaf cohomology.
Going one step further, I will also discuss how sheaf cohomology is related to higher direct images. From this perspective, I would like to explain how inverse and direct image functors, their adjunction, and the derived functors of left exact functors fit together in a natural example.
TBA
(This is a seminar talk given by Mr. Joon Song, an undergraduate student, after his individual reading studies.)
In many situations one meets the same phenomenon: a short exact sequence gives rise to a long exact sequence in cohomology. However, the construction of such long exact sequences differs from case to case. In particular, the construction of the long exact sequence in sheaf theory is different from that of complexes. Is there a single framework where all long exact sequence arise in the same way? This leads to distinguished triangles which generalize the short exact sequence. In this presentation, I will introduce abelian categories, resolutions, and the derived category with their basic properties, and show how we can use the derived category briefly, through derived functor.
Flagella-driven motility is one of the most prevalent locomotion strategies employed by microorganisms. Numerous species of flagellated microorganism exhibit remarkable proficiency in navigating aqueous environments while simultaneously interacting with the physical and chemical properties of their microenvironments to facilitate various biological functions. Deciphering the underlying mechanisms of locomotion presents a significant challenge, necessitating a multidisciplinary framework that integrates principles from biology, physics, engineering, and applied mathematics. In this presentation, I will introduce a suite of mathematical models developed to investigate the propulsion mechanisms of microswimmers, with a focus on the hydrodynamic complexities associated with species such as Escherichia coli, Pseudomonas putida, Campylobacter jejuni and green algae Chlamydomonas reinhardttii. These computational simulations not only demonstrate strong agreement with experimental data but also provide novel insights into the biophysical principles governing swimming motility.
Room B332, IBS (기초과학연구원)
Discrete Mathematics
J. Pascal Gollin (University of Primorska)
Dominated balanced separators in wheel-induced-minor-free graphs
Room B332, IBS (기초과학연구원)
Discrete Mathematics
The grid theorem of Robertson and Seymour can be equivalently stated using balanced separators, that are separators whose deletion leaves every component with no more than half of the vertices of the graph, as follows. Every graph that excludes some planar graph as a minor has a balanced separator of bounded size. Building on this formulation, Gartland and Lokshtanov conjectured an induced minor version of that theorem inspired by coarse graph theory. They conjectured that every graph that excludes some planar graph as an induced minor has a balanced separator which is dominated by a bounded number of vertices. We confirm this conjecture for excluding any fixed wheel, that is, a cycle together with a universal vertex, as an induced minor.
This talk is based on joint work with Maria Chudnovsky, Matjaž Krnc, and Martin Milanič.
We prove that the infinitesimal invariant of a higher Chow cycle of type (2,3-g) on a generic abelian variety of dimension g<4 gives rise to a meromorphic Siegel modular form of (virtual) weight (Sym^4, det^-1) with at most pole of order 1, and that this construction is functorial with respect to degeneration, namely the K-theory elevator for the cycle corresponds to the Siegel operator for the modular form.
Topological Data Analysis provides tools for studying the global
structure of data: clusters, loops, holes, branching patterns, and
other geometric features that are often difficult to capture using
classical statistical methods. In this lecture, we will present, in an
informal and intuitive way, examples of tools such as persistent
homology, Mapper, Ball Mapper, and Euler characteristic curves and
profiles.
(This is a reading seminar given by the PhD Student Taeyoon Woo.)
In this reading seminar, I will go through the construction of the un/stable motivic homotopy categories and their basic properties. A brief review of the topological side will help an overview. Nisnevich topology and simplicial homotopy theory of sheaves will be the main notions for presenting an ∞-topos of motivic spaces. The unstable motivic homotopy is then defined as A^1-localization, which is modeled by a Bousfield localization. Here I will sketch a proof of the purity theorem after some basic properties. If possible, I will discuss stabilization and the representability of algebraic K-theory.
For an orthogonal modular variety, we construct a complex which is defined in terms of lattices and elliptic modular forms, which resembles the Gersten complex in Milnor K-theory, and which has a morphism to the Gersten complex of the modular variety by the Borcherds lifting. This provides a formalism for approaching the higher Chow groups of the modular variety by special cycles and Borcherds products. The construction is an incorporation of the theory of Borcherds products and ideas from Milnor K-theory.
This talk presents recent progress in differentially private hypothesis testing, focusing on the interplay between privacy, validity, and statistical efficiency. I will discuss a framework for private permutation testing that preserves finite-sample validity and extends naturally to kernel-based procedures. These ideas yield private testing methods with strong theoretical guarantees, including optimality properties in several regimes. I will then turn to minimax results for two-sample testing under central differential privacy, which reveal a rich structure in the privacy–power trade-off. The overall message is that rigorous privacy protection can be incorporated into modern hypothesis testing without sacrificing principled statistical guarantees.
Trees generalize in (at least) three different ways, CAT(0) cube complexes which is a fine metric notion, hyperbolic spaces which is a coarse metric notion and non-Hausdorff trees which is a topological notion that arises naturally when studying Anosov flows on closed three manifolds. I will discuss analogies between the three contexts with focus on recent joint work with Barthelm’e, Mann and Paulet where we build a counterpart of Hagen’s contact graph for bifoliated planes and use it to derive several genericity results for groups acting on bifoliated planes by foliation-preserving homeomorphisms.
Room B332, IBS (기초과학연구원)
Discrete Mathematics
Maria Chudnovsky (Princeton University)
Induced minors and treewidth
Room B332, IBS (기초과학연구원)
Discrete Mathematics
This talk deals with induced minor obstructions to treewidth. The natural setup for this problem is to consider the class of graphs excluding some planar graph, and some complete bipartite graph as induced minors, and some complete graph as a subgraph. Unfortunately, such classes still contain graphs of arbitrarily large treewidth. Moreover, a result of Alecu, Bonnet, Bureo Villafana and Trotignon and its extensions suggest that there is no elegant characterization of families of bounded treewidth in terms of induced obstructions.
On the other hand, it is conjectured that graphs in the classes as above have treewidth bounded by a poly-logarithmic function of their number of vertices. If true, this will imply the existence of quasi-polynomial time algorithms for a host of problems on such classes that are NP-complete in the general setting.
While this conjecture remains open, in joint work with Julien Codsi, David Fischer and Daniel Lokshtanov, we were able to prove the existence of a sub-polynomial bound on treewidth in terms of the number of vertices. This in turn leads to sub-exponential algorithmic behavior.
In this talk we will discuss some ideas of the proof, and, if time permits, some results in the more general setting when the bound on the clique size is removed.
(This is a seminar talk given by an undergraduate student, Mr. Dohyun Kwon, reporting on his reading course studies.)
This talk aims to provide a geometric analysis of hyperelliptic curves within the framework of Riemann surface theory.
In the beginning, the fundamental tools in Riemann surface theory, such as the Riemann-Roch theorem, Serre duality and the Hurwitz formula will be introduced briefly.
With these tools, we will first compute the genus of hyperelliptic curves and provide an explicit basis for the space of holomorphic 1-forms.
Then, we will focus on the relation between the canonical map and hyperelliptic curves.
The main goal is to examine the canonical map of the compact Riemann surface for cases of genus 2 or greater, and understand why it characterizes the hyperelliptic case when the canonical map fails to be an embedding.
In particular, we will explicitly observe the canonical map in genus 2 and 3 cases.
Inverse scattering problems aim to identify the geometric and material properties of scatterers from measured data. Despite their wide range of applications, these problems are inherently nonlinear and ill-posed. In this talk, we introduce the basics of inverse scattering problems, with a particular focus on acoustic obstacle scattering governed by the Helmholtz equation. After a brief overview of inverse problems, we discuss several types of inverse scattering problems and the main challenges arising in inverse obstacle scattering. We then study some commonly used reconstruction methods and approaches for these problems. In particular, we present layer potential theory, which serves as a fundamental tool in the analytical study of inverse problems.
