Wednesday, June 11, 2025

2025-06-18 / 16:00 ~ 18:00

by ()

An n-dimensional k-handlebody is an n-manifold obtained from an n-ball by attaching handles of index up to k, where n ≥ k. We will discuss that for any n ≥ 2k + 1, any n-dimensional k-handlebody is diffeomorphic to the product of a 2k-dimensional k-handlebody and an (n − 2k)-ball. For example, a 2025-dimensional 6-handlebody is the product of an 12-dimensional 6-handlebody and a 2013-ball. We also introduce (n,k)-Kirby diagrams for some n-dimensional k-handlebodies. Here (4,2)-Kirby diagrams correspond to the classical Kirby diagrams for 4-dimensional 2-handlebodies.

2025-06-17 / 16:30 ~ 17:30

IBS-KAIST 세미나 - 이산수학: The Quantitative Fractional Helly Theorem

by Attila Jung(Eötvös Loránd University)

Two celebrated extensions of Helly’s theorem are the Fractional Helly theorem of Katchalski and Liu (1979) and the Quantitative Volume theorem of Barany, Katchalski, and Pach (1982). Improving on several recent works, we prove an optimal combination of these two results. We show that given a family $F$ of $n$ convex sets in $\mathbb{R}^d$ such that at least $\alpha \binom{n}{d+1}$ of the $(d+1)$-tuples of $F$ have an intersection of volume at least 1, then one can select $\Omega_{d,\alpha}(n)$ members of $F$ whose intersection has volume at least $\Omega_d(1)$. Joint work with Nora Frankl and Istvan Tomon.

2025-06-17 / 14:30 ~ 15:30

학과 세미나/콜로퀴엄 - 위상수학 세미나:

by ()

In this talk, we study several computational problems related to knots and links. We investigate lower bounds on the computational complexity of theoretical knot theory problems. Unknotting number is one of the most interesting knot invariants, and various research has been done to find unknotting numbers of knots. However, compared to its simple definition, it is generally hard to find the unknotting number of a knot, and it is known for only some knots. There is no algorithm for determining unknotting numbers yet. First, we show that for an arbitrary positive integer n, a non-torus knot exists with the unknotting number n. Second, we show that the computational complexity of the diagrammatic un-knotting number problem is NP-hard. We construct a Karp reduction from 3-SAT to the diagrammatic unknotting number problem. Third, we also prove that the prime sublink problem is NP-hard by making a Karp reduction from the known NP-complete problem, the non-tautology problem.

2025-06-11 / 16:00 ~ 17:00

학과 세미나/콜로퀴엄 - 대수기하학:

by ()

Computing obstructions is a useful tool for determining the dimension and singularity of a Hilbert scheme at a given point. However, this task can be quite challenging when the obstruction space is nonzero. In a previous joint work with S. Mukai and its sequels, we developed techniques to compute obstructions to deforming curves on a threefold, under the assumption that the curves lie on a "good" surface (e.g., del Pezzo, K3, Enriques, etc.) contained in the threefold. In this talk, I will review some known results in the case where the intermediate surface is a K3 surface and the ambient threefold is Fano. Finally, I will discuss the deformations of certain space curves lying on a complete intersection K3 surface, and the construction of a generically non-reduced component of the Hilbert scheme of P^5.

Events for the 취소된 행사 포함