# 세미나 및 콜로퀴엄

2019-01
Sun Mon Tue Wed Thu Fri Sat
1 2 3 1 4 2 5
6 7 8 9 10 11 12
13 14 15 1 16 17 18 19
20 21 1 22 23 24 25 1 26
27 28 1 29 30 31
2019-02
Sun Mon Tue Wed Thu Fri Sat
1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28

구글 Calendar나 iPhone 등에서 구독하면 세미나 시작 전에 알림을 받을 수 있습니다.

signed graph is a pair (G, σ), where G is a graph and σ: E(G) → {1,-1} is a signature of G. A set S of integers is symmetric if I∈S implies that -i∈S. A k-colouring of (G,σ) is a mapping f:V(G) → Nk such that for each edge e=uv, f(x)≠σ(e) f(y), where Nk is a symmetric integer set of size k. We define the signed chromatic number of a graph G to be the minimum integer k such that for any signature σ of G, (G, σ) has a k-colouring.

Let f(n,k) be the maximum signed chromatic number of an n-vertex k-chromatic graph. This paper determines the value of f(n,k) for all positive integers n ≥ k. Then we study list colouring of signed graphs. A list assignment L of G is called symmetric if L(v) is a symmetric integer set for each vertex v. The weak signed choice number ch±w(G) of a graph G is defined to be the minimum integer k such that for any symmetric k-list assignment L of G, for any signature σ on G, there is a proper L-colouring of (G, σ). We prove that the difference ch±w(G)-χ±(G) can be arbitrarily large. On the other hand, ch±w(G) is bounded from above by twice the list vertex arboricity of G. Using this result, we prove that ch±w(K2⋆n)= χ±(K2⋆n) = ⌈2n/3⌉ + ⌊2n/3⌋. This is joint work with Ringi Kim and Xuding Zhu.

Host: Sang-il Oum     미정     2019-01-24 12:20:45

In this talk, I will introduce the idea to study the Noether inequality for 3-folds of general type with the geometric genus less than 21. This is my project working in progress with Bingru Li.

Host: 이용남     영어     2019-01-16 14:33:54

A Verra fourfold is a smooth projective complex variety defined as a double cover of P^2x P^2 branched along a divisor of bidegree (2,2).
These varieties are similar to cubic fourfolds in several ways (Hodge theory, relation to hyperkaehler fourfolds, derived categories).
Inspired by these multiple analogies, I consider the Chow ring of a Verra fourfold. Among other things, I will show that the multiplicative structure of this Chow ring has a curious K3-like property.

Host: 박진현     Contact: 박진현 (2734)     영어     2018-12-19 18:50:47

The generalized Franchetta conjecture as formulated by O’Grady is about algebraic cycles on the universal K3 surface. It is natural to consider a similar conjecture for algebraic cycles on universal families of hyperkaehler varieties. This has close ties to Beauville’s conjectural splitting property’’, and the Beauville-Voisin conjecture (stating that the Chow ring of a hyperkaehler variety has a certain subring injecting into cohomology). In my talk, I will attempt to give an overview of these conjectures, and present some cases where they can be proven. This is joint work with Lie Fu, Charles Vial and Mingmin Shen.

Host: 박진현     Contact: 박진현 (2734)     영어     2018-12-19 18:49:02

A flag Bott tower is a sequence of flag bundles such that each stage of which comes from the induced full-flag bundle of a sum of holomorphic line bundles. A flag Bott manifold is not toric variety but it has a torus action. In this talk, we consider the standard torus action on a flag Bott manifold and compute its equivariant cohomology ring.

Host: 송종백     미정     2018-12-27 11:32:55

Problems such as Vertex Cover and Multiway Cut have been well-studied in parameterized complexity. Cygan et al. 2011 drastically improved the running time of several problems including Multiway Cut and Almost 2SAT by employing LP-guided branching and aiming for FPT algorithms parameterized above LP lower bounds. Since then, LP-guided branching has been studied in depth and established as a powerful technique for parameterized algorithms design.

In this talk, we make a brief overview of LP-guided branching technique and introduce the latest results whose parameterization is above even stronger lower bounds, namely μ(I)=2LP(I)-IP(dual-I). Here, LP(I) is the value of an optimal fractional solution and IP(dual-I) is the value of an optimal integral dual solution. Tutte-Berge formula for Maximum Matching (or equivalently Edmonds-Gallai decomposition) and its generalization Mader’s min-max formula are exploited to this end. As a result, we obtain an algorithm running in time 4^(k-μ(I)for multiway cut and its generalizations, where k is the budget for a solution.

This talk is based on a joint work with Yoichi Iwata and Yuichi Yoshida from NII.

Host: 엄상일     미정     2018-12-28 09:58:28

A celebrated conjecture of Sidorenko and Erdős–Simonovits states that, for all bipartite graphs H, quasirandom graphs contain asymptotically the minimum number of copies of H taken over all graphs with the same order and edge density. This conjecture has attracted considerable interest over the last decade and is now known to hold for a broad range of bipartite graphs, with the overall trend saying that a graph satisfies the conjecture if it can be built from simple building blocks such as trees in a certain recursive fashion.

Our contribution here, which goes beyond this paradigm, is to show that the conjecture holds for any bipartite graph H with bipartition A∪B where the number of vertices in B of degree k satisfies a certain divisibility condition for each k. As a corollary, we have that for every bipartite graph H with bipartition A∪B, there is a positive integer p such that the blow-up H_A^p formed by taking p vertex-disjoint copies of H and gluing all copies of A along corresponding vertices satisfies the conjecture. Joint work with David Conlon.

Host: 엄상일     미정     2018-12-28 09:57:00