학과 세미나 및 콜로퀴엄
Since the development of the first randomized polynomial-time algorithm for volume computation by Dyer, Frieze, and Kannan in 1989, convex-body sampling has been a central problem at the intersection of algorithms, geometry, and probability. A major milestone came in 1997, when Kannan, Lovász, and Simonovits analyzed the Ball Walk and formulated the influential KLS conjecture. This was extended to log-concave distributions by Lovász and Vempala in 2006, and further accelerated by Cousins and Vempala in 2015 through warm-start generation techniques.
In this talk, I will present a gentle introduction to these milestones and how they have been streamlined and improved in the past few years. The talk is based on joint work with Santosh Vempala.
Interactive theorem provers (ITPs) are becoming crucial in mathematics, supporting the development of fully verified proofs and mathematically rigorous infrastructure.
Their importance comes not only from catching mistakes that humans overlook, but also from enabling large-scale formalization projects that would be impossible to manage manually.
In this talk, I will give an accessible overview of formalizing mathematics in Lean4 and outline how its underlying theory and tooling support modern proof development.
In advance, I will present several mathematical projects that showcase the strengths of ITPs.
Room B332, IBS (기초과학연구원)
이산수학
Donggyu Kim (Georgia Institute of Technology)
Grassmann-Plücker functions for orthogonal matroids
Room B332, IBS (기초과학연구원)
이산수학
We present a new cryptomorphic definition of orthogonal matroids with coefficients using Grassmann-Plücker functions. The equivalence is motivated by Cayley’s identities expressing principal and almost-principal minors of a skew-symmetric matrix in terms of its pfaffians. As a corollary of the new cryptomorphism, we deduce that each component of the orthogonal Grassmannian is parameterized by certain part of the Plücker coordinates.
This is joint work with Changxin Ding.
Theorem proving with large language models has recently gained substantial attention as a direction for developing trustworthy and verifiable AI reasoning. This talk gives a brief introduction to the proof assistant Lean, which provides the verification layer for formal theorem proving, and reviews recent trends in LLM-based theorem proving. These methods rely increasingly on natural-language descriptions of mathematical arguments, which brings renewed attention to the relationship between informal mathematical language and formal representations. I will discuss the gap between natural-language mathematical expressions and the formal representations, and explain why the high level of abstraction in existing formal structures can be a limitation for natural-language–driven methods. This motivates the need for more human-oriented forms of formalization. As one approach, I will present a rule-based method for autoformalization. This talk is based on the work done at the 2025 KIAS winter school on Mathematics and AI.
Our approach relies on input-convex neural networks (ICNNs) to discretize the
JKO steps, which can be optimized by stochastic gradient descent. Unlike previous
work, our method does not require domain discretization or particle simulation.
As a result, we can sample from the measure at each time step of the diffusion
and compute its probability density. We demonstrate our algorithm’s performance
by computing diffusions following the Fokker-Planck equation and apply it to
unnormalized density sampling as well as nonlinear filtering.
Room B332, IBS (기초과학연구원)
이산수학
Chi Hoi Yip (Georgia Institute of Technology)
Cliques in Paley graphs and cyclotomic graphs
Room B332, IBS (기초과학연구원)
이산수학
Given a prime power $q \equiv 1 \pmod 4$, the Paley graph of order $q$ is the graph defined over $\mathbb{F}_q$ (the finite field with $q$ elements), such that two vertices are adjacent if and only if their difference is a square in $\mathbb{F}_q$. In this talk, I will present some recent progress on the clique number of Paley graphs of non-square order, the characterization of maximum cliques in Paley graphs of square order, as well as their extensions to cyclotomic graphs. In particular, I will highlight a new proof of the Van Lint–MacWilliams’ conjecture using ideas from arithmetic combinatorics.
In doing mathematics, we often encounter beautiful identities and proofs, shining like a full moon in the night sky. Some of them have combinatorial flavors.
This talk is an introduction to combinatorial proof methods using bijections and weight-preserving-sign-reversing involutions, with examples including Franklin's bijective proof of the Euler pentagonal number theorem, a combinatorial proof of the Cayley-Hamilton theorem, the Robinson-Schensted correspondence and recent combinatorial proofs of some identities involving secant
and tangent numbers.
The phase-field (PF) model has been applied to a wide range of problems beyond its traditional scope in materials science. In this study, we reinterpret the Allen–Cahn (AC) equation, the governing equation of the PF model, as a mathematical framework for data classification. We develop an efficient numerical scheme to solve the AC equation with a fidelity term, employing an explicit-type approach based on the convex splitting method to ensure both energy stability and computational efficiency. Comparative experiments with conventional machine learning classifiers, such as support vector machines and artificial neural networks, demonstrate that our approach achieves competitive accuracy at significantly reduced computational cost. Moreover, the proposed PDE-informed framework exhibits superior performance on unbalanced datasets, where traditional classifiers often fail to generalize effectively.
Room B332, IBS (기초과학연구원)
이산수학
Tuukka Korhonen (University of Copenhagen)
Dynamic Treewidth in Logarithmic Time
Room B332, IBS (기초과학연구원)
이산수학
We present a dynamic data structure that maintains a tree decomposition of width at most 9k+8 of a dynamic graph with treewidth at most k, which is updated by edge insertions and deletions. The amortized update time of our data structure is $2^{O(k)} \log n$, where n is the number of vertices. The data structure also supports maintaining any “dynamic programming scheme” on the tree decomposition, providing, for example, a dynamic version of Courcelle’s theorem with $O_k(\log n)$ amortized update time; the $O_k(⋅)$ notation hides factors that depend on k. This improves upon a result of Korhonen, Majewski, Nadara, Pilipczuk, and Sokołowski [FOCS 2023], who gave a similar data structure but with amortized update time $2^{k^{O(1)}} n^{o(1)}$. Furthermore, our data structure is arguably simpler. Our main novel idea is to maintain a tree decomposition that is “downwards well-linked”, which allows us to implement local rotations and analysis similar to those for splay trees.
This talk is based on arXiv:2504.02790.
Let A be a random n×n matrix with independent entries, and suppose that the entries are “uniformly anticoncentrated” (for example, A could be a uniformly random n×n matrix with ±1 entries). We prove that the permanent of A is exponentially anticoncentrated, significantly improving previous bounds of Tao and Vu. Our proof also works for the determinant, giving an alternative proof of a classical theorem of Kahn, Komlós and Szemerédi. Joint work with Zach Hunter and Lisa Sauermann.
A (positive definite and integral) quadratic form $f$ is called irrecoverable (from its subforms) if there is a quadratic form $F$ that represents all proper subforms except for $f$ itself, and such a quadratic form $F$ is called an isolation of $f$. In this talk, we present recent advances on irrecoverable quadratic forms and discuss their possible generalizations.
Khovanov homology is a knot homology theory, introduced by M. Khovanov in 2000 as a categorification of the Jones polynomial. Equivariant versions of Khovanov homology are also known, and they play an important role in understanding the Rasmussen invariant. In this talk, I will present the results established in my joint work with M. Khovanov in September 2025 (arXiv:2509.03785): (i) an order-two symmetry inherent in equivariant Khovanov homology, (ii) the existence of a signed Shumakovitch operator, and (iii) its relationship to the Rasmussen invariant.
We renormalize the Chern-Simons invariant for convex-cocompact hyperbolic 3-manifolds, finding the explicit asymptotics along an equidistance foliation. We prove that the divergent terms are completely expressed in terms of the data from the Weitzenböck geometry of hyperbolic ends and the conformal boundary. For this, it is essential to extend the framework of submanifolds in Riemannian geometry to Riemann-Cartan geometry, which addresses connections with torsion. This procedure naturally introduces a complex-valued geometric quantity consisting of mean curvature and torsion 2-form, which appears in the leading coefficient of the asymptotics. We also obtain several geometric results regarding the complex-valued quantity that generalize classical minimal surface theory.
심사위원장: 백형렬, 심사위원: 박진성(KIAS), 김현규(KIAS), 박정환, 최서영.
심사위원장: 백형렬, 심사위원: 박진성(KIAS), 김현규(KIAS), 박정환, 최서영.
Neural networks have become increasingly effective for approximating solutions to partial differential equations (PDEs). This talk presents three advances that improve both accuracy and computational efficiency. First, I introduce an augmented Lagrangian formulation of the physics-informed loss that strengthens constraint enforcement and improves accuracy near domain boundaries. Second, I develop efficient architectures based on hypernetworks and graph neural networks that learn PDE solution operators with markedly small model sizes. Finally, I describe Neural-Galerkin schemes with low rank approximations for operator learning, which achieves a favorable accuracy-efficiency trade-off.
I will discuss recent progress on the vanishing-viscosity limit of the two-dimensional Navier–Stokes equation. Our approach is Lagrangian and probabilistic:
1. We develop a stochastic counterpart of the DiPerna–Lions theory to construct and control stochastic Lagrangian flows for the viscous dynamics.
2. We also establish a large-deviation principle that quantifies convergence to the Euler dynamics.
This talk is based on joint work with Chanwoo Kim, Dohyun Kwon, and Jinsol Seo.
We briefly introduce the restriction theory in harmonic analysis and its connections with PDEs through Strichartz estimate.
We then discuss the Kakeya and multilinear Kakeya estimates, which naturally arise from restriction theory.
The main part of the talk will focus on Larry Guth’s proof of the multilinear Kakeya estimate via the induction on scales method.
The syzygy scheme is the scheme defined by the quadric forms associated to the linear syzygies of certain order of a given scheme. It is natural to ask whether the syzygy scheme is equal to the scheme itself. In this talk, I will discuss about the classification of the second syzygy schemes for 4-gonal canonical curves of genus at least 6. This talk is based on the work by Aprodu-Bruno-Sernesi.
Geometric evolution equations describe how geometric objects such as curves, surfaces, or metrics evolve toward more symmetric or optimal shapes. Among the most fundamental examples are the mean curvature flow and the Ricci flow, which have played central roles in modern differential geometry and topology. In this talk, I will give an introduction to these flows, explaining how curvature acts as a driving mechanism that smooths and reshapes geometry. I will also outline the key ideas behind Perelman’s proof of the Poincaré conjecture, focusing on the role of singularity formation and the classification of canonical neighborhoods. Finally, I will discuss the problem of classifying singularity models arising under geometric flows and present some recent progress on the classification of ancient oval solutions, together with possible further directions.
This talk explores the relationship between 3-dimensional lens spaces and smooth 4-manifolds that bound them under various topological constraints—topics that connect to several central conjectures in low-dimensional topology. After reviewing the classifications of Lisca, Greene, and Aceto–McCoy–JH Park, I will present recent joint work with Wookhyeok Jo and Jongil Park investigating which lens spaces can bound smooth 4-manifolds with second Betti number one. In particular, we exhibit infinite families of lens spaces that bound simply connected 4-manifolds with b₂ = 1, yet do not bound 4-manifolds consisting of a single 0-handle and 2-handle. Moreover, we construct infinite families of lens spaces that bound 4-manifolds with b₁ = 0 and b₂ = 1, but do not bound simply connected 4-manifolds with b₂ = 1. These constructions are motivated by the study of rational homology projective planes with cyclic quotient singularities.
Self-improving properties are a kind of fundamental regularity results in the theory of elliptic equations. However, for nonlocal elliptic equations, establishing this property is significantly more comlicated than in the local setting. In the first part of this talk, we will discuss several results and arguments that demonstrate this self-improving property. We will also present an ongoing project on self-improving properties for equations with fractional Orlicz growth, which is joint work with Kyeong Song (KIAS).
In the second part, we will address the optimality of these self-improving properties. Classically, this optimality was established by Meyers in 1963 by constructing a counterexample. We will present a nonlocal analogue of Meyers' example. The construction the example is based on Fourier transform techniques for distributional convolutions. One of the key feature of our example is its robustness: It remains valid as the order of the nonlocal operator converges to 2, the order of a classical second-order elliptic operator. This is joint work with Anna Balci, Lars Diening, and Moritz Kassmann (Bielefeld University).
In this talk, we introduce a generalized Schauder theory for degenerate and singular parabolic equations. The key idea is an approximation scheme based on fractional-order polynomials—s-polynomials—which replace constant coefficients in the classical setting. This approach not only recovers the classical regularity results for uniformly parabolic equations but also extends to operators where traditional bootstrap arguments are difficult to apply.
The celebrated Fredholm alternative theorem works for the setting of
identity compact operators. This idea has been widely used to solve
linear partial differential equations. In this talk, we demonstrate a
generalized Fredholm theory in the setting of identity power compact
operators, which was suggested in Cercignani and Palczewski to solve
the existence of the stationary Boltzmann equation in a slab domain.
We carry out the detailed analysis based on this generalized Fredholm
theory to prove the existence theory of the stationary Boltzmann
equation in bounded three-dimensional convex domains. To prove that
the integral form of the linearized Boltzmann equation satisfies the
identity power compact setting requires the regularizing effect of the
solution operators. Once the existence and regularity theories for the
linear case are established, with suitable bilinear estimates, the
nonlinear existence theory is accomplished. This talk is based on a
collaborative work with Daisuke Kawagoe and Chun-Hsiung Hsia.
Room B332, IBS (기초과학연구원)
이산수학
Fedor Noskov (Moscow Institute of Physics and Technology)
Polynomial dependencies in hypergraph Turan-type problems
Room B332, IBS (기초과학연구원)
이산수학
Consider a general Turan-type problem on hypergraphs. Let $\mathcal{F}$ be a family of $k$-subsets of $[n]$ that does not contain sets $F_1, \ldots, F_s$ satisfying some property $P$. We show that if $P$ is low-dimensional in some sense (e.g., is defined by intersections of bounded size) then, under polynomial dependencies between $n, k$ and the parameters of $P$, one can reduce the problem of maximizing the size of the family $|\mathcal{F}|$ to a finite extremal set theory problem independent of $n$ and $k$. We show that our technique implies new bounds in a number of Turan-type problems including the Erdős-Sós forbidden intersection problem, the Duke-Erdős forbidden sunflower problem, forbidden $(t, d)$-simplex problem and the forbidden hypergraph problem. Furthermore, we also briefly discuss the connection between the aforementioned reduction and the measure boosting argument based on the action of a certain semigroup on the Boolean cube. This connection turns out to be fruitful when extending extremal set theory problems to domains different from $\binom{[n]}{k}$.
Joint work with Liza Iarovikova, Andrey Kupavskii, Georgy Sokolov and Nikolai Terekhov
In this talk, I will present the local existence theory for quasilinear symmetric hyperbolic systems, based on Sections 1.3 and 2.1 of [1]. I will begin by reviewing the framework of symmetric systems and then explain how it is applied to establish local-in-time existence of classical solutions.
The main focus will be on the iteration scheme, energy estimates, and convergence arguments. We aim to understand how regularity and a priori bounds are used to construct solutions from smooth initial data.
In this presentation, we discuss recent existence results for nonlinear diffusion equations with a divergence-type drift term, which are broadly applicable to various reaction-diffusion equations, including Keller-Segel models. We focus on identifying appropriate functional spaces for the drift, guided by the nonlinear diffusion and initial data. Using techniques from the theory of Wasserstein spaces, we construct weak solutions and establish their regularity properties.
Associated to a group action on a bifoliated plane, satisfying some reasonable conditions, one can associate a combinatorial object known as a veering triangulation. Since their introduction by Agol (in a very different setting), these triangulations have recently played an interesting role in studying pseudo-Anosov flows, the structure of fibered 3-manifolds, algorithmic properties of mapping class groups, and fixed points of surface homeomorphisms, to name just a few (from my own biased perspective). This talk will be an overview of these applications, starting with the most basic properties from the initial bifoliated plane.
In this talk, we will discuss Leray-Hopf solutions to the incompressible Navier-Stokes equations with vanishing viscosity. We explore important features of turbulence, focusing around the anomalous energy dissipation phenomenon. As a related result, I will present a recent result proving that for two-dimensional fluids, assuming that the initial vorticity is merely a Radon measure with nonnegative singular part, there is no anomalous energy dissipation. Our proof draws on several key observations from the work of J. Delort (1991) on constructing global weak solutions to the Euler equation. We will also discuss possible extensions to the viscous SQG equation in the context of Hamiltonian conservation and existence of weak solutions for a rough initial data.
Room B332, IBS (기초과학연구원)
이산수학
Simón Piga (University of Hamburg)
Turán problem in hypergraphs with quasirandom links
Room B332, IBS (기초과학연구원)
이산수학
Given a $k$-uniform hypergraph $F$, its Turán density $\pi(F)$ is the infimum over all $d\in [0,1]$ such that any $n$-vertex $k$-uniform hypergraph $H$ with at least $d\binom{n}{k}+o(n^k)$ edges contains a copy of $F$. While Turán densities are generally well understood for graphs ($k=2$), the problem becomes notoriously difficult for $k\geq 3$, even for small hypergraphs.
We study two well-known variants of this Turán problem for hypergraphs: first, under minimum codegree conditions and, second, with a quasirandom edge distribution. Each variant defines a distinct extremal parameter, generalising the classical Turán density. Here we present recent results in both settings, with a particular emphasis on the case of hypergraphs where every link is itself quasirandom. Our results include exact solutions for key hypergraphs and general results about the behaviour of the Turán density functions.
For many variant kinetic equations, we choose an appropriate approx-
imatation equations. Also, this approximation equations are solvable more easier than the
original equations and it retains the expected a priori bounds. Then, we use the variant
compactness theorem to pass to the limit in the sense of distributions in the approximation
equations. In the kinetic theory, this compactness theorem is called the averaing lemma,
that is, the averaging in velocity improves regularity in the space and time variables. For
this PDE seminar, we study the basic averaging lemma. In other words, we investigate the
basic properties of the free transport operator ∂t + v · ∇x.
In this talk, I will try to explain how the essence of the Weierstrass representation formula and the Bjorling representation formula for minimal surfaces in $E^3$ can be suitably applied to zero/constant mean curvature surfaces in the three-dimensional spaceforms in the Lorentz-Minkowski four-space.
In this talk, we introduce the concept of t-core partitions. We discuss the generating function and modularity, along with some results and applications of t-core partitions. Recent results on simultaneous core partitions will also be presented. Toward the end of the talk, we introduce numerical semigroups and explore connections between numerical semigroups (or numerical sets) and partitions. Additionally, we present some open problems related to these topics.
We study the partial dimensional semi-classical Weyl’s laws, describing the quantum subband structures for two-dimensional electron gases (2DEGs). As a simple application, we derive lowest free energy states for the subband models describing non-interacting 2DEGs.
We study the partial dimensional semi-classical Weyl’s laws, describing the quantum subband structures for two-dimensional electron gases (2DEGs). As a simple application, we derive lowest free energy states for the subband models describing non-interacting 2DEGs.
Room B332, IBS (기초과학연구원)
이산수학
Ahmed Ghazy & Tim Hartmann (CISPA Helmholtz Center for Information Security & )
Continuous Graphs – An Overview and a Coloring Problem
Room B332, IBS (기초과학연구원)
이산수학
We consider a continuous model of graphs, introduced by Dearing and Francis in 1974, where each edge of G to be a unit interval, giving rise to an infinite metric space that contains not only the vertices of G but all points on all edges of G. Several standard graph problems can be defined and studied on continuous graphs, yielding many surprising algorithmic results and combinatorial connections.
The motivation can be exemplified by the well-known Independent Set problem on graphs. Given a graph G, we want to place k facilities that are pairwise at least a distance 2 edge lengths apart. In some applications, such as when the underlying graph represents a street network, it is reasonable to allow placing a facility not only at a crossroad but also somewhere within a street, that is, not only at a vertex but also at any point on an edge between two vertices. This motivates the study of the Independent Set problem on continuous graphs. In such a setting, for example, the problem corresponds to requiring pairwise distance r=2 for the placed facilities. However, we may also study the problem where we fix r to any positive integer, rational, or even irrational number. Other problems studied in the continuous model include Dominating Set, TSP, and Coloring.
In the first part of this talk, we will give a general overview of research on continuous graphs and computational problems in this setting.
In the second part, we explore, as part of recent work, a coloring problem on continuous graphs akin to the well-known Hadwiger-Nelson Problem.
Based on joint work with Fabian Frei, Florian Hörsch, Tom Janßen, Stefan Lendl, Dániel Marx, Prahlad Narasimhan, and Gerhard Woeginger.
The Lyapunov-Schmidt reduction is a powerful tool to solve PDEs. This method reduces the equations, which are essentially infinite-dimensional, to finite-dimensional ones. In this talk, we illustrate the reduction by showing the existence of a positive solution to the singularly perturbed problem in for positive smooth and appropriate . To show the existence, we first construct an -dimensional surface of approximate solutions. Then, we reduce the problem onto that surface by the Lyapunov-Schmidt reduction. The key to the reduction is proving the invertibility of a certain operator, which in turn, is proved by a certain uniqueness result. After the reduction, we end the proof by solving the equation on the -dimensional surface.
