I will provide a brief introduction to the canonical metric problem in Kähler geometry and related objects. Then I'll explain how generalizations of these objects naturally appear in the context of partition functions of determinantal point processes on polarized Kähler manifolds. The talk will be aimed at beginning geometry students and I will be rather pedagogical. Especially, I will focus on geometric aspects of the topic, so probabilistic or physical discussion will be postponed or omitted. This is based on my recent preprint.

Let S and T be two sets of points in a metric space with a total of n points. Each point in S and T has an associated value that specifies an upper limit on how many points it can be matched with from the other set. A multimatching between S and T is a way of pairing points such that each point in S is matched with at least as many points in T as its assigned value, and vice versa for each point in T. The cost of a multimatching is defined as the sum of the distances between all matched pairs of points. The geometric multimatching problem seeks to find a multimatching that minimizes this cost. A special case where each point is matched to at most one other point is known as the geometric many-to-many matching problem. We present two results for these problems when the underlying metric space has a bounded doubling dimension. Specifically, we provide the first near-linear-time approximation scheme for the geometric multimatching problem in terms of the output size. Additionally, we improve upon the best-known approximation algorithm for the geometric many-to-many matching problem, previously introduced by Bandyapadhyay and Xue (SoCG 2024), which won the best paper award at SoCG 2024. This is joint work with Shinwoo An and Jie Xue.

In this talk, we discuss the paper “Boolean modelling as a logic-based dynamic approach in systems medicine” by Ahmed Abdelmonem Hemedan et al., Computational and Structural biotechnology journal (2022).

This is a reading seminar presented by the graduate student, Mr. Taeyoon Woo. Following the lecture note of Yuri Manin, he will study K_0 of schemes, and its essential properties, such as functoriality, projective bundle formula, filtrations, relationship to Picard group, blow-up squares, Chern classes, Todd classes and the Grothendieck-Riemann-Roch theorem.

In this series of talks, I'll present the basics of combinatorial semigroup theory, starting with elementary results and ending in recent research using high-powered tools. I'll begin by giving an overview of the elements of semigroup theory, including the analogue of Cayley's theorem, eggbox diagrams, Green's relations, inverse semigroups, and a famous result due to Green & Penrose. In the subsequent talk, I'll present the elements of presentations of semigroups, free (inverse) semigroups, Munn trees, and rewriting systems, leading into the fundamental problem central to combinatorial semigroup theory: the word problem. In the next talk, I'll dive into a particular class of semigroups called "special" monoids, and give proofs via rewriting systems due to Zhang (1990s) of famous results due to Adian (1960s), giving a solution to the word problem in all monoids given by a single defining relation of the form w=1. In the final talk (if there is time) I will dip our toes into how rewriting systems can compute the (co)homology of a monoid, and give new proofs via the spectral sequence of certain rewriting systems (forthcoming) of homological results due to Gray & Steinberg (2023).

In this series of talks, I'll present the basics of combinatorial semigroup theory, starting with elementary results and ending in recent research using high-powered tools. I'll begin by giving an overview of the elements of semigroup theory, including the analogue of Cayley's theorem, eggbox diagrams, Green's relations, inverse semigroups, and a famous result due to Green & Penrose. In the subsequent talk, I'll present the elements of presentations of semigroups, free (inverse) semigroups, Munn trees, and rewriting systems, leading into the fundamental problem central to combinatorial semigroup theory: the word problem. In the next talk, I'll dive into a particular class of semigroups called "special" monoids, and give proofs via rewriting systems due to Zhang (1990s) of famous results due to Adian (1960s), giving a solution to the word problem in all monoids given by a single defining relation of the form w=1. In the final talk (if there is time) I will dip our toes into how rewriting systems can compute the (co)homology of a monoid, and give new proofs via the spectral sequence of certain rewriting systems (forthcoming) of homological results due to Gray & Steinberg (2023).

A normal projective surface with the same Betti numbers of the projective plane CP2 is called a rational homology projective plane (briefly Q-homology CP2 or QHCP2). People working in algebraic geometry and topology have long studied a Q-homology CP2 with possibly quotient singularities. It has been known that it has at most five such singular points, but it is still mysterious so that there are many unsolved problems left. In this talk, I’ll review some known results and open problems in this field which might be solved and might not be solved in near future. In particular, I’d like to review the following two topics and to report some recent progress: 1. Algebraic Montgomery-Yang problem. 2. Classification of Q-homology CP2 with quotient singularities. This is a joint work with Woohyeok Jo and Kyungbae Park..

In this series of talks, I'll present the basics of combinatorial semigroup theory, starting with elementary results and ending in recent research using high-powered tools. I'll begin by giving an overview of the elements of semigroup theory, including the analogue of Cayley's theorem, eggbox diagrams, Green's relations, inverse semigroups, and a famous result due to Green & Penrose. In the subsequent talk, I'll present the elements of presentations of semigroups, free (inverse) semigroups, Munn trees, and rewriting systems, leading into the fundamental problem central to combinatorial semigroup theory: the word problem. In the next talk, I'll dive into a particular class of semigroups called "special" monoids, and give proofs via rewriting systems due to Zhang (1990s) of famous results due to Adian (1960s), giving a solution to the word problem in all monoids given by a single defining relation of the form w=1. In the final talk (if there is time) I will dip our toes into how rewriting systems can compute the (co)homology of a monoid, and give new proofs via the spectral sequence of certain rewriting systems (forthcoming) of homological results due to Gray & Steinberg (2023).

In this series of talks, I'll present the basics of combinatorial semigroup theory, starting with elementary results and ending in recent research using high-powered tools. I'll begin by giving an overview of the elements of semigroup theory, including the analogue of Cayley's theorem, eggbox diagrams, Green's relations, inverse semigroups, and a famous result due to Green & Penrose. In the subsequent talk, I'll present the elements of presentations of semigroups, free (inverse) semigroups, Munn trees, and rewriting systems, leading into the fundamental problem central to combinatorial semigroup theory: the word problem. In the next talk, I'll dive into a particular class of semigroups called "special" monoids, and give proofs via rewriting systems due to Zhang (1990s) of famous results due to Adian (1960s), giving a solution to the word problem in all monoids given by a single defining relation of the form w=1. In the final talk (if there is time) I will dip our toes into how rewriting systems can compute the (co)homology of a monoid, and give new proofs via the spectral sequence of certain rewriting systems (forthcoming) of homological results due to Gray & Steinberg (2023).

We discuss the fine gradient regularity of nonlinear kinetic Fokker-Planck equations in divergence form. In particular, we present gradient pointwise estimates in terms of a Riesz potential of the right-hand side, which leads to the gradient regularity results under borderline assumptions on the right-hand side. The talk is based on a joint work with Ho-Sik Lee (Bielefeld) and Simon Nowak (Bielefeld).

In this talk, we will discuss some global regularity results for weak solutions to fractional Laplacian type equations. In particular, the operator under consideration involves a weight function satisfying appropriate ellipticity conditions. Under suitable assumptions on the weight function and the right hand side, we show some sharp global regularity results for the function u/d^s in the sense of Lebesgue, Sobolev and H¨older, where d(x) = dist(x, ∂Ω) is the distance to the boundary function. This talk is based on a joint work with S.-S. Byun and K. Kim.

The talk is divided into two parts. In the first part, we review the concept of phase transition in probability theory and mathematical physics, focusing on the standard +/- Ising model. In the second part, we discover why one may expect metastability in the low-temperature regime, and look at some concrete examples that exhibit this phenomenon.

What causes a graph to have high chromatic number? One obvious reason is containing a large clique (a set of pairwise adjacent vertices). This naturally leads to investigation of \(\chi\)-bounded classes of graphs — classes where a large clique is essentially the only reason for large chromatic number. Unfortunately, many interesting graph classes are not \(\chi\)-bounded. An eerily common obstruction to being \(\chi\)-bounded are the Burling graphs — a family of triangle-free graphs with unbounded chromatic number. These graphs have served as counterexamples in many settings: demonstrating that graphs excluding an induced subdivision of \(K_{5}\) are not \(\chi\)-bounded, that string graphs are not \(\chi\)-bounded, that intersection graphs of boxes in \({\mathbb{R}}^{3}\) are not \(\chi\)-bounded, and many others. In many of these cases, this sequence is the only known obstruction to \(\chi\)-boundedness. This led Chudnovsky, Scott, and Seymour to conjecture that any graph of sufficiently high chromatic number must either contain a large clique, an induced proper subdivision of a clique, or a large Burling graph as an induced subgraph. The prevailing belief was that this conjecture should be false. Somewhat surprisingly, we did manage to prove it under an extra assumption on the “locality” of the chromatic number — that the input graph belongs to a \(2\)-controlled family of graphs, where a high chromatic number is always certified by a ball of radius \(2\) with large chromatic number. In this talk, I will present this result and discuss its implications in structural graph theory, and algorithmic implications to colouring problems in specific graph families. This talk is based on joint work with Tara Abrishami, James Davies, Xiying Du, Jana Masaříková, Paweł Rzążewski, and Bartosz Walczak conducted during the STWOR2 workshop in Chęciny Poland.

In this talk, we consider the dispersion-managed nonlinear Schrödinger equation (DM NLS), which naturally arises in modeling of fiber-optic communication systems with periodically varying dispersion profiles. We discuss the well-posedness of the DM NLS and the threshold phenomenon related to the existence of minimizers for its ground states.

In this talk, we discuss the paper “Identifying key drivers in a stochastic dynamical system through estimation of transfer entropy between univariate and multivariate time series” by Julian Lee, Physical Review E, 2025.

The Lipshitz-Ozsvath-Thurston correspondence is a combinatorial way to describe the bordered Floer homology of a knot complement from the UV=0 coefficient knot Floer homology of the given knot. This is then used to compute the knot Floer homology of satellite knots. In this talk, we show that there is a "relative" version of this correspondence, between homotopy classes of type D morphisms of bordered Floer homology and locally symmetric chain maps of knot Floer complexes, modulo the "canonical negative class". This gives us a fully combinatorial process to compute knot Floer cobordism maps of satellite concordances in the UV=0 knot Floer homology.

A rooted spanning tree of a graph $G$ is called normal if the endvertices of all edges of $G$ are comparable in the tree order. It is well known that every finite connected graph has a normal spanning tree (also known as depth-first search tree). Also, all countable graphs have normal spanning trees, but uncountable complete graphs for example do not. In 2021, Pitz proved the following characterisation for graphs with normal spanning trees, which had been conjectured by Halin: A connected graph $G$ has a normal spanning tree if and only if every minor of $G$ has countable colouring number, i.e. there is a well-order of the vertices such that every vertex is preceded by only finitely many of its neighbours. More generally, a not necessarily spanning tree in $G$ is called normal if for every path $P$ in $G$ with both endvertices in $T$ but no inner vertices in $T$, the endvertices of $P$ are comparable in the tree order. We establish a local version of Pitz’s theorem by characterising for which sets $U$ of vertices of $G$ there is a normal tree in $G$ covering $U$. The results are joint work with Max Pitz.

Abstract: In this talk, we consider the Navier-Stokes-Poisson (NSP) system which describes the dynamics of positive ions in a collision-dominated plasma. The NSP system admits a one-parameter family of smooth traveling waves, known as shock profiles. I will present my research on the stability of the shock profiles. Our analysis is based on the pointwise semigroup method, a spectral approach. We first establish spectral stability. Based on this, we obtain pointwise bounds on the Green's function for the associated linearized problem, which yield linear and nonlinear asymptotic orbital stability.

In this talk, we discuss the paper, “Entrainment and multi-stability of the p53 oscillator in human cells” by Alba Jiménez et al., Cell Systems, 2024.

Serrin’s overdetermined problem is a famous result in mathematics that deals with the uniqueness and symmetry of solutions to certain boundary value problems. It is called "overdetermined" because it has more boundary conditions than usually required to determine a solution, which leads to strong restrictions on the shape of the domain. In this talk, we discuss overdetermined boundary value problems in a Riemannian manifold and discuss a Serrin-type symmetry result to the solution to an overdetermined Steklov eigenvalue problem on a domain in a Riemannian manifold with nonnegative Ricci curvature and it will be discussed about an overdetermined problems with a nonconstant Neumann boundary condition in a warped product manifold.

We present recent developments on the quantitative stability of the Sobolev inequalities, as well as the stability of critical points of their Euler–Lagrange equations.  In particular, we introduce our recent joint work with H. Chen (Hanyang University) and J. Wei (The Chinese University of Hong Kong) on the stability of the Yamabe problem, the fractional Lane–Emden equation for all possible orders, and the Brezis-Nirenberg problem.

Abstract:The logistic diffusive model provides the population distribution of a species according to time under a fixed open domain in R^n, a dispersal rate, and a given resource distribution. In this talk, we discuss the solution of the model and its equilibrium. First, we show the existence, uniqueness, and regularity results of the solution and the equilibrium. Then, we investigate two contrasting behaviors of the equilibrium with respect to the dispersal rate by applying two methods for each case: sub-super solution method and asymptotic expansion. Finally, we introduce an optimizing problem of a total population of the equilibrium with respect to resource distribution and prove a significant property of an optimal control called bang-bang. References: [1] Cantrell, R.S., Cosner, C. Spatial ecology via reaction-diffusion equation. Wiley series in mathematical and computational biology, John Wiley & Sons Ltd (2003) [2] I. Mazari, G. Nadin, Y. Privat, Optimization of the total population size for logistic diffusive equations: Bang-bang property and fragmentation rate, Communications in Partial Differential Equation 47 (4) (Dec 2021) 797-828

The advent of single-cell transcriptomics has brought a greatly improved understanding of the heterogeneity of gene expression across cell types, with important applications in developmental biology and cancer research. Single-cell RNA sequencing datasets, which are based on tags called universal molecular identifiers, typically include a large number of zeroes. For such datasets, genes with even moderate expression may be poorly represented in sequencing count matrices. Standard pipelines often retain only a small subset of genes for further analysis, but we address the problem of estimating relative expression across the entire transcriptome by adopting a multivariate lognormal Poisson count model. We propose empirical Bayes estimation procedures to estimate latent cell-cell correlations, and to recover meaningful estimates for genes with low expression. For small groups of cells, an important sampling procedure uses the full cell-cell correlation structure and is computationally feasible. For larger datasets, we propose a gene-level shrinkage procedure that has favorable performance for datasets with approximately compound symmetric cell-cell correlation. A fast procedure that incorporates matrix approximations is also promising, and extensible to very large datasets. We apply our approaches to simulated and real datasets, and demonstrate favorable performance in comparisons to competing normalization approaches. We further illustrate the applications of our approach in downstream analyses, including cell-type clustering and identification.

In this talk, we discuss the paper “Accurate predictions on small data with a tabular foundation model” by Noah Hollmann et al., Nature (2025).

Graph coloring is one of the central topics in graph theory, and there have been extensive studies about graph coloring and its variants. In this talk, we focus on the structural and algorithmic aspects of graph coloring together with their interplay. Specifically, we explain how local information on graphs can be transformed into global properties and how these can be used to investigate coloring problems from structural and algorithmic perspectives. We also introduce the notion of dicoloring, a variant of coloring defined for directed graphs, and present our recent work on dicoloring for a special type of directed graph called tournaments.

---

심사위원장: 이용남, 심사위원: 곽시종, 박진형, 홍재현(기초과학연구원), 황준묵(기초과학연구원)

TBD

---

심사위원장: 이용남, 심사위원: 곽시종, 박진형, 박의성(고려대학교), 한강진(DGIST)

Modular forms continue to attract attention for decades with many different application areas. To study statistical properties of modular forms, including for instance Sato-Tate like problems, it is essential to be able to compute a large number of Fourier coefficients. In this talk, firstly, we will show that this can be achieved in level 4 for a large range of half-integral weights by making use of one of three explicit bases, the elements of which can be calculated via fast power series operations. After having "many" Fourier coefficients, it is time to ask the following question: Can the dis- tribution of normalised Fourier coefficients of half-integral weight level 4 Hecke eigenforms with bounded indices be approximated by a distribution? We will suggest that they follow the generalised Gaussian distribution and give some numerical evidence for that. Finally, we will see that the appar- ent symmetry around zero of the data lends strong evidence to the Bruinier- Kohnen Conjecture on the equidistribution of signs and even suggests the strengthening that signs and absolute values are distributed independently. This is joint work with Gabor Wiese (Luxembourg), Zeynep Demirkol Ozkaya (Van) and Elif Tercan (Bilecik).

Diophantine equations involving specific number sequences have attracted considerable attention. For instance, studying when a Tribonacci number can be expressed as the product of two Fibonacci numbers is an interesting problem. In this case, the corresponding Diophantine equation has only two nontrivial integer solutions. While finding these solutions is relatively straightforward, proving that no further solutions exist requires a rigorous argument-this is where Baker’s method plays a crucial role. After conducting a comprehensive literature review on the topic, we present our recent results on Diophantine equations involving Fibonacci, Tribonacci, Jacobsthal, and Perrin numbers. Furthermore, as an application of Baker’s method, we will briefly demonstrate how linear forms in logarithms can be effectively applied to Diophantine equations involving Fibonacci-like sequences. This is joint work with Zeynep Demirkol Ozkaya (Van), Zekiye Pinar Cihan (Bilecik) and Meltem Senadim (Bilecik).

By utilizing the recently developed hypergraph analogue of Godsil’s identity by the second author, we prove that for all $n \geq k \geq 2$, one can reconstruct the matching polynomial of an $n$-vertex $k$-uniform hypergraph from the multiset of all induced sub-hypergraphs on $\lfloor \frac{k-1}{k}n \rfloor + 1$ vertices. This generalizes the well-known result of Godsil on graphs in 1981 to every uniform hypergraph. As a corollary, we show that for every graph $F$, one can reconstruct the number of $F$-factors in a graph under analogous conditions. We also constructed examples that imply the number $\lfloor \frac{k-1}{k}n \rfloor + 1$ is the best possible for all $n\geq k \geq 2$ with $n$ divisible by $k$. This is joint work Donggyu Kim.

The singular limit problem is an important issue in various forms of ODEs and PDEs, and it is particularly known as a fundamental problem in equations derived from fluid dynamics. In this presentation, I will introduce some general phenomena of the singular limit problem through several examples. Subsequently, I will examine how the solution of the Euler-Maxwell equations converges to the MHD equations under the assumption that the speed of light approaches infinity, and how the Boussinesq equations converge to the QG equations in certain regimes.

Individual human cancer cells often show different responses to the same treatment. In this talk I will share the quantitative experimental approaches my lab has developed for studying the fate and behavior of human cells at the single-cell level. I will focus on the tumor suppressor protein p53, a transcription factor controlling genomic integrity and cell survival. In the last several years we have established the dynamics of p53 (changes in its levels over time) as an important mechanism controlling gene expression and guiding cellular outcomes. I will present recent studies from the lab demonstrating how studying p53 dynamics in response to radiation and chemotherapy in single cells can guide the design and schedule of combinatorial therapy, and how the p53 oscillator can be used to study the principles and function of entertainment in Biology. I will also present new findings suggesting that p53’s post-translational modification state is altered between its first and second pulses of expression, and the effects these have on gene expression programs over time.

Wavelets provide a versatile framework for signal representation and analysis, integrating ideas from harmonic analysis, approximation theory, and practical algorithm design. In this talk, we introduce foundational concepts in wavelet theory, focusing on classical results regarding wavelet expansions and approximations. Building on these basics, we explore modern developments and discuss how these approaches can balance theoretical rigor with practical convenience. The presentation aims to offer both a solid introduction to classical wavelet theory and a glimpse into current and future research directions. Part of the talk is based on joint work with Hyojae Lim.

A surface can be decomposed into a union of pairs of pants, a construction known as a pants decomposition. This fundamental observation reveals many important properties of surfaces. By forming a simplicial graph whose vertices represent pants decompositions, connecting two vertices with an edge whenever the corresponding decompositions differ by a simple move, we obtain a graph that is quasi-isometric to the Weil–Petersson metric on Teichmüller space. Meanwhile, topologists often study a structure called a rose, formed by attaching multiple circles at a single point. A rose is homotopy equivalent to a compact surface with boundary. Consequently, we can define a pants decomposition of a rose as the pants decomposition of a surface homotopy equivalent to it. In this talk, we will explore the concept of pants decompositions specifically in the context of roses.

H. Föllmer introduced in 1981 a version of Itô's formula without any probabilistic assumptions. It has been generalized in several aspects, including pathwise Tanaka's formula, high-order, and functional change-of-variable formula. Its drawbacks and a brief application to mathematical finance will also be presented.

In this note, we investigate threshold conditions for global well-posedness and finite-time blow-up of solutions to the focusing cubic nonlinear Klein–Gordon equation (NLKG) on $\bbR^{1+3}$ and the focusing cubic nonlinear Schrödinger equation (NLS) on $\bbR$. Our approach is based on the Payne–Sattinger theory, which identifies invariant sets through energy functionals and conserved quantities. For NLKG, we review the Payne–Sattinger theory to establish a sharp dichotomy between global existence and blow-up. For NLS, we apply this theory with a scaling argument to construct scale-invariant thresholds, replacing the standard mass-energy conditions with a $\dot{H}^{\frac12}$-critical functional. This unified framework provides a natural derivation of global behavior thresholds for both equations.

In this talk, we will discuss about smooth random dynamical systems and group actions on surfaces. Random dynamical systems, especially understanding stationary measures, can play an important role to understand group actions. For instance, when a group action on torus is given by toral automorphisms, using random dynamics, Benoist-Quint classified all orbit closures. In this talk, we will study non-linear actions on surfaces using random dynamics. We will discuss about absolutely continuity and exact dimensionality of stationary measures as well as classification of orbit closures. This talk will be mostly about the ongoing joint work with Aaron Brown, Davi Obata, and Yuping Ruan.

Our present healthcare system focuses on treating people when they are ill rather than keeping them healthy. We have been using big data and remote monitoring approaches to monitor people while they are healthy to keep them that way and detect disease at its earliest moment presymptomatically. We use advanced multiomics technologies (genomics, immunomics, transcriptomics, proteomics, metabolomics, microbiomics) as well as wearables and microsampling for actively monitoring health. Following a group of 109 individuals for over 13 years revealed numerous major health discoveries covering cardiovascular disease, oncology, metabolic health and infectious disease. We have also found that individuals have distinct aging patterns that can be measured in an actionable period of time. Finally, we have used wearable devices for early detection of infectious disease, including COVID-19 as well as microsampling for monitoring and improving lifestyle. We believe that advanced technologies have the potential to transform healthcare and keep people healthy.

Hyperbolicity is a fundamental concept that connects differential geometry and algebraic geometry. It is in general very hard to determine whether a given manifold or variety is hyperbolic or not. A key tool for verifying hyperbolicity is symmetric differentials; more precisely, the positivity of the cotangent bundle. In this talk, I will introduce various notions of hyperbolicity and explore their geometric properties. I will also discuss how the cotangent bundle, or more generally the syzygy bundle, plays a crucial role in this context.

We establish the generic local Langlands correspondence by showing the equality of Langlands-Shahidi L-functions and Artin L-functions in the case of even unitary similitude groups. As an application, with one assumption on L-function, we prove both weak and strong versions of the generic Arthur packet conjectures in the cases of even unitary similitude groups and even unitary groups. Furthermore, we describe and define generic L-packets and therefore we were able to remove the above assumption. With our definition of L-packets, we recently prove its expected properties such as Shahidi's conjecture and finiteness of L-packets. This is in preparation and joint work with Muthu Krishnamurthy and Freydoon Shahidi.

The Langlands program, introduced by Robert Langlands, is a set of conjectures that attempt to build bridges between two different areas: Number Theory and Representation Theory (Automorphic forms). The program is also known as a generalization of a well-known theorem called Fermat’s Last Theorem. More precisely, when Andrew Wiles proved Fermat’s Last Theorem, he proved a special case of so-called Taniyama-Shimura-Weil Conjecture, which states that every elliptic curve is modular. And as a corollary, he was able to prove Fermat’s Last Theorem since Taniyama-Shimura-Weil Conjecture implies that certain elliptic curves associated with Fermat-type equations must be modular, leading to a contradiction. Note that the Langlands program is a generalization of the Taniyama-Shimura-Weil conjecture. In the first part of the colloquium, we briefly go over the following subjects: (1) Fermat’s Last Theorem (2) Taniyama-Shimura-Weil conuecture And then, in the remaining of the talk, we start to explain a bit of the Langlands program (3) Langlands program and L-functions (4) (If time permits) Recent progress This colloquium will be accessible to graduate students in other fields of mathematics (and undergraduate students who are interested in Number theory) at least in the first part.

---

심사위원장: 백형렬, 심사위원: 김우진, 박정환, 김상현(고등과학원), 이상진(건국대학교)

The dimension of a poset is the least integer $d$ such that the poset is isomorphic to a subposet of the product of $d$ linear orders. In 1983, Kelly constructed planar posets of arbitrarily large dimension. Crucially, the posets in his construction involve large standard examples, the canonical structure preventing a poset from having small dimension. Kelly’s construction inspired one of the most challenging questions in dimension theory: are large standard examples unavoidable in planar posets of large dimension? We answer the question affirmatively by proving that every $d$-dimensional planar poset contains a standard example of order $\Omega(d)$. More generally, we prove that every poset from Kelly’s construction appears in every poset with a planar cover graph of sufficiently large dimension. joint work with Heather Smith Blake, Jędrzej Hodor, Piotr Micek, and William T. Trotter.

In this talk, we will introduce vector field method for the wave equation. The key step is to establish the Klainerman-Sobolev inequality developed in [1]. Using this inequality, we will provide dispersive estimates of the linear wave equation, and prove small-data global existence for some nonlinear wave equations. The main reference will be Chapter II in [2]. 참고문헌: [1]. Sergiu Klainerman, Uniform decay estimates and the Lorentz invariance of the classical wave equation, Comm. Pure Appl. Math. 38 (1985), no. 3, 321–332. MR 784477 [2]. Christopher D. Sogge, Lectures on Nonlinear Wave Equations, Second Edition

The standard theory of infectious diseases, tracing back to the work of Kermack and McKendrick nearly a century ago, has been a triumph of mathematical biology, a rare marriage of theory and application. Yet the limitations of its most simple representations, which has always been known, have been laid bare in dealing with COVID-19, sparking a spate of extensions of the basic theory to deal more effectively with aspects of viral evolution, asymptotic stages, heterogeneity of various kinds, the ambiguities of notions of herd immunity, the role of social behaviors and other features. This lecture will address some progress in addressing these, and open challenges in expanding the mathematical theory.

TBD

Since the proof of the graph minor structure theorem by Robertson and Seymour in 2004, its underlying ideas have found applications in a much broader range of settings than their original context. They have driven profound progress in areas such as vertex minors, pivot minors, matroids, directed graphs, and 2-dimensional simplicial complexes. In this talk, I will present three open problems related to this development, each requiring some background.

Abstract: We consider the initial-boundary value problem (IBVP) for the 1D isentropic Navier-Stokes equation (NS) in the half space. Unlike the whole space problem, a boundary layer may appear due to the influence of viscosity. In this talk, we first briefly study the asymptotic behavior for the initial value problem of NS in the whole space. Afterwards, we will present the characterization of the expected asymptotics for the IBVP of NS in the half space. Here, we focus only on the inflow problem, where the fluid velocity is positive on the boundary. Reference: Matsumura, Akitaka. Inflow and outflow problems in the half space for a one-dimensional isentropic model system of compressible viscous gas. Methods Appl. Anal. 8 (2001), no. 4, 645–666.

In this talk, we explore some ordinary and partial differential equations (ODEs and PDEs) in a class of completely integrable systems. We begin by introducing Hamiltonian systems in classical mechanics and their integrability. We then discuss completely integrable ODEs and introduce the Lax pair formulation, a powerful framework for analyzing complete integrability. As a concrete example, we examine the classical Calogero-Moser system, a well-known completely integrable many-body system with remarkable mathematical properties. We then investigate the Calogero-Moser derivative nonlinear Schrödinger equation (CM-DNLS), which is a completely integrable PDE that arises as the continuum limit of the classical Calogero-Moser system. Finally, we present recent developments in the study of CM-DNLS, such as well-posedness and long-time dynamics.

We study stochastic motion of objects in micrometer-scale living systems: tracer particles in living cells, pathogens in mucus, and single cells foraging for food. We use stochastic models and state space models to track objects through time and infer properties of objects and their surroundings. For example, we can calculate the distribution of first passage times for a pathogen to cross a mucus barrier, or we can spatially resolve the fluid properties of the cytoplasm in a living cell. Recently developed computational tools, particularly in the area of Markov Chain Monte Carlo, are creating new opportunities to improve multiple object tracking. The primary remaining challenge, called the data association problem, involves mapping measurement data (e.g., positions of objects in a video) to objects through time. I will discuss new developments in the field and ongoing efforts in my lab to implement them. I will motivate these techniques with specific examples that include tracking salmonella in GI mucus, genetically expressed proteins in the cell cytoplasm, active transport of nuclei in multinucleate fungal cells, and raphid diatoms in seawater surface interfaces.

Molecular simulations serve as fundamental tools for understanding and predicting the system of interest at atomic level. It is significant for applications like drug and material discovery, but often cannot scale to real-world problems due to the computational bottleneck. In this seminar, I will briefly introduce this area and recent machine learning algorithms that have shown great promise in accelerating the molecular simulations. I will also introduce some of my recent research in this direction. First work is about structure prediction of metal-organic frameworks using geometric flow matching (or neural ODE on SO(3) manifolds) and (2) simulating chemical reactions / transition paths through RL-like training of diffusion models (or log-divergence minimization between path measures).